Theorem negantlem6 836

Description: Negated antecedent identity.

Hypothesis

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

Assertion

Ref	Expression
negantlem6	(a ^ c_|_) = (b ^ c_|_)

Proof of Theorem negantlem6

Step	Hyp	Ref	Expression
1		negant.1	. . . 4 (a ->1 c) = (b ->1 c)
2	1	negant 834	. . 3 (a_|_ ->1 c) = (b_|_ ->1 c)
3	2	negantlem5 835	. 2 (a_|__|_ ^ c_|_) = (b_|__|_ ^ c_|_)
4		ax-a1 29	. . 3 a = a_|__|_
5	4	ran 71	. 2 (a ^ c_|_) = (a_|__|_ ^ c_|_)
6		ax-a1 29	. . 3 b = b_|__|_
7	6	ran 71	. 2 (b ^ c_|_) = (b_|__|_ ^ c_|_)
8	3, 5, 7	3tr1 60	1 (a ^ c_|_) = (b ^ c_|_)

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

This theorem is referenced by:  negantlem8 838  negant2 840

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