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

Theorem u3lem4 740
Description: Lemma for unified implication study.
Assertion
Ref Expression
u3lem4 (a ->3 (a ->3 (b ->3 a))) = 1

Proof of Theorem u3lem4
StepHypRef Expression
1 lem4 493 . 2 (a ->3 (a ->3 (b ->3 a))) = (a_|_ v (b ->3 a))
2 ax-a2 30 . . 3 (a_|_ v (b ->3 a)) = ((b ->3 a) v a_|_)
3 u3lemonb 619 . . 3 ((b ->3 a) v a_|_) = 1
42, 3ax-r2 35 . 2 (a_|_ v (b ->3 a)) = 1
51, 4ax-r2 35 1 (a ->3 (a ->3 (b ->3 a))) = 1
Colors of variables: term
Syntax hints:   = wb 1  _|_wn 4   v wo 6  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