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

Theorem u1lemonb 617
Description: Lemma for Sasaki implication study.
Assertion
Ref Expression
u1lemonb ((a ->1 b) v b_|_) = 1

Proof of Theorem u1lemonb
StepHypRef Expression
1 df-i1 43 . . 3 (a ->1 b) = (a_|_ v (a ^ b))
21ax-r5 37 . 2 ((a ->1 b) v b_|_) = ((a_|_ v (a ^ b)) v b_|_)
3 or32 75 . . 3 ((a_|_ v (a ^ b)) v b_|_) = ((a_|_ v b_|_) v (a ^ b))
4 df-a 39 . . . . 5 (a ^ b) = (a_|_ v b_|_)_|_
54lor 66 . . . 4 ((a_|_ v b_|_) v (a ^ b)) = ((a_|_ v b_|_) v (a_|_ v b_|_)_|_)
6 df-t 40 . . . . 5 1 = ((a_|_ v b_|_) v (a_|_ v b_|_)_|_)
76ax-r1 34 . . . 4 ((a_|_ v b_|_) v (a_|_ v b_|_)_|_) = 1
85, 7ax-r2 35 . . 3 ((a_|_ v b_|_) v (a ^ b)) = 1
93, 8ax-r2 35 . 2 ((a_|_ v (a ^ b)) v b_|_) = 1
102, 9ax-r2 35 1 ((a ->1 b) v b_|_) = 1
Colors of variables: term
Syntax hints:   = wb 1  _|_wn 4   v wo 6   ^ wa 7  1wt 9   ->1 wi1 13
This theorem is referenced by:  u1lemnab 632  u3lem14a 773
This theorem was proved from axioms:  ax-a2 30  ax-a3 31  ax-r1 34  ax-r2 35  ax-r5 37
This theorem depends on definitions:  df-a 39  df-t 40  df-i1 43
metamath.org