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

Theorem u1lemnana 627
Description: Lemma for Sasaki implication study.
Assertion
Ref Expression
u1lemnana ((a ->1 b)_|_ ^ a_|_) = 0

Proof of Theorem u1lemnana
StepHypRef Expression
1 anor3 82 . . 3 ((a ->1 b)_|_ ^ a_|_) = ((a ->1 b) v a)_|_
2 u1lemoa 602 . . . 4 ((a ->1 b) v a) = 1
32ax-r4 36 . . 3 ((a ->1 b) v a)_|_ = 1_|_
41, 3ax-r2 35 . 2 ((a ->1 b)_|_ ^ a_|_) = 1_|_
5 df-f 41 . . 3 0 = 1_|_
65ax-r1 34 . 2 1_|_ = 0
74, 6ax-r2 35 1 ((a ->1 b)_|_ ^ a_|_) = 0
Colors of variables: term
Syntax hints:   = wb 1  _|_wn 4   v wo 6   ^ wa 7  1wt 9  0wf 10   ->1 wi1 13
This theorem was proved from axioms:  ax-a1 29  ax-a2 30  ax-a3 31  ax-a4 32  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-i1 43
metamath.org