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

Theorem 0i1 265
Description: Antecedent of 0 on Sasaki conditional.
Assertion
Ref Expression
0i1 (0 ->1 a) = 1

Proof of Theorem 0i1
StepHypRef Expression
1 df-i1 43 . 2 (0 ->1 a) = (0_|_ v (0 ^ a))
2 ax-a2 30 . . 3 (0_|_ v (0 ^ a)) = ((0 ^ a) v 0_|_)
3 df-f 41 . . . . 5 0 = 1_|_
43con2 64 . . . 4 0_|_ = 1
54lor 66 . . 3 ((0 ^ a) v 0_|_) = ((0 ^ a) v 1)
62, 5ax-r2 35 . 2 (0_|_ v (0 ^ a)) = ((0 ^ a) v 1)
7 or1 96 . 2 ((0 ^ a) v 1) = 1
81, 6, 73tr 62 1 (0 ->1 a) = 1
Colors of variables: term
Syntax hints:   = wb 1  _|_wn 4   v wo 6   ^ wa 7  1wt 9  0wf 10   ->1 wi1 13
This theorem is referenced by:  oa3-2lema 958  oa3-2to2s 970
This theorem was proved from axioms:  ax-a1 29  ax-a2 30  ax-a4 32  ax-r1 34  ax-r2 35  ax-r4 36  ax-r5 37
This theorem depends on definitions:  df-t 40  df-f 41  df-i1 43
metamath.org