Theorem negantlem7 837

Description: Negated antecedent identity.

Hypothesis

Ref	Expression
negant.1	(a ->1 c) = (b ->1 c)

Assertion

Ref	Expression
negantlem7	(a v c) = (b v c)

Proof of Theorem negantlem7

Step	Hyp	Ref	Expression
1		negant.1	. . . 4 (a ->1 c) = (b ->1 c)
2	1	negantlem5 835	. . 3 (a_|_ ^ c_|_) = (b_|_ ^ c_|_)
3		anor3 82	. . 3 (a_|_ ^ c_|_) = (a v c)_|_
4		anor3 82	. . 3 (b_|_ ^ c_|_) = (b v c)_|_
5	2, 3, 4	3tr2 61	. 2 (a v c)_|_ = (b v c)_|_
6	5	con1 63	1 (a v c) = (b v c)

Syntax hints:   = wb 1  _|_wn 4   v wo 6   ^ wa 7   ->1 wi1 13

This theorem is referenced by:  negant0 839

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-le1 122  df-le2 123  df-c1 124  df-c2 125

metamath.org