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

Theorem nfccdeq 3740
Description: Variation of nfcdeq 3739 for classes. Usage of this theorem is discouraged because it depends on ax-13 2403. (Contributed by Mario Carneiro, 11-Aug-2016.) Avoid ax-11 2191. (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 2916 . . 3 𝑥 𝑧𝐴
3 eqid 2762 . . . . 5 𝑧 = 𝑧
43cdeqth 3729 . . . 4 CondEq(𝑥 = 𝑦𝑧 = 𝑧)
5 nfccdeq.2 . . . 4 CondEq(𝑥 = 𝑦𝐴 = 𝐵)
64, 5cdeqel 3738 . . 3 CondEq(𝑥 = 𝑦 → (𝑧𝐴𝑧𝐵))
72, 6nfcdeq 3739 . 2 (𝑧𝐴𝑧𝐵)
87eqriv 2759 1 𝐴 = 𝐵
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   = wceq 1569  wcel 2142  wnfc 2909  CondEqwcdeq 3725
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-10 2175  ax-12 2212  ax-13 2403  ax-ext 2734
This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-ex 1809  df-nf 1813  df-sb 2096  df-cleq 2754  df-clel 2837  df-nfc 2911  df-cdeq 3726
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator