| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > avril1 | Structured version Visualization version GIF version | ||
| Description: Poisson d'Avril's
Theorem. This theorem is noted for its
Selbstdokumentieren property, which means, literally,
"self-documenting" and recalls the principle of quidquid
german dictum
sit, altum viditur, often used in set theory. Starting with the
seemingly simple yet profound fact that any object 𝑥 equals
itself
(proved by Tarski in 1965; see Lemma 6 of [Tarski] p. 68), we
demonstrate that the power set of the real numbers, as a relation on the
value of the imaginary unit, does not conjoin with an empty relation on
the product of the additive and multiplicative identity elements,
leading to this startling conclusion that has left even seasoned
professional mathematicians scratching their heads. (Contributed by
Prof. Loof Lirpa, 1-Apr-2005.) (Proof modification is discouraged.)
(New usage is discouraged.)
A reply to skeptics can be found at mmnotes.txt, under the 1-Apr-2006 entry. |
| Ref | Expression |
|---|---|
| avril1 | ⊢ ¬ (𝐴𝒫 ℝ(i‘1) ∧ 𝐹∅(0 · 1)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | equid 2045 | . . . . . . . 8 ⊢ 𝑥 = 𝑥 | |
| 2 | dfnul2 4282 | . . . . . . . . . 10 ⊢ ∅ = {𝑥 ∣ ¬ 𝑥 = 𝑥} | |
| 3 | 2 | eqabri 2902 | . . . . . . . . 9 ⊢ (𝑥 ∈ ∅ ↔ ¬ 𝑥 = 𝑥) |
| 4 | 3 | con2bii 360 | . . . . . . . 8 ⊢ (𝑥 = 𝑥 ↔ ¬ 𝑥 ∈ ∅) |
| 5 | 1, 4 | mpbi 233 | . . . . . . 7 ⊢ ¬ 𝑥 ∈ ∅ |
| 6 | eleq1 2848 | . . . . . . 7 ⊢ (𝑥 = 〈𝐹, 0〉 → (𝑥 ∈ ∅ ↔ 〈𝐹, 0〉 ∈ ∅)) | |
| 7 | 5, 6 | mtbii 329 | . . . . . 6 ⊢ (𝑥 = 〈𝐹, 0〉 → ¬ 〈𝐹, 0〉 ∈ ∅) |
| 8 | 7 | vtocleg 3516 | . . . . 5 ⊢ (〈𝐹, 0〉 ∈ V → ¬ 〈𝐹, 0〉 ∈ ∅) |
| 9 | elex 3471 | . . . . . 6 ⊢ (〈𝐹, 0〉 ∈ ∅ → 〈𝐹, 0〉 ∈ V) | |
| 10 | 9 | con3i 155 | . . . . 5 ⊢ (¬ 〈𝐹, 0〉 ∈ V → ¬ 〈𝐹, 0〉 ∈ ∅) |
| 11 | 8, 10 | pm2.61i 184 | . . . 4 ⊢ ¬ 〈𝐹, 0〉 ∈ ∅ |
| 12 | df-br 5104 | . . . . 5 ⊢ (𝐹∅(0 · 1) ↔ 〈𝐹, (0 · 1)〉 ∈ ∅) | |
| 13 | 0cn 11222 | . . . . . . . 8 ⊢ 0 ∈ ℂ | |
| 14 | 13 | mulridi 11237 | . . . . . . 7 ⊢ (0 · 1) = 0 |
| 15 | 14 | opeq2i 4837 | . . . . . 6 ⊢ 〈𝐹, (0 · 1)〉 = 〈𝐹, 0〉 |
| 16 | 15 | eleq1i 2851 | . . . . 5 ⊢ (〈𝐹, (0 · 1)〉 ∈ ∅ ↔ 〈𝐹, 0〉 ∈ ∅) |
| 17 | 12, 16 | bitri 278 | . . . 4 ⊢ (𝐹∅(0 · 1) ↔ 〈𝐹, 0〉 ∈ ∅) |
| 18 | 11, 17 | mtbir 326 | . . 3 ⊢ ¬ 𝐹∅(0 · 1) |
| 19 | 18 | intnan 492 | . 2 ⊢ ¬ (𝐴𝒫 (R × {0R})(℩𝑦1〈0R, 1R〉𝑦) ∧ 𝐹∅(0 · 1)) |
| 20 | df-i 11133 | . . . . . . . 8 ⊢ i = 〈0R, 1R〉 | |
| 21 | 20 | fveq1i 6879 | . . . . . . 7 ⊢ (i‘1) = (〈0R, 1R〉‘1) |
| 22 | df-fv 6541 | . . . . . . 7 ⊢ (〈0R, 1R〉‘1) = (℩𝑦1〈0R, 1R〉𝑦) | |
| 23 | 21, 22 | eqtri 2783 | . . . . . 6 ⊢ (i‘1) = (℩𝑦1〈0R, 1R〉𝑦) |
| 24 | 23 | breq2i 5111 | . . . . 5 ⊢ (𝐴𝒫 ℝ(i‘1) ↔ 𝐴𝒫 ℝ(℩𝑦1〈0R, 1R〉𝑦)) |
| 25 | df-r 11134 | . . . . . . 7 ⊢ ℝ = (R × {0R}) | |
| 26 | sseq2 3957 | . . . . . . . . 9 ⊢ (ℝ = (R × {0R}) → (𝑧 ⊆ ℝ ↔ 𝑧 ⊆ (R × {0R}))) | |
| 27 | 26 | abbidv 2826 | . . . . . . . 8 ⊢ (ℝ = (R × {0R}) → {𝑧 ∣ 𝑧 ⊆ ℝ} = {𝑧 ∣ 𝑧 ⊆ (R × {0R})}) |
| 28 | df-pw 4559 | . . . . . . . 8 ⊢ 𝒫 ℝ = {𝑧 ∣ 𝑧 ⊆ ℝ} | |
| 29 | df-pw 4559 | . . . . . . . 8 ⊢ 𝒫 (R × {0R}) = {𝑧 ∣ 𝑧 ⊆ (R × {0R})} | |
| 30 | 27, 28, 29 | 3eqtr4g 2820 | . . . . . . 7 ⊢ (ℝ = (R × {0R}) → 𝒫 ℝ = 𝒫 (R × {0R})) |
| 31 | 25, 30 | ax-mp 5 | . . . . . 6 ⊢ 𝒫 ℝ = 𝒫 (R × {0R}) |
| 32 | 31 | breqi 5109 | . . . . 5 ⊢ (𝐴𝒫 ℝ(℩𝑦1〈0R, 1R〉𝑦) ↔ 𝐴𝒫 (R × {0R})(℩𝑦1〈0R, 1R〉𝑦)) |
| 33 | 24, 32 | bitri 278 | . . . 4 ⊢ (𝐴𝒫 ℝ(i‘1) ↔ 𝐴𝒫 (R × {0R})(℩𝑦1〈0R, 1R〉𝑦)) |
| 34 | 33 | anbi1i 636 | . . 3 ⊢ ((𝐴𝒫 ℝ(i‘1) ∧ 𝐹∅(0 · 1)) ↔ (𝐴𝒫 (R × {0R})(℩𝑦1〈0R, 1R〉𝑦) ∧ 𝐹∅(0 · 1))) |
| 35 | 34 | notbii 323 | . 2 ⊢ (¬ (𝐴𝒫 ℝ(i‘1) ∧ 𝐹∅(0 · 1)) ↔ ¬ (𝐴𝒫 (R × {0R})(℩𝑦1〈0R, 1R〉𝑦) ∧ 𝐹∅(0 · 1))) |
| 36 | 19, 35 | mpbir 234 | 1 ⊢ ¬ (𝐴𝒫 ℝ(i‘1) ∧ 𝐹∅(0 · 1)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 ∧ wa 401 = wceq 1570 ∈ wcel 2145 {cab 2738 Vcvv 3450 ⊆ wss 3899 ∅c0 4279 𝒫 cpw 4557 {csn 4584 〈cop 4590 class class class wbr 5103 × cxp 5653 ℩cio 6487 ‘cfv 6533 (class class class)co 7413 Rcnr 10874 0Rc0r 10875 1Rc1r 10876 ℝcr 11123 0cc0 11124 1c1 11125 ici 11126 · cmul 11129 |
| 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-12 2213 ax-ext 2732 ax-resscn 11181 ax-1cn 11182 ax-icn 11183 ax-addcl 11184 ax-mulcl 11186 ax-mulcom 11188 ax-mulass 11190 ax-distr 11191 ax-i2m1 11192 ax-1rid 11194 ax-cnre 11197 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2100 df-clab 2739 df-cleq 2752 df-clel 2835 df-rex 3087 df-rab 3413 df-v 3452 df-dif 3902 df-un 3904 df-ss 3916 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5104 df-iota 6489 df-fv 6541 df-ov 7416 df-i 11133 df-r 11134 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |