[Lattice L46-7]Home PageHome Quantum Logic Explorer < Previous   Next >
Related theorems
GIF version

Theorem u3lemax4 778
Description: Possible axiom for Kalmbach implication system.
Assertion
Ref Expression
u3lemax4 ((a3 b) →3 ((a3 b) →3 ((b3 a) →3 ((b3 a) →3 ((c3 (c3 a)) →3 (c3 (c3 b))))))) = 1

Proof of Theorem u3lemax4
StepHypRef Expression
1 lem4 493 . 2 ((a3 b) →3 ((a3 b) →3 ((b3 a) →3 ((b3 a) →3 ((c3 (c3 a)) →3 (c3 (c3 b))))))) = ((a3 b) ∪ ((b3 a) →3 ((b3 a) →3 ((c3 (c3 a)) →3 (c3 (c3 b))))))
2 lem4 493 . . . . 5 ((b3 a) →3 ((b3 a) →3 ((c3 (c3 a)) →3 (c3 (c3 b))))) = ((b3 a) ∪ ((c3 (c3 a)) →3 (c3 (c3 b))))
3 lem4 493 . . . . . . 7 (c3 (c3 a)) = (ca)
4 lem4 493 . . . . . . 7 (c3 (c3 b)) = (cb)
53, 42i3 246 . . . . . 6 ((c3 (c3 a)) →3 (c3 (c3 b))) = ((ca) →3 (cb))
65lor 66 . . . . 5 ((b3 a) ∪ ((c3 (c3 a)) →3 (c3 (c3 b)))) = ((b3 a) ∪ ((ca) →3 (cb)))
72, 6ax-r2 35 . . . 4 ((b3 a) →3 ((b3 a) →3 ((c3 (c3 a)) →3 (c3 (c3 b))))) = ((b3 a) ∪ ((ca) →3 (cb)))
87lor 66 . . 3 ((a3 b) ∪ ((b3 a) →3 ((b3 a) →3 ((c3 (c3 a)) →3 (c3 (c3 b)))))) = ((a3 b) ∪ ((b3 a) ∪ ((ca) →3 (cb))))
9 oran3 85 . . . . . 6 ((a3 b) ∪ (b3 a) ) = ((a3 b) ∩ (b3 a))
10 u3lembi 705 . . . . . . 7 ((a3 b) ∩ (b3 a)) = (ab)
1110ax-r4 36 . . . . . 6 ((a3 b) ∩ (b3 a)) = (ab)
129, 11ax-r2 35 . . . . 5 ((a3 b) ∪ (b3 a) ) = (ab)
1312ax-r5 37 . . . 4 (((a3 b) ∪ (b3 a) ) ∪ ((ca) →3 (cb))) = ((ab) ∪ ((ca) →3 (cb)))
14 ax-a3 31 . . . 4 (((a3 b) ∪ (b3 a) ) ∪ ((ca) →3 (cb))) = ((a3 b) ∪ ((b3 a) ∪ ((ca) →3 (cb))))
15 le1 138 . . . . 5 ((ab) ∪ ((ca) →3 (cb))) ≤ 1
16 ska4 415 . . . . . . . 8 ((ab ) ∪ ((ac) ≡ (bc))) = 1
1716ax-r1 34 . . . . . . 7 1 = ((ab ) ∪ ((ac) ≡ (bc)))
18 conb 114 . . . . . . . . . 10 (ab) = (ab )
1918ax-r4 36 . . . . . . . . 9 (ab) = (ab )
20 conb 114 . . . . . . . . . 10 ((ca) ≡ (cb)) = ((ca) ≡ (cb) )
21 ancom 68 . . . . . . . . . . . . 13 (ac) = (ca )
22 anor1 80 . . . . . . . . . . . . 13 (ca ) = (ca)
2321, 22ax-r2 35 . . . . . . . . . . . 12 (ac) = (ca)
24 ancom 68 . . . . . . . . . . . . 13 (bc) = (cb )
25 anor1 80 . . . . . . . . . . . . 13 (cb ) = (cb)
2624, 25ax-r2 35 . . . . . . . . . . . 12 (bc) = (cb)
2723, 262bi 91 . . . . . . . . . . 11 ((ac) ≡ (bc)) = ((ca) ≡ (cb) )
2827ax-r1 34 . . . . . . . . . 10 ((ca) ≡ (cb) ) = ((ac) ≡ (bc))
2920, 28ax-r2 35 . . . . . . . . 9 ((ca) ≡ (cb)) = ((ac) ≡ (bc))
3019, 292or 67 . . . . . . . 8 ((ab) ∪ ((ca) ≡ (cb))) = ((ab ) ∪ ((ac) ≡ (bc)))
3130ax-r1 34 . . . . . . 7 ((ab ) ∪ ((ac) ≡ (bc))) = ((ab) ∪ ((ca) ≡ (cb)))
3217, 31ax-r2 35 . . . . . 6 1 = ((ab) ∪ ((ca) ≡ (cb)))
33 u3lembi 705 . . . . . . . . 9 (((ca) →3 (cb)) ∩ ((cb) →3 (ca))) = ((ca) ≡ (cb))
3433ax-r1 34 . . . . . . . 8 ((ca) ≡ (cb)) = (((ca) →3 (cb)) ∩ ((cb) →3 (ca)))
35 lea 152 . . . . . . . 8 (((ca) →3 (cb)) ∩ ((cb) →3 (ca))) ≤ ((ca) →3 (cb))
3634, 35bltr 130 . . . . . . 7 ((ca) ≡ (cb)) ≤ ((ca) →3 (cb))
3736lelor 158 . . . . . 6 ((ab) ∪ ((ca) ≡ (cb))) ≤ ((ab) ∪ ((ca) →3 (cb)))
3832, 37bltr 130 . . . . 5 1 ≤ ((ab) ∪ ((ca) →3 (cb)))
3915, 38lebi 137 . . . 4 ((ab) ∪ ((ca) →3 (cb))) = 1
4013, 14, 393tr2 61 . . 3 ((a3 b) ∪ ((b3 a) ∪ ((ca) →3 (cb)))) = 1
418, 40ax-r2 35 . 2 ((a3 b) ∪ ((b3 a) →3 ((b3 a) →3 ((c3 (c3 a)) →3 (c3 (c3 b)))))) = 1
421, 41ax-r2 35 1 ((a3 b) →3 ((a3 b) →3 ((b3 a) →3 ((b3 a) →3 ((c3 (c3 a)) →3 (c3 (c3 b))))))) = 1
Colors of variables: term
Syntax hints:   = wb 1   wn 4   ≡ tb 5   ∪ wo 6   ∩ wa 7  1wt 9   →3 wi3 15
This theorem was proved from axioms:  ax-a1 29  ax-a2 30  ax-a3 31  ax-a4 32  ax-a5 33  ax-r1 34  ax-r2 35  ax-r4 36  ax-r5 37  ax-wom 343  ax-r3 421
This theorem depends on definitions:  df-b 38  df-a 39  df-t 40  df-f 41  df-i1 43  df-i2 44  df-i3 45  df-le 121  df-le1 122  df-le2 123  df-c1 124  df-c2 125  df-cmtr 126
metamath.org