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

Theorem i1orni1 829
Description: Complemented antecedent lemma.
Assertion
Ref Expression
i1orni1 ((a ->1 b) v (a_|_ ->1 b)) = 1

Proof of Theorem i1orni1
StepHypRef Expression
1 df-i1 43 . . . 4 (a_|_ ->1 b) = (a_|__|_ v (a_|_ ^ b))
2 ax-a1 29 . . . . . 6 a = a_|__|_
32ax-r5 37 . . . . 5 (a v (a_|_ ^ b)) = (a_|__|_ v (a_|_ ^ b))
43ax-r1 34 . . . 4 (a_|__|_ v (a_|_ ^ b)) = (a v (a_|_ ^ b))
51, 4ax-r2 35 . . 3 (a_|_ ->1 b) = (a v (a_|_ ^ b))
65lor 66 . 2 ((a ->1 b) v (a_|_ ->1 b)) = ((a ->1 b) v (a v (a_|_ ^ b)))
7 orordi 104 . . 3 ((a ->1 b) v (a v (a_|_ ^ b))) = (((a ->1 b) v a) v ((a ->1 b) v (a_|_ ^ b)))
8 u1lemoa 602 . . . . 5 ((a ->1 b) v a) = 1
98ax-r5 37 . . . 4 (((a ->1 b) v a) v ((a ->1 b) v (a_|_ ^ b))) = (1 v ((a ->1 b) v (a_|_ ^ b)))
10 or1r 97 . . . 4 (1 v ((a ->1 b) v (a_|_ ^ b))) = 1
119, 10ax-r2 35 . . 3 (((a ->1 b) v a) v ((a ->1 b) v (a_|_ ^ b))) = 1
127, 11ax-r2 35 . 2 ((a ->1 b) v (a v (a_|_ ^ b))) = 1
136, 12ax-r2 35 1 ((a ->1 b) v (a_|_ ->1 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:  negantlem2 831
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
This theorem depends on definitions:  df-t 40  df-f 41  df-i1 43
metamath.org