| 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 2602 | . 2 ⊢ (∃!𝑥𝜑 ↔ ∃𝑧∀𝑥(𝜑 ↔ 𝑥 = 𝑧)) | |
| 2 | dfiota2 6516 | . . 3 ⊢ (℩𝑥𝜑) = ∪ {𝑧 ∣ ∀𝑥(𝜑 ↔ 𝑥 = 𝑧)} | |
| 3 | alnex 1814 | . . . . . 6 ⊢ (∀𝑧 ¬ ∀𝑥(𝜑 ↔ 𝑥 = 𝑧) ↔ ¬ ∃𝑧∀𝑥(𝜑 ↔ 𝑥 = 𝑧)) | |
| 4 | dfnul2 4284 | . . . . . . 7 ⊢ ∅ = {𝑧 ∣ ¬ 𝑧 = 𝑧} | |
| 5 | equid 2047 | . . . . . . . . . . . 12 ⊢ 𝑧 = 𝑧 | |
| 6 | 5 | tbt 372 | . . . . . . . . . . 11 ⊢ (¬ ∀𝑥(𝜑 ↔ 𝑥 = 𝑧) ↔ (¬ ∀𝑥(𝜑 ↔ 𝑥 = 𝑧) ↔ 𝑧 = 𝑧)) |
| 7 | 6 | biimpi 219 | . . . . . . . . . 10 ⊢ (¬ ∀𝑥(𝜑 ↔ 𝑥 = 𝑧) → (¬ ∀𝑥(𝜑 ↔ 𝑥 = 𝑧) ↔ 𝑧 = 𝑧)) |
| 8 | 7 | con1bid 358 | . . . . . . . . 9 ⊢ (¬ ∀𝑥(𝜑 ↔ 𝑥 = 𝑧) → (¬ 𝑧 = 𝑧 ↔ ∀𝑥(𝜑 ↔ 𝑥 = 𝑧))) |
| 9 | 8 | alimi 1844 | . . . . . . . 8 ⊢ (∀𝑧 ¬ ∀𝑥(𝜑 ↔ 𝑥 = 𝑧) → ∀𝑧(¬ 𝑧 = 𝑧 ↔ ∀𝑥(𝜑 ↔ 𝑥 = 𝑧))) |
| 10 | abbi 2828 | . . . . . . . 8 ⊢ (∀𝑧(¬ 𝑧 = 𝑧 ↔ ∀𝑥(𝜑 ↔ 𝑥 = 𝑧)) → {𝑧 ∣ ¬ 𝑧 = 𝑧} = {𝑧 ∣ ∀𝑥(𝜑 ↔ 𝑥 = 𝑧)}) | |
| 11 | 9, 10 | syl 18 | . . . . . . 7 ⊢ (∀𝑧 ¬ ∀𝑥(𝜑 ↔ 𝑥 = 𝑧) → {𝑧 ∣ ¬ 𝑧 = 𝑧} = {𝑧 ∣ ∀𝑥(𝜑 ↔ 𝑥 = 𝑧)}) |
| 12 | 4, 11 | eqtr2id 2811 | . . . . . 6 ⊢ (∀𝑧 ¬ ∀𝑥(𝜑 ↔ 𝑥 = 𝑧) → {𝑧 ∣ ∀𝑥(𝜑 ↔ 𝑥 = 𝑧)} = ∅) |
| 13 | 3, 12 | sylbir 238 | . . . . 5 ⊢ (¬ ∃𝑧∀𝑥(𝜑 ↔ 𝑥 = 𝑧) → {𝑧 ∣ ∀𝑥(𝜑 ↔ 𝑥 = 𝑧)} = ∅) |
| 14 | 13 | unieqd 4883 | . . . 4 ⊢ (¬ ∃𝑧∀𝑥(𝜑 ↔ 𝑥 = 𝑧) → ∪ {𝑧 ∣ ∀𝑥(𝜑 ↔ 𝑥 = 𝑧)} = ∪ ∅) |
| 15 | uni0 4899 | . . . 4 ⊢ ∪ ∅ = ∅ | |
| 16 | 14, 15 | eqtrdi 2814 | . . 3 ⊢ (¬ ∃𝑧∀𝑥(𝜑 ↔ 𝑥 = 𝑧) → ∪ {𝑧 ∣ ∀𝑥(𝜑 ↔ 𝑥 = 𝑧)} = ∅) |
| 17 | 2, 16 | eqtrid 2810 | . 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 2596 {cab 2741 ∅c0 4281 ∪ cuni 4870 ℩cio 6513 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-v 3456 df-ss 3901 df-dif 4050 df-nul 4282 df-sn 4589 df-uni 4871 df-iota 6515 |
| This theorem is used by: iotan0 6550 iotan0OLD 6551 dfiota4 6553 csbiota 6554 tz6.12-2OLD 6899 dffv3 6907 csbriota 7418 riotaund 7442 isf32lem9 10469 grpidval 18872 0g0 18876 iota0ndef 48324 iotan0aiotaex 48378 |
| Copyright terms: Public domain | W3C validator |