MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  avril1 Structured version   Visualization version   GIF version

Theorem avril1 31070
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.

Assertion
Ref Expression
avril1 ¬ (𝐴𝒫 ℝ(i‘1) ∧ 𝐹∅(0 · 1))

Proof of Theorem avril1
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 equid 2044 . . . . . . . 8 𝑥 = 𝑥
2 dfnul2 4281 . . . . . . . . . 10 ∅ = {𝑥 ∣ ¬ 𝑥 = 𝑥}
32eqabri 2902 . . . . . . . . 9 (𝑥 ∈ ∅ ↔ ¬ 𝑥 = 𝑥)
43con2bii 360 . . . . . . . 8 (𝑥 = 𝑥 ↔ ¬ 𝑥 ∈ ∅)
51, 4mpbi 233 . . . . . . 7 ¬ 𝑥 ∈ ∅
6 eleq1 2848 . . . . . . 7 (𝑥 = ⟨𝐹, 0⟩ → (𝑥 ∈ ∅ ↔ ⟨𝐹, 0⟩ ∈ ∅))
75, 6mtbii 329 . . . . . 6 (𝑥 = ⟨𝐹, 0⟩ → ¬ ⟨𝐹, 0⟩ ∈ ∅)
87vtocleg 3516 . . . . 5 (⟨𝐹, 0⟩ ∈ V → ¬ ⟨𝐹, 0⟩ ∈ ∅)
9 elex 3471 . . . . . 6 (⟨𝐹, 0⟩ ∈ ∅ → ⟨𝐹, 0⟩ ∈ V)
109con3i 155 . . . . 5 (¬ ⟨𝐹, 0⟩ ∈ V → ¬ ⟨𝐹, 0⟩ ∈ ∅)
118, 10pm2.61i 184 . . . 4 ¬ ⟨𝐹, 0⟩ ∈ ∅
12 df-br 5103 . . . . 5 (𝐹∅(0 · 1) ↔ ⟨𝐹, (0 · 1)⟩ ∈ ∅)
13 0cn 11302 . . . . . . . 8 0 ∈ ℂ
1413mulridi 11317 . . . . . . 7 (0 · 1) = 0
1514opeq2i 4843 . . . . . 6 ⟨𝐹, (0 · 1)⟩ = ⟨𝐹, 0⟩
1615eleq1i 2851 . . . . 5 (⟨𝐹, (0 · 1)⟩ ∈ ∅ ↔ ⟨𝐹, 0⟩ ∈ ∅)
1712, 16bitri 278 . . . 4 (𝐹∅(0 · 1) ↔ ⟨𝐹, 0⟩ ∈ ∅)
1811, 17mtbir 326 . . 3 ¬ 𝐹∅(0 · 1)
1918intnan 492 . 2 ¬ (𝐴𝒫 (R × {0R})(℩𝑦1⟨0R, 1R⟩𝑦) ∧ 𝐹∅(0 · 1))
20 df-i 11213 . . . . . . . 8 i = ⟨0R, 1R⟩
2120fveq1i 6887 . . . . . . 7 (i‘1) = (⟨0R, 1R⟩‘1)
22 df-fv 6547 . . . . . . 7 (⟨0R, 1R⟩‘1) = (℩𝑦1⟨0R, 1R⟩𝑦)
2321, 22eqtri 2783 . . . . . 6 (i‘1) = (℩𝑦1⟨0R, 1R⟩𝑦)
2423breq2i 5110 . . . . 5 (𝐴𝒫 ℝ(i‘1) ↔ 𝐴𝒫 ℝ(℩𝑦1⟨0R, 1R⟩𝑦))
25 df-r 11214 . . . . . . 7 ℝ = (R × {0R})
26 sseq2 3934 . . . . . . . . 9 (ℝ = (R × {0R}) → (𝑧 ⊆ ℝ ↔ 𝑧 ⊆ (R × {0R})))
2726abbidv 2826 . . . . . . . 8 (ℝ = (R × {0R}) → {𝑧 ∣ 𝑧 ⊆ ℝ} = {𝑧 ∣ 𝑧 ⊆ (R × {0R})})
28 df-pw 4558 . . . . . . . 8 𝒫 ℝ = {𝑧 ∣ 𝑧 ⊆ ℝ}
29 df-pw 4558 . . . . . . . 8 𝒫 (R × {0R}) = {𝑧 ∣ 𝑧 ⊆ (R × {0R})}
3027, 28, 293eqtr4g 2820 . . . . . . 7 (ℝ = (R × {0R}) → 𝒫 ℝ = 𝒫 (R × {0R}))
3125, 30ax-mp 5 . . . . . 6 𝒫 ℝ = 𝒫 (R × {0R})
3231breqi 5108 . . . . 5 (𝐴𝒫 ℝ(℩𝑦1⟨0R, 1R⟩𝑦) ↔ 𝐴𝒫 (R × {0R})(℩𝑦1⟨0R, 1R⟩𝑦))
3324, 32bitri 278 . . . 4 (𝐴𝒫 ℝ(i‘1) ↔ 𝐴𝒫 (R × {0R})(℩𝑦1⟨0R, 1R⟩𝑦))
3433anbi1i 636 . . 3 ((𝐴𝒫 ℝ(i‘1) ∧ 𝐹∅(0 · 1)) ↔ (𝐴𝒫 (R × {0R})(℩𝑦1⟨0R, 1R⟩𝑦) ∧ 𝐹∅(0 · 1)))
3534notbii 323 . 2 (¬ (𝐴𝒫 ℝ(i‘1) ∧ 𝐹∅(0 · 1)) ↔ ¬ (𝐴𝒫 (R × {0R})(℩𝑦1⟨0R, 1R⟩𝑦) ∧ 𝐹∅(0 · 1)))
3619, 35mpbir 234 1 ¬ (𝐴𝒫 ℝ(i‘1) ∧ 𝐹∅(0 · 1))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   ∧ wa 401   = wceq 1569   ∈ wcel 2144  {cab 2738  Vcvv 3450   ⊆ wss 3895  ∅c0 4278  𝒫 cpw 4556  {csn 4584  ⟨cop 4834   class class class wbr 5102   × cxp 5648  ℩cio 6492  ‘cfv 6539  (class class class)co 7421  Rcnr 10954  0Rc0r 10955  1Rc1r 10956  ℝcr 11203  0cc0 11204  1c1 11205  ici 11206   · cmul 11209
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-12 2212  ax-ext 2732  ax-resscn 11261  ax-1cn 11262  ax-icn 11263  ax-addcl 11264  ax-mulcl 11266  ax-mulcom 11268  ax-mulass 11270  ax-distr 11271  ax-i2m1 11272  ax-1rid 11274  ax-cnre 11277
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-iota 6494  df-fv 6547  df-ov 7424  df-i 11213  df-r 11214
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator