| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > eusv2nf | Structured version Visualization version GIF version | ||
| Description: Two ways to express single-valuedness of a class expression 𝐴(𝑥). (Contributed by Mario Carneiro, 18-Nov-2016.) |
| Ref | Expression |
|---|---|
| eusv2.1 | ⊢ 𝐴 ∈ V |
| Ref | Expression |
|---|---|
| eusv2nf | ⊢ (∃!𝑦∃𝑥 𝑦 = 𝐴 ↔ Ⅎ𝑥𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nfeu1 2619 | . . . 4 ⊢ Ⅎ𝑦∃!𝑦∃𝑥 𝑦 = 𝐴 | |
| 2 | nfe1 2188 | . . . . . . 7 ⊢ Ⅎ𝑥∃𝑥 𝑦 = 𝐴 | |
| 3 | 2 | nfeuw 2623 | . . . . . 6 ⊢ Ⅎ𝑥∃!𝑦∃𝑥 𝑦 = 𝐴 |
| 4 | eusv2.1 | . . . . . . . . 9 ⊢ 𝐴 ∈ V | |
| 5 | 4 | isseti 3475 | . . . . . . . 8 ⊢ ∃𝑦 𝑦 = 𝐴 |
| 6 | 19.8a 2220 | . . . . . . . . 9 ⊢ (𝑦 = 𝐴 → ∃𝑥 𝑦 = 𝐴) | |
| 7 | 6 | ancri 559 | . . . . . . . 8 ⊢ (𝑦 = 𝐴 → (∃𝑥 𝑦 = 𝐴 ∧ 𝑦 = 𝐴)) |
| 8 | 5, 7 | eximii 1870 | . . . . . . 7 ⊢ ∃𝑦(∃𝑥 𝑦 = 𝐴 ∧ 𝑦 = 𝐴) |
| 9 | eupick 2663 | . . . . . . 7 ⊢ ((∃!𝑦∃𝑥 𝑦 = 𝐴 ∧ ∃𝑦(∃𝑥 𝑦 = 𝐴 ∧ 𝑦 = 𝐴)) → (∃𝑥 𝑦 = 𝐴 → 𝑦 = 𝐴)) | |
| 10 | 8, 9 | mpan2 704 | . . . . . 6 ⊢ (∃!𝑦∃𝑥 𝑦 = 𝐴 → (∃𝑥 𝑦 = 𝐴 → 𝑦 = 𝐴)) |
| 11 | 3, 10 | alrimi 2252 | . . . . 5 ⊢ (∃!𝑦∃𝑥 𝑦 = 𝐴 → ∀𝑥(∃𝑥 𝑦 = 𝐴 → 𝑦 = 𝐴)) |
| 12 | nf6 2320 | . . . . 5 ⊢ (Ⅎ𝑥 𝑦 = 𝐴 ↔ ∀𝑥(∃𝑥 𝑦 = 𝐴 → 𝑦 = 𝐴)) | |
| 13 | 11, 12 | sylibr 237 | . . . 4 ⊢ (∃!𝑦∃𝑥 𝑦 = 𝐴 → Ⅎ𝑥 𝑦 = 𝐴) |
| 14 | 1, 13 | alrimi 2252 | . . 3 ⊢ (∃!𝑦∃𝑥 𝑦 = 𝐴 → ∀𝑦Ⅎ𝑥 𝑦 = 𝐴) |
| 15 | dfnfc2 4896 | . . . 4 ⊢ (∀𝑥 𝐴 ∈ V → (Ⅎ𝑥𝐴 ↔ ∀𝑦Ⅎ𝑥 𝑦 = 𝐴)) | |
| 16 | 15, 4 | mpg 1830 | . . 3 ⊢ (Ⅎ𝑥𝐴 ↔ ∀𝑦Ⅎ𝑥 𝑦 = 𝐴) |
| 17 | 14, 16 | sylibr 237 | . 2 ⊢ (∃!𝑦∃𝑥 𝑦 = 𝐴 → Ⅎ𝑥𝐴) |
| 18 | eusvnfb 5366 | . . . 4 ⊢ (∃!𝑦∀𝑥 𝑦 = 𝐴 ↔ (Ⅎ𝑥𝐴 ∧ 𝐴 ∈ V)) | |
| 19 | 4, 18 | mpbiran2 723 | . . 3 ⊢ (∃!𝑦∀𝑥 𝑦 = 𝐴 ↔ Ⅎ𝑥𝐴) |
| 20 | eusv2i 5367 | . . 3 ⊢ (∃!𝑦∀𝑥 𝑦 = 𝐴 → ∃!𝑦∃𝑥 𝑦 = 𝐴) | |
| 21 | 19, 20 | sylbir 238 | . 2 ⊢ (Ⅎ𝑥𝐴 → ∃!𝑦∃𝑥 𝑦 = 𝐴) |
| 22 | 17, 21 | impbii 212 | 1 ⊢ (∃!𝑦∃𝑥 𝑦 = 𝐴 ↔ Ⅎ𝑥𝐴) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∀wal 1568 = wceq 1570 ∃wex 1812 Ⅎwnf 1816 ∈ wcel 2146 ∃!weu 2598 Ⅎwnfc 2912 Vcvv 3457 |
| 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 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ral 3082 df-rex 3092 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-ss 3923 df-nul 4287 df-sn 4592 df-pr 4594 df-uni 4875 |
| This theorem is used by: eusv2 5369 |
| Copyright terms: Public domain | W3C validator |