| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > iotanul | Structured version Visualization version GIF version | ||
| Description: Theorem 8.22 in [Quine] p. 57. This theorem is the result if there isn't exactly one 𝑥 that satisfies 𝜑. (Contributed by Andrew Salmon, 11-Jul-2011.) |
| Ref | Expression |
|---|---|
| iotanul | ⊢ (¬ ∃!𝑥𝜑 → (℩𝑥𝜑) = ∅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eu6 2601 | . 2 ⊢ (∃!𝑥𝜑 ↔ ∃𝑧∀𝑥(𝜑 ↔ 𝑥 = 𝑧)) | |
| 2 | dfiota2 6494 | . . 3 ⊢ (℩𝑥𝜑) = ∪ {𝑧 ∣ ∀𝑥(𝜑 ↔ 𝑥 = 𝑧)} | |
| 3 | alnex 1814 | . . . . . 6 ⊢ (∀𝑧 ¬ ∀𝑥(𝜑 ↔ 𝑥 = 𝑧) ↔ ¬ ∃𝑧∀𝑥(𝜑 ↔ 𝑥 = 𝑧)) | |
| 4 | dfnul2 4285 | . . . . . . 7 ⊢ ∅ = {𝑧 ∣ ¬ 𝑧 = 𝑧} | |
| 5 | equid 2045 | . . . . . . . . . . . 12 ⊢ 𝑧 = 𝑧 | |
| 6 | 5 | tbt 372 | . . . . . . . . . . 11 ⊢ (¬ ∀𝑥(𝜑 ↔ 𝑥 = 𝑧) ↔ (¬ ∀𝑥(𝜑 ↔ 𝑥 = 𝑧) ↔ 𝑧 = 𝑧)) |
| 7 | 6 | biimpi 219 | . . . . . . . . . 10 ⊢ (¬ ∀𝑥(𝜑 ↔ 𝑥 = 𝑧) → (¬ ∀𝑥(𝜑 ↔ 𝑥 = 𝑧) ↔ 𝑧 = 𝑧)) |
| 8 | 7 | con1bid 358 | . . . . . . . . 9 ⊢ (¬ ∀𝑥(𝜑 ↔ 𝑥 = 𝑧) → (¬ 𝑧 = 𝑧 ↔ ∀𝑥(𝜑 ↔ 𝑥 = 𝑧))) |
| 9 | 8 | alimi 1844 | . . . . . . . 8 ⊢ (∀𝑧 ¬ ∀𝑥(𝜑 ↔ 𝑥 = 𝑧) → ∀𝑧(¬ 𝑧 = 𝑧 ↔ ∀𝑥(𝜑 ↔ 𝑥 = 𝑧))) |
| 10 | abbi 2827 | . . . . . . . 8 ⊢ (∀𝑧(¬ 𝑧 = 𝑧 ↔ ∀𝑥(𝜑 ↔ 𝑥 = 𝑧)) → {𝑧 ∣ ¬ 𝑧 = 𝑧} = {𝑧 ∣ ∀𝑥(𝜑 ↔ 𝑥 = 𝑧)}) | |
| 11 | 9, 10 | syl 18 | . . . . . . 7 ⊢ (∀𝑧 ¬ ∀𝑥(𝜑 ↔ 𝑥 = 𝑧) → {𝑧 ∣ ¬ 𝑧 = 𝑧} = {𝑧 ∣ ∀𝑥(𝜑 ↔ 𝑥 = 𝑧)}) |
| 12 | 4, 11 | eqtr2id 2810 | . . . . . 6 ⊢ (∀𝑧 ¬ ∀𝑥(𝜑 ↔ 𝑥 = 𝑧) → {𝑧 ∣ ∀𝑥(𝜑 ↔ 𝑥 = 𝑧)} = ∅) |
| 13 | 3, 12 | sylbir 238 | . . . . 5 ⊢ (¬ ∃𝑧∀𝑥(𝜑 ↔ 𝑥 = 𝑧) → {𝑧 ∣ ∀𝑥(𝜑 ↔ 𝑥 = 𝑧)} = ∅) |
| 14 | 13 | unieqd 4883 | . . . 4 ⊢ (¬ ∃𝑧∀𝑥(𝜑 ↔ 𝑥 = 𝑧) → ∪ {𝑧 ∣ ∀𝑥(𝜑 ↔ 𝑥 = 𝑧)} = ∪ ∅) |
| 15 | uni0 4899 | . . . 4 ⊢ ∪ ∅ = ∅ | |
| 16 | 14, 15 | eqtrdi 2813 | . . 3 ⊢ (¬ ∃𝑧∀𝑥(𝜑 ↔ 𝑥 = 𝑧) → ∪ {𝑧 ∣ ∀𝑥(𝜑 ↔ 𝑥 = 𝑧)} = ∅) |
| 17 | 2, 16 | eqtrid 2809 | . 2 ⊢ (¬ ∃𝑧∀𝑥(𝜑 ↔ 𝑥 = 𝑧) → (℩𝑥𝜑) = ∅) |
| 18 | 1, 17 | sylnbi 333 | 1 ⊢ (¬ ∃!𝑥𝜑 → (℩𝑥𝜑) = ∅) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∀wal 1568 = wceq 1570 ∃wex 1812 ∃!weu 2595 {cab 2740 ∅c0 4282 ∪ cuni 4870 ℩cio 6491 |
| 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 2215 ax-ext 2734 |
| 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 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-v 3455 df-dif 3905 df-ss 3919 df-nul 4283 df-sn 4588 df-uni 4871 df-iota 6493 |
| This theorem is used by: iotan0 6527 dfiota4 6529 csbiota 6530 tz6.12-2OLD 6870 dffv3 6878 csbriota 7389 riotaund 7413 isf32lem9 10367 grpidval 18760 0g0 18763 iota0ndef 47935 iotan0aiotaex 47989 |
| Copyright terms: Public domain | W3C validator |