:: PROCAL_1 semantic presentation

theorem Th1: :: PROCAL_1:1
for b1 being Element of CQC-WFF holds 'not' (b1 '&' ('not' b1)) in TAUT
proof end;

Lemma2: for b1, b2 being Element of CQC-WFF holds b1 'or' b2 = ('not' b1) => b2
proof end;

theorem Th2: :: PROCAL_1:2
for b1 being Element of CQC-WFF holds b1 'or' ('not' b1) in TAUT
proof end;

theorem Th3: :: PROCAL_1:3
for b1, b2 being Element of CQC-WFF holds b1 => (b1 'or' b2) in TAUT
proof end;

theorem Th4: :: PROCAL_1:4
for b1, b2 being Element of CQC-WFF holds b1 => (b2 'or' b1) in TAUT
proof end;

theorem Th5: :: PROCAL_1:5
for b1, b2 being Element of CQC-WFF holds (b1 'or' b2) => (('not' b1) => b2) in TAUT
proof end;

theorem Th6: :: PROCAL_1:6
for b1, b2 being Element of CQC-WFF holds ('not' (b1 'or' b2)) => (('not' b1) '&' ('not' b2)) in TAUT
proof end;

theorem Th7: :: PROCAL_1:7
for b1, b2 being Element of CQC-WFF holds (('not' b1) '&' ('not' b2)) => ('not' (b1 'or' b2)) in TAUT
proof end;

theorem Th8: :: PROCAL_1:8
for b1, b2 being Element of CQC-WFF holds (b1 'or' b2) => (b2 'or' b1) in TAUT
proof end;

theorem Th9: :: PROCAL_1:9
for b1 being Element of CQC-WFF holds ('not' b1) 'or' b1 in TAUT
proof end;

theorem Th10: :: PROCAL_1:10
for b1, b2 being Element of CQC-WFF holds ('not' (b1 'or' b2)) => ('not' b1) in TAUT
proof end;

theorem Th11: :: PROCAL_1:11
for b1 being Element of CQC-WFF holds (b1 'or' b1) => b1 in TAUT
proof end;

theorem Th12: :: PROCAL_1:12
for b1 being Element of CQC-WFF holds b1 => (b1 'or' b1) in TAUT by Th3;

theorem Th13: :: PROCAL_1:13
for b1, b2 being Element of CQC-WFF holds (b1 '&' ('not' b1)) => b2 in TAUT
proof end;

theorem Th14: :: PROCAL_1:14
for b1, b2 being Element of CQC-WFF holds (b1 => b2) => (('not' b1) 'or' b2) in TAUT
proof end;

Lemma11: for b1, b2 being Element of CQC-WFF holds (b1 '&' b2) => (('not' ('not' b1)) '&' b2) in TAUT
proof end;

Lemma12: for b1, b2 being Element of CQC-WFF holds (('not' ('not' b1)) '&' b2) => (b1 '&' b2) in TAUT
proof end;

theorem Th15: :: PROCAL_1:15
for b1, b2 being Element of CQC-WFF holds (b1 '&' b2) => ('not' (b1 => ('not' b2))) in TAUT
proof end;

theorem Th16: :: PROCAL_1:16
for b1, b2 being Element of CQC-WFF holds ('not' (b1 => ('not' b2))) => (b1 '&' b2) in TAUT
proof end;

theorem Th17: :: PROCAL_1:17
for b1, b2 being Element of CQC-WFF holds ('not' (b1 '&' b2)) => (('not' b1) 'or' ('not' b2)) in TAUT
proof end;

theorem Th18: :: PROCAL_1:18
for b1, b2 being Element of CQC-WFF holds (('not' b1) 'or' ('not' b2)) => ('not' (b1 '&' b2)) in TAUT
proof end;

theorem Th19: :: PROCAL_1:19
for b1, b2 being Element of CQC-WFF holds (b1 '&' b2) => b1 in TAUT
proof end;

theorem Th20: :: PROCAL_1:20
for b1, b2 being Element of CQC-WFF holds (b1 '&' b2) => (b1 'or' b2) in TAUT
proof end;

theorem Th21: :: PROCAL_1:21
for b1, b2 being Element of CQC-WFF holds (b1 '&' b2) => b2 in TAUT
proof end;

