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

Theorem dfnfc2 4923
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 2896 . . . 4 (𝑥𝐴𝑥𝑦)
2 id 22 . . . 4 (𝑥𝐴𝑥𝐴)
31, 2nfeqd 2905 . . 3 (𝑥𝐴 → Ⅎ𝑥 𝑦 = 𝐴)
43alrimiv 1922 . 2 (𝑥𝐴 → ∀𝑦𝑥 𝑦 = 𝐴)
5 df-nfc 2877 . . . . 5 (𝑥{𝐴} ↔ ∀𝑦𝑥 𝑦 ∈ {𝐴})
6 velsn 4636 . . . . . . 7 (𝑦 ∈ {𝐴} ↔ 𝑦 = 𝐴)
76nfbii 1846 . . . . . 6 (Ⅎ𝑥 𝑦 ∈ {𝐴} ↔ Ⅎ𝑥 𝑦 = 𝐴)
87albii 1813 . . . . 5 (∀𝑦𝑥 𝑦 ∈ {𝐴} ↔ ∀𝑦𝑥 𝑦 = 𝐴)
95, 8sylbbr 235 . . . 4 (∀𝑦𝑥 𝑦 = 𝐴𝑥{𝐴})
109nfunid 4905 . . 3 (∀𝑦𝑥 𝑦 = 𝐴𝑥 {𝐴})
11 nfa1 2140 . . . 4 𝑥𝑥 𝐴𝑉
12 unisng 4919 . . . . 5 (𝐴𝑉 {𝐴} = 𝐴)
1312sps 2170 . . . 4 (∀𝑥 𝐴𝑉 {𝐴} = 𝐴)
1411, 13nfceqdf 2890 . . 3 (∀𝑥 𝐴𝑉 → (𝑥 {𝐴} ↔ 𝑥𝐴))
1510, 14imbitrid 243 . 2 (∀𝑥 𝐴𝑉 → (∀𝑦𝑥 𝑦 = 𝐴𝑥𝐴))
164, 15impbid2 225 1 (∀𝑥 𝐴𝑉 → (𝑥𝐴 ↔ ∀𝑦𝑥 𝑦 = 𝐴))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wal 1531   = wceq 1533  wnf 1777  wcel 2098  wnfc 2875  {csn 4620   cuni 4899
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-10 2129  ax-11 2146  ax-12 2163  ax-ext 2695
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 845  df-tru 1536  df-ex 1774  df-nf 1778  df-sb 2060  df-clab 2702  df-cleq 2716  df-clel 2802  df-nfc 2877  df-ral 3054  df-rex 3063  df-v 3468  df-un 3945  df-in 3947  df-ss 3957  df-sn 4621  df-pr 4623  df-uni 4900
This theorem is referenced by:  eusv2nf  5383
  Copyright terms: Public domain W3C validator