![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > dfnfc2 | Structured version Visualization version GIF version |
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.) |
Ref | Expression |
---|---|
dfnfc2 | ⊢ (∀𝑥 𝐴 ∈ 𝑉 → (Ⅎ𝑥𝐴 ↔ ∀𝑦Ⅎ𝑥 𝑦 = 𝐴)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nfcvd 2794 | . . . 4 ⊢ (Ⅎ𝑥𝐴 → Ⅎ𝑥𝑦) | |
2 | id 22 | . . . 4 ⊢ (Ⅎ𝑥𝐴 → Ⅎ𝑥𝐴) | |
3 | 1, 2 | nfeqd 2801 | . . 3 ⊢ (Ⅎ𝑥𝐴 → Ⅎ𝑥 𝑦 = 𝐴) |
4 | 3 | alrimiv 1895 | . 2 ⊢ (Ⅎ𝑥𝐴 → ∀𝑦Ⅎ𝑥 𝑦 = 𝐴) |
5 | df-nfc 2782 | . . . . 5 ⊢ (Ⅎ𝑥{𝐴} ↔ ∀𝑦Ⅎ𝑥 𝑦 ∈ {𝐴}) | |
6 | velsn 4226 | . . . . . . 7 ⊢ (𝑦 ∈ {𝐴} ↔ 𝑦 = 𝐴) | |
7 | 6 | nfbii 1818 | . . . . . 6 ⊢ (Ⅎ𝑥 𝑦 ∈ {𝐴} ↔ Ⅎ𝑥 𝑦 = 𝐴) |
8 | 7 | albii 1787 | . . . . 5 ⊢ (∀𝑦Ⅎ𝑥 𝑦 ∈ {𝐴} ↔ ∀𝑦Ⅎ𝑥 𝑦 = 𝐴) |
9 | 5, 8 | sylbbr 226 | . . . 4 ⊢ (∀𝑦Ⅎ𝑥 𝑦 = 𝐴 → Ⅎ𝑥{𝐴}) |
10 | 9 | nfunid 4475 | . . 3 ⊢ (∀𝑦Ⅎ𝑥 𝑦 = 𝐴 → Ⅎ𝑥∪ {𝐴}) |
11 | nfa1 2068 | . . . 4 ⊢ Ⅎ𝑥∀𝑥 𝐴 ∈ 𝑉 | |
12 | unisng 4484 | . . . . 5 ⊢ (𝐴 ∈ 𝑉 → ∪ {𝐴} = 𝐴) | |
13 | 12 | sps 2093 | . . . 4 ⊢ (∀𝑥 𝐴 ∈ 𝑉 → ∪ {𝐴} = 𝐴) |
14 | 11, 13 | nfceqdf 2789 | . . 3 ⊢ (∀𝑥 𝐴 ∈ 𝑉 → (Ⅎ𝑥∪ {𝐴} ↔ Ⅎ𝑥𝐴)) |
15 | 10, 14 | syl5ib 234 | . 2 ⊢ (∀𝑥 𝐴 ∈ 𝑉 → (∀𝑦Ⅎ𝑥 𝑦 = 𝐴 → Ⅎ𝑥𝐴)) |
16 | 4, 15 | impbid2 216 | 1 ⊢ (∀𝑥 𝐴 ∈ 𝑉 → (Ⅎ𝑥𝐴 ↔ ∀𝑦Ⅎ𝑥 𝑦 = 𝐴)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 196 ∀wal 1521 = wceq 1523 Ⅎwnf 1748 ∈ wcel 2030 Ⅎwnfc 2780 {csn 4210 ∪ cuni 4468 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1762 ax-4 1777 ax-5 1879 ax-6 1945 ax-7 1981 ax-9 2039 ax-10 2059 ax-11 2074 ax-12 2087 ax-13 2282 ax-ext 2631 |
This theorem depends on definitions: df-bi 197 df-or 384 df-an 385 df-tru 1526 df-ex 1745 df-nf 1750 df-sb 1938 df-clab 2638 df-cleq 2644 df-clel 2647 df-nfc 2782 df-ral 2946 df-rex 2947 df-v 3233 df-un 3612 df-sn 4211 df-pr 4213 df-uni 4469 |
This theorem is referenced by: eusv2nf 4894 |
Copyright terms: Public domain | W3C validator |