Theorem nfccdeq 3000

Description: Variation of nfcdeq 2999 for classes. (Contributed by Mario Carneiro, 11-Aug-2016.)

Hypotheses

Ref	Expression
nfccdeq.1	⊢ Ⅎ𝑥𝐴
nfccdeq.2	⊢ CondEq(𝑥 = 𝑦 → 𝐴 = 𝐵)

Assertion

Ref	Expression
nfccdeq	⊢ 𝐴 = 𝐵

Distinct variable groups:   𝑥,𝐵   𝑦,𝐴

Allowed substitution hints:   𝐴(𝑥)   𝐵(𝑦)

Proof of Theorem nfccdeq

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		nfccdeq.1	. . . 4 ⊢ Ⅎ𝑥𝐴
2	1	nfcri 2343	. . 3 ⊢ Ⅎ𝑥 𝑧 ∈ 𝐴
3		equid 1725	. . . . 5 ⊢ 𝑧 = 𝑧
4	3	cdeqth 2989	. . . 4 ⊢ CondEq(𝑥 = 𝑦 → 𝑧 = 𝑧)
5		nfccdeq.2	. . . 4 ⊢ CondEq(𝑥 = 𝑦 → 𝐴 = 𝐵)
6	4, 5	cdeqel 2998	. . 3 ⊢ CondEq(𝑥 = 𝑦 → (𝑧 ∈ 𝐴 ↔ 𝑧 ∈ 𝐵))
7	2, 6	nfcdeq 2999	. 2 ⊢ (𝑧 ∈ 𝐴 ↔ 𝑧 ∈ 𝐵)
8	7	eqriv 2203	1 ⊢ 𝐴 = 𝐵

Syntax hints:   = wceq 1373   ∈ wcel 2177  Ⅎwnfc 2336  CondEqwcdeq 2985

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-ext 2188

This theorem depends on definitions:  df-bi 117  df-nf 1485  df-sb 1787  df-cleq 2199  df-clel 2202  df-nfc 2338  df-cdeq 2986

This theorem is referenced by: (None)