theorem Th22: :: PROCAL_1:22
for b1 being Element of CQC-WFF holds b1 => (b1 '&' b1) in TAUT
proof end;

theorem Th23: :: PROCAL_1:23
for b1, b2 being Element of CQC-WFF holds (b1 <=> b2) => (b1 => b2) in TAUT
proof end;

theorem Th24: :: PROCAL_1:24
for b1, b2 being Element of CQC-WFF holds (b1 <=> b2) => (b2 => b1) in TAUT
proof end;

theorem Th25: :: PROCAL_1:25
for b1, b2, b3 being Element of CQC-WFF holds ((b1 'or' b2) 'or' b3) => (b1 'or' (b2 'or' b3)) in TAUT
proof end;

theorem Th26: :: PROCAL_1:26
for b1, b2, b3 being Element of CQC-WFF holds ((b1 '&' b2) '&' b3) => (b1 '&' (b2 '&' b3)) in TAUT
proof end;

theorem Th27: :: PROCAL_1:27
for b1, b2, b3 being Element of CQC-WFF holds (b1 'or' (b2 'or' b3)) => ((b1 'or' b2) 'or' b3) in TAUT
proof end;

theorem Th28: :: PROCAL_1:28
for b1, b2 being Element of CQC-WFF holds b1 => (b2 => (b1 '&' b2)) in TAUT
proof end;

theorem Th29: :: PROCAL_1:29
for b1, b2 being Element of CQC-WFF holds (b1 => b2) => ((b2 => b1) => (b1 <=> b2)) in TAUT
proof end;

Lemma23: for b1, b2 being Element of CQC-WFF st b1 in TAUT & b2 in TAUT holds
b1 '&' b2 in TAUT
proof end;

theorem Th30: :: PROCAL_1:30
for b1, b2 being Element of CQC-WFF holds (b1 'or' b2) <=> (b2 'or' b1) in TAUT
proof end;

theorem Th31: :: PROCAL_1:31
for b1, b2, b3 being Element of CQC-WFF holds ((b1 '&' b2) => b3) => (b1 => (b2 => b3)) in TAUT
proof end;

theorem Th32: :: PROCAL_1:32
for b1, b2, b3 being Element of CQC-WFF holds (b1 => (b2 => b3)) => ((b1 '&' b2) => b3) in TAUT
proof end;

theorem Th33: :: PROCAL_1:33
for b1, b2, b3 being Element of CQC-WFF holds (b1 => b2) => ((b1 => b3) => (b1 => (b2 '&' b3))) in TAUT
proof end;

theorem Th34: :: PROCAL_1:34
for b1, b2, b3 being Element of CQC-WFF holds ((b1 'or' b2) => b3) => ((b1 => b3) 'or' (b2 => b3)) in TAUT
proof end;

theorem Th35: :: PROCAL_1:35
for b1, b2, b3 being Element of CQC-WFF holds (b1 => b2) => ((b3 => b2) => ((b1 'or' b3) => b2)) in TAUT
proof end;

theorem Th36: :: PROCAL_1:36
for b1, b2, b3 being Element of CQC-WFF holds ((b1 => b2) '&' (b3 => b2)) => ((b1 'or' b3) => b2) in TAUT
proof end;

theorem Th37: :: PROCAL_1:37
for b1, b2 being Element of CQC-WFF holds (b1 => (b2 '&' ('not' b2))) => ('not' b1) in TAUT
proof end;

theorem Th38: :: PROCAL_1:38
for b1, b2, b3 being Element of CQC-WFF holds ((b1 'or' b2) '&' (b1 'or' b3)) => (b1 'or' (b2 '&' b3)) in TAUT
proof end;

theorem Th39: :: PROCAL_1:39
for b1, b2, b3 being Element of CQC-WFF holds (b1 '&' (b2 'or' b3)) => ((b1 '&' b2) 'or' (b1 '&' b3)) in TAUT
proof end;

theorem Th40: :: PROCAL_1:40
for b1, b2, b3 being Element of CQC-WFF holds ((b1 'or' b2) '&' (b3 'or' b2)) => ((b1 '&' b3) 'or' b2) in TAUT
proof end;

Lemma29: for b1, b2, b3 being Element of CQC-WFF st b1 => b2 in TAUT holds
(b3 '&' b1) => (b3 '&' b2) in TAUT
proof end;

