| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > eusv2i | GIF version | ||
| Description: Two ways to express single-valuedness of a class expression 𝐴(𝑥). (Contributed by NM, 14-Oct-2010.) (Revised by Mario Carneiro, 18-Nov-2016.) |
| Ref | Expression |
|---|---|
| eusv2i | ⊢ (∃!𝑦∀𝑥 𝑦 = 𝐴 → ∃!𝑦∃𝑥 𝑦 = 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nfeu1 1952 | . . 3 ⊢ Ⅎ𝑦∃!𝑦∀𝑥 𝑦 = 𝐴 | |
| 2 | nfcvd 2220 | . . . . . 6 ⊢ (∃!𝑦∀𝑥 𝑦 = 𝐴 → Ⅎ𝑥𝑦) | |
| 3 | eusvnf 4203 | . . . . . 6 ⊢ (∃!𝑦∀𝑥 𝑦 = 𝐴 → Ⅎ𝑥𝐴) | |
| 4 | 2, 3 | nfeqd 2233 | . . . . 5 ⊢ (∃!𝑦∀𝑥 𝑦 = 𝐴 → Ⅎ𝑥 𝑦 = 𝐴) |
| 5 | nf2 1598 | . . . . 5 ⊢ (Ⅎ𝑥 𝑦 = 𝐴 ↔ (∃𝑥 𝑦 = 𝐴 → ∀𝑥 𝑦 = 𝐴)) | |
| 6 | 4, 5 | sylib 120 | . . . 4 ⊢ (∃!𝑦∀𝑥 𝑦 = 𝐴 → (∃𝑥 𝑦 = 𝐴 → ∀𝑥 𝑦 = 𝐴)) |
| 7 | 19.2 1569 | . . . 4 ⊢ (∀𝑥 𝑦 = 𝐴 → ∃𝑥 𝑦 = 𝐴) | |
| 8 | 6, 7 | impbid1 140 | . . 3 ⊢ (∃!𝑦∀𝑥 𝑦 = 𝐴 → (∃𝑥 𝑦 = 𝐴 ↔ ∀𝑥 𝑦 = 𝐴)) |
| 9 | 1, 8 | eubid 1948 | . 2 ⊢ (∃!𝑦∀𝑥 𝑦 = 𝐴 → (∃!𝑦∃𝑥 𝑦 = 𝐴 ↔ ∃!𝑦∀𝑥 𝑦 = 𝐴)) |
| 10 | 9 | ibir 175 | 1 ⊢ (∃!𝑦∀𝑥 𝑦 = 𝐴 → ∃!𝑦∃𝑥 𝑦 = 𝐴) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∀wal 1282 = wceq 1284 Ⅎwnf 1389 ∃wex 1421 ∃!weu 1941 |
| This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 104 ax-ia2 105 ax-ia3 106 ax-io 662 ax-5 1376 ax-7 1377 ax-gen 1378 ax-ie1 1422 ax-ie2 1423 ax-8 1435 ax-10 1436 ax-11 1437 ax-i12 1438 ax-bndl 1439 ax-4 1440 ax-17 1459 ax-i9 1463 ax-ial 1467 ax-i5r 1468 ax-ext 2063 |
| This theorem depends on definitions: df-bi 115 df-tru 1287 df-nf 1390 df-sb 1686 df-eu 1944 df-clab 2068 df-cleq 2074 df-clel 2077 df-nfc 2208 df-v 2603 df-sbc 2816 df-csb 2909 |
| This theorem is referenced by: eusv2nf 4206 |
| Copyright terms: Public domain | W3C validator |