MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  nfccdeq Structured version   Visualization version   GIF version

Theorem nfccdeq 3739
Description: Variation of nfcdeq 3738 for classes. Usage of this theorem is discouraged because it depends on ax-13 2404. (Contributed by Mario Carneiro, 11-Aug-2016.) Avoid ax-11 2197. (Revised by GG, 19-May-2023.) (New usage is discouraged.)
Hypotheses
Ref Expression
nfccdeq.1 Ⅎ𝑥𝐴
nfccdeq.2 CondEq(𝑥 = 𝑦 → 𝐴 = 𝐵)
Assertion
Ref Expression
nfccdeq 𝐴 = 𝐵
Distinct variable group:   𝑥,𝐵
Allowed substitution hints:   𝐴(𝑥, 𝑦)   𝐵(𝑦)

Proof of Theorem nfccdeq
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 nfccdeq.1 . . . 4 Ⅎ𝑥𝐴
21nfcri 2918 . . 3 Ⅎ𝑥 𝑧 ∈ 𝐴
3 eqid 2763 . . . . 5 𝑧 = 𝑧
43cdeqth 3728 . . . 4 CondEq(𝑥 = 𝑦 → 𝑧 = 𝑧)
5 nfccdeq.2 . . . 4 CondEq(𝑥 = 𝑦 → 𝐴 = 𝐵)
64, 5cdeqel 3737 . . 3 CondEq(𝑥 = 𝑦 → (𝑧 ∈ 𝐴 ↔ 𝑧 ∈ 𝐵))
72, 6nfcdeq 3738 . 2 (𝑧 ∈ 𝐴 ↔ 𝑧 ∈ 𝐵)
87eqriv 2760 1 𝐴 = 𝐵
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   = wceq 1570   ∈ wcel 2147  Ⅎwnfc 2911  CondEqwcdeq 3724
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-12 2216  ax-13 2404  ax-ext 2735
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-ex 1813  df-nf 1817  df-sb 2102  df-cleq 2755  df-clel 2839  df-nfc 2913  df-cdeq 3725
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator