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

Theorem u4lemnaa 625
Description: Lemma for non-tollens implication study.
Assertion
Ref Expression
u4lemnaa ((a ->4 b)_|_ ^ a) = (a ^ b_|_)

Proof of Theorem u4lemnaa
StepHypRef Expression
1 anor2 81 . 2 ((a ->4 b)_|_ ^ a) = ((a ->4 b) v a_|_)_|_
2 u4lemona 610 . . . 4 ((a ->4 b) v a_|_) = (a_|_ v b)
32ax-r4 36 . . 3 ((a ->4 b) v a_|_)_|_ = (a_|_ v b)_|_
4 anor1 80 . . . 4 (a ^ b_|_) = (a_|_ v b)_|_
54ax-r1 34 . . 3 (a_|_ v b)_|_ = (a ^ b_|_)
63, 5ax-r2 35 . 2 ((a ->4 b) v a_|_)_|_ = (a ^ b_|_)
71, 6ax-r2 35 1 ((a ->4 b)_|_ ^ a) = (a ^ b_|_)
Colors of variables: term
Syntax hints:   = wb 1  _|_wn 4   v wo 6   ^ wa 7   ->4 wi4 16
This theorem is referenced by:  u4lem1 719
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-i4 46  df-le1 122  df-le2 123  df-c1 124  df-c2 125
metamath.org