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

Theorem u2lem5 744
Description: Lemma for unified implication study.
Assertion
Ref Expression
u2lem5 (a ->2 (a ->2 b)) = (a ->2 b)

Proof of Theorem u2lem5
StepHypRef Expression
1 df-i2 44 . 2 (a ->2 (a ->2 b)) = ((a ->2 b) v (a_|_ ^ (a ->2 b)_|_))
2 ancom 68 . . . . 5 (a_|_ ^ (a ->2 b)_|_) = ((a ->2 b)_|_ ^ a_|_)
3 u2lemnana 628 . . . . 5 ((a ->2 b)_|_ ^ a_|_) = 0
42, 3ax-r2 35 . . . 4 (a_|_ ^ (a ->2 b)_|_) = 0
54lor 66 . . 3 ((a ->2 b) v (a_|_ ^ (a ->2 b)_|_)) = ((a ->2 b) v 0)
6 or0 94 . . 3 ((a ->2 b) v 0) = (a ->2 b)
75, 6ax-r2 35 . 2 ((a ->2 b) v (a_|_ ^ (a ->2 b)_|_)) = (a ->2 b)
81, 7ax-r2 35 1 (a ->2 (a ->2 b)) = (a ->2 b)
Colors of variables: term
Syntax hints:   = wb 1  _|_wn 4   v wo 6   ^ wa 7  0wf 10   ->2 wi2 14
This theorem was proved from axioms:  ax-a1 29  ax-a2 30  ax-a3 31  ax-a5 33  ax-r1 34  ax-r2 35  ax-r4 36  ax-r5 37
This theorem depends on definitions:  df-a 39  df-t 40  df-f 41  df-i2 44
metamath.org