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

Theorem u3lem8 765
Description: Lemma for unified implication study.
Assertion
Ref Expression
u3lem8 (a_|_ ->3 (a ->3 (a_|_ ->3 b))) = 1

Proof of Theorem u3lem8
StepHypRef Expression
1 comi31 490 . . . 4 a C (a ->3 (a_|_ ->3 b))
21comcom3 436 . . 3 a_|_ C (a ->3 (a_|_ ->3 b))
32u3lemc4 685 . 2 (a_|_ ->3 (a ->3 (a_|_ ->3 b))) = (a_|__|_ v (a ->3 (a_|_ ->3 b)))
4 ax-a1 29 . . . . 5 a = a_|__|_
54ax-r1 34 . . . 4 a_|__|_ = a
6 u3lem7 756 . . . 4 (a ->3 (a_|_ ->3 b)) = (a_|_ v ((a ^ b) v (a ^ b_|_)))
75, 62or 67 . . 3 (a_|__|_ v (a ->3 (a_|_ ->3 b))) = (a v (a_|_ v ((a ^ b) v (a ^ b_|_))))
8 ax-a3 31 . . . . 5 ((a v a_|_) v ((a ^ b) v (a ^ b_|_))) = (a v (a_|_ v ((a ^ b) v (a ^ b_|_))))
98ax-r1 34 . . . 4 (a v (a_|_ v ((a ^ b) v (a ^ b_|_)))) = ((a v a_|_) v ((a ^ b) v (a ^ b_|_)))
10 ax-a2 30 . . . . 5 ((a v a_|_) v ((a ^ b) v (a ^ b_|_))) = (((a ^ b) v (a ^ b_|_)) v (a v a_|_))
11 df-t 40 . . . . . . . 8 1 = (a v a_|_)
1211ax-r1 34 . . . . . . 7 (a v a_|_) = 1
1312lor 66 . . . . . 6 (((a ^ b) v (a ^ b_|_)) v (a v a_|_)) = (((a ^ b) v (a ^ b_|_)) v 1)
14 or1 96 . . . . . 6 (((a ^ b) v (a ^ b_|_)) v 1) = 1
1513, 14ax-r2 35 . . . . 5 (((a ^ b) v (a ^ b_|_)) v (a v a_|_)) = 1
1610, 15ax-r2 35 . . . 4 ((a v a_|_) v ((a ^ b) v (a ^ b_|_))) = 1
179, 16ax-r2 35 . . 3 (a v (a_|_ v ((a ^ b) v (a ^ b_|_)))) = 1
187, 17ax-r2 35 . 2 (a_|__|_ v (a ->3 (a_|_ ->3 b))) = 1
193, 18ax-r2 35 1 (a_|_ ->3 (a ->3 (a_|_ ->3 b))) = 1
Colors of variables: term
Syntax hints:   = wb 1  _|_wn 4   v 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-r3 421
This theorem depends on definitions:  df-b 38  df-a 39  df-t 40  df-f 41  df-i3 45  df-le1 122  df-le2 123  df-c1 124  df-c2 125
metamath.org