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

Theorem neg3antlem1 846
Description: Lemma for negated antecedent identity.
Hypothesis
Ref Expression
neg3ant.1 (a ->3 c) = (b ->3 c)
Assertion
Ref Expression
neg3antlem1 (a ^ c) =< (b ->1 c)

Proof of Theorem neg3antlem1
StepHypRef Expression
1 leo 150 . . 3 (a ^ c) =< ((a ^ c) v (a_|_ ^ c))
2 neg3ant.1 . . . . . 6 (a ->3 c) = (b ->3 c)
32ran 71 . . . . 5 ((a ->3 c) ^ c) = ((b ->3 c) ^ c)
4 u3lemab 594 . . . . 5 ((a ->3 c) ^ c) = ((a ^ c) v (a_|_ ^ c))
5 u3lemab 594 . . . . 5 ((b ->3 c) ^ c) = ((b ^ c) v (b_|_ ^ c))
63, 4, 53tr2 61 . . . 4 ((a ^ c) v (a_|_ ^ c)) = ((b ^ c) v (b_|_ ^ c))
7 u1lemab 592 . . . . 5 ((b ->1 c) ^ c) = ((b ^ c) v (b_|_ ^ c))
87ax-r1 34 . . . 4 ((b ^ c) v (b_|_ ^ c)) = ((b ->1 c) ^ c)
96, 8ax-r2 35 . . 3 ((a ^ c) v (a_|_ ^ c)) = ((b ->1 c) ^ c)
101, 9lbtr 131 . 2 (a ^ c) =< ((b ->1 c) ^ c)
11 lea 152 . 2 ((b ->1 c) ^ c) =< (b ->1 c)
1210, 11letr 129 1 (a ^ c) =< (b ->1 c)
Colors of variables: term
Syntax hints:   = wb 1   =< wle 2  _|_wn 4   v wo 6   ^ wa 7   ->1 wi1 13   ->3 wi3 15
This theorem is referenced by:  neg3ant1 848
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-i1 43  df-i3 45  df-le1 122  df-le2 123  df-c1 124  df-c2 125
metamath.org