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

Theorem negant3 842
Description: Negated antecedent identity.
Hypothesis
Ref Expression
negant.1 (a ->1 c) = (b ->1 c)
Assertion
Ref Expression
negant3 (a_|_ ->3 c) = (b_|_ ->3 c)

Proof of Theorem negant3
StepHypRef Expression
1 negant.1 . . . 4 (a ->1 c) = (b ->1 c)
21sac 817 . . 3 (a_|_ ->1 c) = (b_|_ ->1 c)
32negantlem9 841 . 2 (a_|_ ->3 c) =< (b_|_ ->3 c)
42ax-r1 34 . . 3 (b_|_ ->1 c) = (a_|_ ->1 c)
54negantlem9 841 . 2 (b_|_ ->3 c) =< (a_|_ ->3 c)
63, 5lebi 137 1 (a_|_ ->3 c) = (b_|_ ->3 c)
Colors of variables: term
Syntax hints:   = wb 1  _|_wn 4   ->1 wi1 13   ->3 wi3 15
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