Lemma30: for b1, b2, b3 being Element of CQC-WFF st b1 => b2 in TAUT holds
(b1 'or' b3) => (b2 'or' b3) in TAUT
proof end;

Lemma31: for b1, b2, b3 being Element of CQC-WFF st b1 => b2 in TAUT holds
(b3 'or' b1) => (b3 'or' b2) in TAUT
proof end;

theorem Th41: :: PROCAL_1:41
for b1, b2, b3 being Element of CQC-WFF holds ((b1 'or' b2) '&' b3) => ((b1 '&' b3) 'or' (b2 '&' b3)) in TAUT
proof end;

theorem Th42: :: PROCAL_1:42
for b1, b2 being Element of CQC-WFF st b1 in TAUT holds
b1 'or' b2 in TAUT
proof end;

theorem Th43: :: PROCAL_1:43
for b1, b2 being Element of CQC-WFF st b1 in TAUT holds
b2 'or' b1 in TAUT
proof end;

theorem Th44: :: PROCAL_1:44
for b1, b2 being Element of CQC-WFF st b1 '&' b2 in TAUT holds
b1 in TAUT
proof end;

theorem Th45: :: PROCAL_1:45
for b1, b2 being Element of CQC-WFF st b1 '&' b2 in TAUT holds
b2 in TAUT
proof end;

theorem Th46: :: PROCAL_1:46
for b1, b2 being Element of CQC-WFF st b1 '&' b2 in TAUT holds
b1 'or' b2 in TAUT
proof end;

theorem Th47: :: PROCAL_1:47
for b1, b2 being Element of CQC-WFF st b1 in TAUT & b2 in TAUT holds
b1 '&' b2 in TAUT by Lemma23;

theorem Th48: :: PROCAL_1:48
for b1, b2, b3 being Element of CQC-WFF st b1 => b2 in TAUT holds
(b1 'or' b3) => (b2 'or' b3) in TAUT by Lemma30;

theorem Th49: :: PROCAL_1:49
for b1, b2, b3 being Element of CQC-WFF st b1 => b2 in TAUT holds
(b3 'or' b1) => (b3 'or' b2) in TAUT by Lemma31;

theorem Th50: :: PROCAL_1:50
for b1, b2, b3 being Element of CQC-WFF st b1 => b2 in TAUT holds
(b3 '&' b1) => (b3 '&' b2) in TAUT by Lemma29;

theorem Th51: :: PROCAL_1:51
for b1, b2, b3 being Element of CQC-WFF st b1 => b2 in TAUT holds
(b1 '&' b3) => (b2 '&' b3) in TAUT
proof end;

theorem Th52: :: PROCAL_1:52
for b1, b2, b3 being Element of CQC-WFF st b1 => b2 in TAUT & b1 => b3 in TAUT holds
b1 => (b2 '&' b3) in TAUT
proof end;

theorem Th53: :: PROCAL_1:53
for b1, b2, b3 being Element of CQC-WFF st b1 => b2 in TAUT & b3 => b2 in TAUT holds
(b1 'or' b3) => b2 in TAUT
proof end;

theorem Th54: :: PROCAL_1:54
for b1, b2 being Element of CQC-WFF st b1 'or' b2 in TAUT & 'not' b1 in TAUT holds
b2 in TAUT
proof end;

theorem Th55: :: PROCAL_1:55
for b1, b2 being Element of CQC-WFF st b1 'or' b2 in TAUT & 'not' b2 in TAUT holds
b1 in TAUT
proof end;

theorem Th56: :: PROCAL_1:56
for b1, b2, b3, b4 being Element of CQC-WFF st b1 => b2 in TAUT & b3 => b4 in TAUT holds
(b1 '&' b3) => (b2 '&' b4) in TAUT
proof end;

theorem Th57: :: PROCAL_1:57
for b1, b2, b3, b4 being Element of CQC-WFF st b1 => b2 in TAUT & b3 => b4 in TAUT holds
(b1 'or' b3) => (b2 'or' b4) in TAUT
proof end;

theorem Th58: :: PROCAL_1:58
for b1, b2 being Element of CQC-WFF st (b1 '&' ('not' b2)) => ('not' b1) in TAUT holds
b1 => b2 in TAUT
proof end;