Theorem dfnfc2 4889

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

Step	Hyp	Ref	Expression
1		nfcvd 2923	. . . 4 ⊢ (Ⅎ𝑥𝐴 → Ⅎ𝑥𝑦)
2		id 23	. . . 4 ⊢ (Ⅎ𝑥𝐴 → Ⅎ𝑥𝐴)
3	1, 2	nfeqd 2932	. . 3 ⊢ (Ⅎ𝑥𝐴 → Ⅎ𝑥 𝑦 = 𝐴)
4	3	alrimiv 1960	. 2 ⊢ (Ⅎ𝑥𝐴 → ∀𝑦Ⅎ𝑥 𝑦 = 𝐴)
5		df-nfc 2909	. . . . 5 ⊢ (Ⅎ𝑥{𝐴} ↔ ∀𝑦Ⅎ𝑥 𝑦 ∈ {𝐴})
6		velsn 4600	. . . . . . 7 ⊢ (𝑦 ∈ {𝐴} ↔ 𝑦 = 𝐴)
7	6	nfbii 1885	. . . . . 6 ⊢ (Ⅎ𝑥 𝑦 ∈ {𝐴} ↔ Ⅎ𝑥 𝑦 = 𝐴)
8	7	albii 1852	. . . . 5 ⊢ (∀𝑦Ⅎ𝑥 𝑦 ∈ {𝐴} ↔ ∀𝑦Ⅎ𝑥 𝑦 = 𝐴)
9	5, 8	sylbbr 239	. . . 4 ⊢ (∀𝑦Ⅎ𝑥 𝑦 = 𝐴 → Ⅎ𝑥{𝐴})
10	9	nfunid 4873	. . 3 ⊢ (∀𝑦Ⅎ𝑥 𝑦 = 𝐴 → Ⅎ𝑥∪ {𝐴})
11		nfa1 2188	. . . 4 ⊢ Ⅎ𝑥∀𝑥 𝐴 ∈ 𝑉
12		unisng 4885	. . . . 5 ⊢ (𝐴 ∈ 𝑉 → ∪ {𝐴} = 𝐴)
13	12	sps 2221	. . . 4 ⊢ (∀𝑥 𝐴 ∈ 𝑉 → ∪ {𝐴} = 𝐴)
14	11, 13	nfceqdf 2918	. . 3 ⊢ (∀𝑥 𝐴 ∈ 𝑉 → (Ⅎ𝑥∪ {𝐴} ↔ Ⅎ𝑥𝐴))
15	10, 14	imbitrid 247	. 2 ⊢ (∀𝑥 𝐴 ∈ 𝑉 → (∀𝑦Ⅎ𝑥 𝑦 = 𝐴 → Ⅎ𝑥𝐴))
16	4, 15	impbid2 229	1 ⊢ (∀𝑥 𝐴 ∈ 𝑉 → (Ⅎ𝑥𝐴 ↔ ∀𝑦Ⅎ𝑥 𝑦 = 𝐴))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209  ∀wal 1568   = wceq 1570  Ⅎwnf 1816   ∈ wcel 2145  Ⅎwnfc 2907  {csn 4584  ∪ cuni 4867

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-ex 1813  df-nf 1817  df-sb 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ral 3077  df-rex 3087  df-v 3452  df-un 3904  df-ss 3916  df-sn 4585  df-pr 4587  df-uni 4868

This theorem is used by:  eusv2nf  5360