| 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 2569 | . 2 ⊢ (∃!𝑥𝜑 ↔ ∃𝑧∀𝑥(𝜑 ↔ 𝑥 = 𝑧)) | |
| 2 | dfiota2 6438 | . . 3 ⊢ (℩𝑥𝜑) = ∪ {𝑧 ∣ ∀𝑥(𝜑 ↔ 𝑥 = 𝑧)} | |
| 3 | alnex 1782 | . . . . . 6 ⊢ (∀𝑧 ¬ ∀𝑥(𝜑 ↔ 𝑥 = 𝑧) ↔ ¬ ∃𝑧∀𝑥(𝜑 ↔ 𝑥 = 𝑧)) | |
| 4 | dfnul2 4286 | . . . . . . 7 ⊢ ∅ = {𝑧 ∣ ¬ 𝑧 = 𝑧} | |
| 5 | equid 2013 | . . . . . . . . . . . 12 ⊢ 𝑧 = 𝑧 | |
| 6 | 5 | tbt 369 | . . . . . . . . . . 11 ⊢ (¬ ∀𝑥(𝜑 ↔ 𝑥 = 𝑧) ↔ (¬ ∀𝑥(𝜑 ↔ 𝑥 = 𝑧) ↔ 𝑧 = 𝑧)) |
| 7 | 6 | biimpi 216 | . . . . . . . . . 10 ⊢ (¬ ∀𝑥(𝜑 ↔ 𝑥 = 𝑧) → (¬ ∀𝑥(𝜑 ↔ 𝑥 = 𝑧) ↔ 𝑧 = 𝑧)) |
| 8 | 7 | con1bid 355 | . . . . . . . . 9 ⊢ (¬ ∀𝑥(𝜑 ↔ 𝑥 = 𝑧) → (¬ 𝑧 = 𝑧 ↔ ∀𝑥(𝜑 ↔ 𝑥 = 𝑧))) |
| 9 | 8 | alimi 1812 | . . . . . . . 8 ⊢ (∀𝑧 ¬ ∀𝑥(𝜑 ↔ 𝑥 = 𝑧) → ∀𝑧(¬ 𝑧 = 𝑧 ↔ ∀𝑥(𝜑 ↔ 𝑥 = 𝑧))) |
| 10 | abbi 2796 | . . . . . . . 8 ⊢ (∀𝑧(¬ 𝑧 = 𝑧 ↔ ∀𝑥(𝜑 ↔ 𝑥 = 𝑧)) → {𝑧 ∣ ¬ 𝑧 = 𝑧} = {𝑧 ∣ ∀𝑥(𝜑 ↔ 𝑥 = 𝑧)}) | |
| 11 | 9, 10 | syl 17 | . . . . . . 7 ⊢ (∀𝑧 ¬ ∀𝑥(𝜑 ↔ 𝑥 = 𝑧) → {𝑧 ∣ ¬ 𝑧 = 𝑧} = {𝑧 ∣ ∀𝑥(𝜑 ↔ 𝑥 = 𝑧)}) |
| 12 | 4, 11 | eqtr2id 2779 | . . . . . 6 ⊢ (∀𝑧 ¬ ∀𝑥(𝜑 ↔ 𝑥 = 𝑧) → {𝑧 ∣ ∀𝑥(𝜑 ↔ 𝑥 = 𝑧)} = ∅) |
| 13 | 3, 12 | sylbir 235 | . . . . 5 ⊢ (¬ ∃𝑧∀𝑥(𝜑 ↔ 𝑥 = 𝑧) → {𝑧 ∣ ∀𝑥(𝜑 ↔ 𝑥 = 𝑧)} = ∅) |
| 14 | 13 | unieqd 4872 | . . . 4 ⊢ (¬ ∃𝑧∀𝑥(𝜑 ↔ 𝑥 = 𝑧) → ∪ {𝑧 ∣ ∀𝑥(𝜑 ↔ 𝑥 = 𝑧)} = ∪ ∅) |
| 15 | uni0 4887 | . . . 4 ⊢ ∪ ∅ = ∅ | |
| 16 | 14, 15 | eqtrdi 2782 | . . 3 ⊢ (¬ ∃𝑧∀𝑥(𝜑 ↔ 𝑥 = 𝑧) → ∪ {𝑧 ∣ ∀𝑥(𝜑 ↔ 𝑥 = 𝑧)} = ∅) |
| 17 | 2, 16 | eqtrid 2778 | . 2 ⊢ (¬ ∃𝑧∀𝑥(𝜑 ↔ 𝑥 = 𝑧) → (℩𝑥𝜑) = ∅) |
| 18 | 1, 17 | sylnbi 330 | 1 ⊢ (¬ ∃!𝑥𝜑 → (℩𝑥𝜑) = ∅) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∀wal 1539 = wceq 1541 ∃wex 1780 ∃!weu 2563 {cab 2709 ∅c0 4283 ∪ cuni 4859 ℩cio 6435 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2113 ax-9 2121 ax-10 2144 ax-11 2160 ax-12 2180 ax-ext 2703 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2535 df-eu 2564 df-clab 2710 df-cleq 2723 df-clel 2806 df-ral 3048 df-rex 3057 df-v 3438 df-dif 3905 df-ss 3919 df-nul 4284 df-sn 4577 df-uni 4860 df-iota 6437 |
| This theorem is referenced by: iotan0 6471 dfiota4 6473 csbiota 6474 tz6.12-2OLD 6810 dffv3 6818 csbriota 7318 riotaund 7342 isf32lem9 10249 grpidval 18566 0g0 18569 iota0ndef 47069 iotan0aiotaex 47123 |
| Copyright terms: Public domain | W3C validator |