| 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 2604 | . 2 ⊢ (∃!𝑥𝜑 ↔ ∃𝑧∀𝑥(𝜑 ↔ 𝑥 = 𝑧)) | |
| 2 | dfiota2 6482 | . . 3 ⊢ (℩𝑥𝜑) = ∪ {𝑧 ∣ ∀𝑥(𝜑 ↔ 𝑥 = 𝑧)} | |
| 3 | alnex 1804 | . . . . . 6 ⊢ (∀𝑧 ¬ ∀𝑥(𝜑 ↔ 𝑥 = 𝑧) ↔ ¬ ∃𝑧∀𝑥(𝜑 ↔ 𝑥 = 𝑧)) | |
| 4 | dfnul2 4291 | . . . . . . 7 ⊢ ∅ = {𝑧 ∣ ¬ 𝑧 = 𝑧} | |
| 5 | equid 2035 | . . . . . . . . . . . 12 ⊢ 𝑧 = 𝑧 | |
| 6 | 5 | tbt 372 | . . . . . . . . . . 11 ⊢ (¬ ∀𝑥(𝜑 ↔ 𝑥 = 𝑧) ↔ (¬ ∀𝑥(𝜑 ↔ 𝑥 = 𝑧) ↔ 𝑧 = 𝑧)) |
| 7 | 6 | biimpi 219 | . . . . . . . . . 10 ⊢ (¬ ∀𝑥(𝜑 ↔ 𝑥 = 𝑧) → (¬ ∀𝑥(𝜑 ↔ 𝑥 = 𝑧) ↔ 𝑧 = 𝑧)) |
| 8 | 7 | con1bid 358 | . . . . . . . . 9 ⊢ (¬ ∀𝑥(𝜑 ↔ 𝑥 = 𝑧) → (¬ 𝑧 = 𝑧 ↔ ∀𝑥(𝜑 ↔ 𝑥 = 𝑧))) |
| 9 | 8 | alimi 1834 | . . . . . . . 8 ⊢ (∀𝑧 ¬ ∀𝑥(𝜑 ↔ 𝑥 = 𝑧) → ∀𝑧(¬ 𝑧 = 𝑧 ↔ ∀𝑥(𝜑 ↔ 𝑥 = 𝑧))) |
| 10 | abbi 2830 | . . . . . . . 8 ⊢ (∀𝑧(¬ 𝑧 = 𝑧 ↔ ∀𝑥(𝜑 ↔ 𝑥 = 𝑧)) → {𝑧 ∣ ¬ 𝑧 = 𝑧} = {𝑧 ∣ ∀𝑥(𝜑 ↔ 𝑥 = 𝑧)}) | |
| 11 | 9, 10 | syl 18 | . . . . . . 7 ⊢ (∀𝑧 ¬ ∀𝑥(𝜑 ↔ 𝑥 = 𝑧) → {𝑧 ∣ ¬ 𝑧 = 𝑧} = {𝑧 ∣ ∀𝑥(𝜑 ↔ 𝑥 = 𝑧)}) |
| 12 | 4, 11 | eqtr2id 2813 | . . . . . 6 ⊢ (∀𝑧 ¬ ∀𝑥(𝜑 ↔ 𝑥 = 𝑧) → {𝑧 ∣ ∀𝑥(𝜑 ↔ 𝑥 = 𝑧)} = ∅) |
| 13 | 3, 12 | sylbir 238 | . . . . 5 ⊢ (¬ ∃𝑧∀𝑥(𝜑 ↔ 𝑥 = 𝑧) → {𝑧 ∣ ∀𝑥(𝜑 ↔ 𝑥 = 𝑧)} = ∅) |
| 14 | 13 | unieqd 4881 | . . . 4 ⊢ (¬ ∃𝑧∀𝑥(𝜑 ↔ 𝑥 = 𝑧) → ∪ {𝑧 ∣ ∀𝑥(𝜑 ↔ 𝑥 = 𝑧)} = ∪ ∅) |
| 15 | uni0 4897 | . . . 4 ⊢ ∪ ∅ = ∅ | |
| 16 | 14, 15 | eqtrdi 2816 | . . 3 ⊢ (¬ ∃𝑧∀𝑥(𝜑 ↔ 𝑥 = 𝑧) → ∪ {𝑧 ∣ ∀𝑥(𝜑 ↔ 𝑥 = 𝑧)} = ∅) |
| 17 | 2, 16 | eqtrid 2812 | . 2 ⊢ (¬ ∃𝑧∀𝑥(𝜑 ↔ 𝑥 = 𝑧) → (℩𝑥𝜑) = ∅) |
| 18 | 1, 17 | sylnbi 333 | 1 ⊢ (¬ ∃!𝑥𝜑 → (℩𝑥𝜑) = ∅) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 209 ∀wal 1561 = wceq 1563 ∃wex 1802 ∃!weu 2598 {cab 2743 ∅c0 4288 ∪ cuni 4868 ℩cio 6479 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2737 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-tru 1566 df-fal 1576 df-ex 1803 df-nf 1807 df-sb 2094 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-v 3459 df-dif 3910 df-ss 3924 df-nul 4289 df-sn 4586 df-uni 4869 df-iota 6481 |
| This theorem is referenced by: iotan0 6515 dfiota4 6517 csbiota 6518 tz6.12-2OLD 6859 dffv3 6867 csbriota 7372 riotaund 7396 isf32lem9 10333 grpidval 18709 0g0 18712 iota0ndef 47631 iotan0aiotaex 47685 |
| Copyright terms: Public domain | W3C validator |