![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > eunex | GIF version |
Description: Existential uniqueness implies there is a value for which the wff argument is false. (Contributed by Jim Kingdon, 29-Dec-2018.) |
Ref | Expression |
---|---|
eunex | ⊢ (∃!𝑥𝜑 → ∃𝑥 ¬ 𝜑) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nfv 1528 | . . 3 ⊢ Ⅎ𝑦𝜑 | |
2 | 1 | eu3 2072 | . 2 ⊢ (∃!𝑥𝜑 ↔ (∃𝑥𝜑 ∧ ∃𝑦∀𝑥(𝜑 → 𝑥 = 𝑦))) |
3 | dtruex 4557 | . . . . 5 ⊢ ∃𝑥 ¬ 𝑥 = 𝑦 | |
4 | nfa1 1541 | . . . . . 6 ⊢ Ⅎ𝑥∀𝑥(𝜑 → 𝑥 = 𝑦) | |
5 | sp 1511 | . . . . . . 7 ⊢ (∀𝑥(𝜑 → 𝑥 = 𝑦) → (𝜑 → 𝑥 = 𝑦)) | |
6 | 5 | con3d 631 | . . . . . 6 ⊢ (∀𝑥(𝜑 → 𝑥 = 𝑦) → (¬ 𝑥 = 𝑦 → ¬ 𝜑)) |
7 | 4, 6 | eximd 1612 | . . . . 5 ⊢ (∀𝑥(𝜑 → 𝑥 = 𝑦) → (∃𝑥 ¬ 𝑥 = 𝑦 → ∃𝑥 ¬ 𝜑)) |
8 | 3, 7 | mpi 15 | . . . 4 ⊢ (∀𝑥(𝜑 → 𝑥 = 𝑦) → ∃𝑥 ¬ 𝜑) |
9 | 8 | exlimiv 1598 | . . 3 ⊢ (∃𝑦∀𝑥(𝜑 → 𝑥 = 𝑦) → ∃𝑥 ¬ 𝜑) |
10 | 9 | adantl 277 | . 2 ⊢ ((∃𝑥𝜑 ∧ ∃𝑦∀𝑥(𝜑 → 𝑥 = 𝑦)) → ∃𝑥 ¬ 𝜑) |
11 | 2, 10 | sylbi 121 | 1 ⊢ (∃!𝑥𝜑 → ∃𝑥 ¬ 𝜑) |
Colors of variables: wff set class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ∀wal 1351 = wceq 1353 ∃wex 1492 ∃!weu 2026 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 614 ax-in2 615 ax-io 709 ax-5 1447 ax-7 1448 ax-gen 1449 ax-ie1 1493 ax-ie2 1494 ax-8 1504 ax-10 1505 ax-11 1506 ax-i12 1507 ax-bndl 1509 ax-4 1510 ax-17 1526 ax-i9 1530 ax-ial 1534 ax-i5r 1535 ax-14 2151 ax-ext 2159 ax-sep 4120 ax-pow 4173 ax-setind 4535 |
This theorem depends on definitions: df-bi 117 df-3an 980 df-tru 1356 df-nf 1461 df-sb 1763 df-eu 2029 df-clab 2164 df-cleq 2170 df-clel 2173 df-nfc 2308 df-ne 2348 df-ral 2460 df-v 2739 df-dif 3131 df-in 3135 df-ss 3142 df-pw 3577 df-sn 3598 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |