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

Theorem dfnfc2 4909
Description: An alternative statement of the effective freeness of a class 𝐴, when it is a set. (Contributed by Mario Carneiro, 14-Oct-2016.) (Proof shortened by JJ, 26-Jul-2021.)
Assertion
Ref Expression
dfnfc2 (∀𝑥 𝐴𝑉 → (𝑥𝐴 ↔ ∀𝑦𝑥 𝑦 = 𝐴))
Distinct variable groups:   𝑥,𝑦   𝑦,𝐴
Allowed substitution hints:   𝐴(𝑥)   𝑉(𝑥,𝑦)

Proof of Theorem dfnfc2
StepHypRef Expression
1 nfcvd 2898 . . . 4 (𝑥𝐴𝑥𝑦)
2 id 22 . . . 4 (𝑥𝐴𝑥𝐴)
31, 2nfeqd 2908 . . 3 (𝑥𝐴 → Ⅎ𝑥 𝑦 = 𝐴)
43alrimiv 1926 . 2 (𝑥𝐴 → ∀𝑦𝑥 𝑦 = 𝐴)
5 df-nfc 2884 . . . . 5 (𝑥{𝐴} ↔ ∀𝑦𝑥 𝑦 ∈ {𝐴})
6 velsn 4622 . . . . . . 7 (𝑦 ∈ {𝐴} ↔ 𝑦 = 𝐴)
76nfbii 1851 . . . . . 6 (Ⅎ𝑥 𝑦 ∈ {𝐴} ↔ Ⅎ𝑥 𝑦 = 𝐴)
87albii 1818 . . . . 5 (∀𝑦𝑥 𝑦 ∈ {𝐴} ↔ ∀𝑦𝑥 𝑦 = 𝐴)
95, 8sylbbr 236 . . . 4 (∀𝑦𝑥 𝑦 = 𝐴𝑥{𝐴})
109nfunid 4893 . . 3 (∀𝑦𝑥 𝑦 = 𝐴𝑥 {𝐴})
11 nfa1 2150 . . . 4 𝑥𝑥 𝐴𝑉
12 unisng 4905 . . . . 5 (𝐴𝑉 {𝐴} = 𝐴)
1312sps 2184 . . . 4 (∀𝑥 𝐴𝑉 {𝐴} = 𝐴)
1411, 13nfceqdf 2893 . . 3 (∀𝑥 𝐴𝑉 → (𝑥 {𝐴} ↔ 𝑥𝐴))
1510, 14imbitrid 244 . 2 (∀𝑥 𝐴𝑉 → (∀𝑦𝑥 𝑦 = 𝐴𝑥𝐴))
164, 15impbid2 226 1 (∀𝑥 𝐴𝑉 → (𝑥𝐴 ↔ ∀𝑦𝑥 𝑦 = 𝐴))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wal 1537   = wceq 1539  wnf 1782  wcel 2107  wnfc 2882  {csn 4606   cuni 4887
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1794  ax-4 1808  ax-5 1909  ax-6 1966  ax-7 2006  ax-8 2109  ax-9 2117  ax-10 2140  ax-11 2156  ax-12 2176  ax-ext 2706
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-tru 1542  df-ex 1779  df-nf 1783  df-sb 2064  df-clab 2713  df-cleq 2726  df-clel 2808  df-nfc 2884  df-ral 3051  df-rex 3060  df-v 3465  df-un 3936  df-ss 3948  df-sn 4607  df-pr 4609  df-uni 4888
This theorem is referenced by:  eusv2nf  5375
  Copyright terms: Public domain W3C validator