Theorem drnfc1 2323

Description: Formula-building lemma for use with the Distinctor Reduction Theorem. (Contributed by Mario Carneiro, 8-Oct-2016.)

Hypothesis

Ref	Expression
drnfc1.1	|- ( A. x x = y -> A = B )

Assertion

Ref	Expression
drnfc1	|- ( A. x x = y -> ( F/_ x A <-> F/_ y B ) )

Proof of Theorem drnfc1

Dummy variable w is distinct from all other variables.

Step	Hyp	Ref	Expression
1		drnfc1.1	. . . . 5 |- ( A. x x = y -> A = B )
2	1	eleq2d 2234	. . . 4 |- ( A. x x = y -> ( w e. A <-> w e. B ) )
3	2	drnf1 1720	. . 3 |- ( A. x x = y -> ( F/ x w e. A <-> F/ y w e. B ) )
4	3	dral2 1718	. 2 |- ( A. x x = y -> ( A. w F/ x w e. A <-> A. w F/ y w e. B ) )
5		df-nfc 2295	. 2 |- ( F/_ x A <-> A. w F/ x w e. A )
6		df-nfc 2295	. 2 |- ( F/_ y B <-> A. w F/ y w e. B )
7	4, 5, 6	3bitr4g 222	1 |- ( A. x x = y -> ( F/_ x A <-> F/_ y B ) )

Syntax hints:   -> wi 4   <-> wb 104   A.wal 1340   = wceq 1342   F/wnf 1447   e. wcel 2135   F/_wnfc 2293

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 699  ax-5 1434  ax-7 1435  ax-gen 1436  ax-ie1 1480  ax-ie2 1481  ax-8 1491  ax-10 1492  ax-11 1493  ax-i12 1494  ax-4 1497  ax-17 1513  ax-i9 1517  ax-ial 1521  ax-ext 2146

This theorem depends on definitions:  df-bi 116  df-nf 1448  df-cleq 2157  df-clel 2160  df-nfc 2295

This theorem is referenced by: (None)