Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > iotanul | 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 | df-eu 2017 | . . 3 ⊢ (∃!𝑥𝜑 ↔ ∃𝑧∀𝑥(𝜑 ↔ 𝑥 = 𝑧)) | |
2 | dfiota2 5154 | . . . 4 ⊢ (℩𝑥𝜑) = ∪ {𝑧 ∣ ∀𝑥(𝜑 ↔ 𝑥 = 𝑧)} | |
3 | alnex 1487 | . . . . . . 7 ⊢ (∀𝑧 ¬ ∀𝑥(𝜑 ↔ 𝑥 = 𝑧) ↔ ¬ ∃𝑧∀𝑥(𝜑 ↔ 𝑥 = 𝑧)) | |
4 | ax-in2 605 | . . . . . . . . . 10 ⊢ (¬ ∀𝑥(𝜑 ↔ 𝑥 = 𝑧) → (∀𝑥(𝜑 ↔ 𝑥 = 𝑧) → ¬ 𝑧 = 𝑧)) | |
5 | 4 | alimi 1443 | . . . . . . . . 9 ⊢ (∀𝑧 ¬ ∀𝑥(𝜑 ↔ 𝑥 = 𝑧) → ∀𝑧(∀𝑥(𝜑 ↔ 𝑥 = 𝑧) → ¬ 𝑧 = 𝑧)) |
6 | ss2ab 3210 | . . . . . . . . 9 ⊢ ({𝑧 ∣ ∀𝑥(𝜑 ↔ 𝑥 = 𝑧)} ⊆ {𝑧 ∣ ¬ 𝑧 = 𝑧} ↔ ∀𝑧(∀𝑥(𝜑 ↔ 𝑥 = 𝑧) → ¬ 𝑧 = 𝑧)) | |
7 | 5, 6 | sylibr 133 | . . . . . . . 8 ⊢ (∀𝑧 ¬ ∀𝑥(𝜑 ↔ 𝑥 = 𝑧) → {𝑧 ∣ ∀𝑥(𝜑 ↔ 𝑥 = 𝑧)} ⊆ {𝑧 ∣ ¬ 𝑧 = 𝑧}) |
8 | dfnul2 3411 | . . . . . . . 8 ⊢ ∅ = {𝑧 ∣ ¬ 𝑧 = 𝑧} | |
9 | 7, 8 | sseqtrrdi 3191 | . . . . . . 7 ⊢ (∀𝑧 ¬ ∀𝑥(𝜑 ↔ 𝑥 = 𝑧) → {𝑧 ∣ ∀𝑥(𝜑 ↔ 𝑥 = 𝑧)} ⊆ ∅) |
10 | 3, 9 | sylbir 134 | . . . . . 6 ⊢ (¬ ∃𝑧∀𝑥(𝜑 ↔ 𝑥 = 𝑧) → {𝑧 ∣ ∀𝑥(𝜑 ↔ 𝑥 = 𝑧)} ⊆ ∅) |
11 | 10 | unissd 3813 | . . . . 5 ⊢ (¬ ∃𝑧∀𝑥(𝜑 ↔ 𝑥 = 𝑧) → ∪ {𝑧 ∣ ∀𝑥(𝜑 ↔ 𝑥 = 𝑧)} ⊆ ∪ ∅) |
12 | uni0 3816 | . . . . 5 ⊢ ∪ ∅ = ∅ | |
13 | 11, 12 | sseqtrdi 3190 | . . . 4 ⊢ (¬ ∃𝑧∀𝑥(𝜑 ↔ 𝑥 = 𝑧) → ∪ {𝑧 ∣ ∀𝑥(𝜑 ↔ 𝑥 = 𝑧)} ⊆ ∅) |
14 | 2, 13 | eqsstrid 3188 | . . 3 ⊢ (¬ ∃𝑧∀𝑥(𝜑 ↔ 𝑥 = 𝑧) → (℩𝑥𝜑) ⊆ ∅) |
15 | 1, 14 | sylnbi 668 | . 2 ⊢ (¬ ∃!𝑥𝜑 → (℩𝑥𝜑) ⊆ ∅) |
16 | ss0 3449 | . 2 ⊢ ((℩𝑥𝜑) ⊆ ∅ → (℩𝑥𝜑) = ∅) | |
17 | 15, 16 | syl 14 | 1 ⊢ (¬ ∃!𝑥𝜑 → (℩𝑥𝜑) = ∅) |
Colors of variables: wff set class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 104 ∀wal 1341 = wceq 1343 ∃wex 1480 ∃!weu 2014 {cab 2151 ⊆ wss 3116 ∅c0 3409 ∪ cuni 3789 ℩cio 5151 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 604 ax-in2 605 ax-io 699 ax-5 1435 ax-7 1436 ax-gen 1437 ax-ie1 1481 ax-ie2 1482 ax-8 1492 ax-10 1493 ax-11 1494 ax-i12 1495 ax-bndl 1497 ax-4 1498 ax-17 1514 ax-i9 1518 ax-ial 1522 ax-i5r 1523 ax-ext 2147 |
This theorem depends on definitions: df-bi 116 df-tru 1346 df-fal 1349 df-nf 1449 df-sb 1751 df-eu 2017 df-clab 2152 df-cleq 2158 df-clel 2161 df-nfc 2297 df-ral 2449 df-rex 2450 df-v 2728 df-dif 3118 df-in 3122 df-ss 3129 df-nul 3410 df-sn 3582 df-uni 3790 df-iota 5153 |
This theorem is referenced by: tz6.12-2 5477 0fv 5521 riotaund 5832 0g0 12607 |
Copyright terms: Public domain | W3C validator |