HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem avril1 8964
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 germanus dictum sit, altum viditur, often used in set theory. Starting with the seemingly simple yet profound fact that any object x 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.)

A reply to skeptics can be found at http://us.metamath.org/mpegif/mmnotes.txt, under the 1-Apr-06 entry.

Assertion
Ref Expression
avril1 |- -. (AP~RR(i` 1) /\ F(/)(0 x. 1))

Proof of Theorem avril1
StepHypRef Expression
1 equid 1113 . . . . . . . 8 |- x = x
2 dfnul2 2253 . . . . . . . . . 10 |- (/) = {x | -. x = x}
32abeq2i 1546 . . . . . . . . 9 |- (x e. (/) <-> -. x = x)
43con2bii 221 . . . . . . . 8 |- (x = x <-> -. x e. (/))
51, 4mpbi 189 . . . . . . 7 |- -. x e. (/)
6 eleq1 1510 . . . . . . 7 |- (x = <.F, 0>. -> (x e. (/) <-> <.F, 0>. e. (/)))
75, 6mtbii 713 . . . . . 6 |- (x = <.F, 0>. -> -. <.F, 0>. e. (/))
87vtocleg 1830 . . . . 5 |- (<.F, 0>. e. V -> -. <.F, 0>. e. (/))
9 elisset 1792 . . . . . 6 |- (<.F, 0>. e. (/) -> <.F, 0>. e. V)
109con3i 98 . . . . 5 |- (-. <.F, 0>. e. V -> -. <.F, 0>. e. (/))
118, 10pm2.61i 126 . . . 4 |- -. <.F, 0>. e. (/)
12 df-br 2588 . . . . 5 |- (F(/)(0 x. 1) <-> <.F, (0 x. 1)>. e. (/))
13 0cn 5251 . . . . . . . 8 |- 0 e. CC
1413mulid1 5255 . . . . . . 7 |- (0 x. 1) = 0
1514opeq2i 2460 . . . . . 6 |- <.F, (0 x. 1)>. = <.F, 0>.
1615eleq1i 1513 . . . . 5 |- (<.F, (0 x. 1)>. e. (/) <-> <.F, 0>. e. (/))
1712, 16bitr 173 . . . 4 |- (F(/)(0 x. 1) <-> <.F, 0>. e. (/))
1811, 17mtbir 192 . . 3 |- -. F(/)(0 x. 1)
1918intnan 688 . 2 |- -. (AP~(R. X. {0R})U.{y | (<.0R, 1R>."{1}) = {y}} /\ F(/)(0 x. 1))
20 df-i 5166 . . . . . . . 8 |- i = <.0R, 1R>.
2120fveq1i 3664 . . . . . . 7 |- (i` 1) = (<.0R, 1R>.` 1)
22 df-fv 3161 . . . . . . 7 |- (<.0R, 1R>.` 1) = U.{y | (<.0R, 1R>."{1}) = {y}}
2321, 22eqtr 1471 . . . . . 6 |- (i` 1) = U.{y | (<.0R, 1R>."{1}) = {y}}
2423breq2i 2595 . . . . 5 |- (AP~RR(i` 1) <-> AP~RRU.{y | (<.0R, 1R>."{1}) = {y}})
25 df-r 5167 . . . . . . 7 |- RR = (R. X. {0R})
26 sseq2 2054 . . . . . . . . 9 |- (RR = (R. X. {0R}) -> (z (_ RR <-> z (_ (R. X. {0R})))
2726abbidv 1553 . . . . . . . 8 |- (RR = (R. X. {0R}) -> {z | z (_ RR} = {z | z (_ (R. X. {0R})})
28 df-pw 2373 . . . . . . . 8 |- P~RR = {z | z (_ RR}
29 df-pw 2373 . . . . . . . 8 |- P~(R. X. {0R}) = {z | z (_ (R. X. {0R})}
3027, 28, 293eqtr4g 1507 . . . . . . 7 |- (RR = (R. X. {0R}) -> P~RR = P~(R. X. {0R}))
3125, 30ax-mp 7 . . . . . 6 |- P~RR = P~(R. X. {0R})
3231breqi 2593 . . . . 5 |- (AP~RRU.{y | (<.0R, 1R>."{1}) = {y}} <-> AP~(R. X. {0R})U.{y | (<.0R, 1R>."{1}) = {y}})
3324, 32bitr 173 . . . 4 |- (AP~RR(i` 1) <-> AP~(R. X. {0R})U.{y | (<.0R, 1R>."{1}) = {y}})
3433anbi1i 480 . . 3 |- ((AP~RR(i` 1) /\ F(/)(0 x. 1)) <-> (AP~(R. X. {0R})U.{y | (<.0R, 1R>."{1}) = {y}} /\ F(/)(0 x. 1)))
3534negbii 187 . 2 |- (-. (AP~RR(i` 1) /\ F(/)(0 x. 1)) <-> -. (AP~(R. X. {0R})U.{y | (<.0R, 1R>."{1}) = {y}} /\ F(/)(0 x. 1)))
3619, 35mpbir 190 1 |- -. (AP~RR(i` 1) /\ F(/)(0 x. 1))
Colors of variables: wff set class
Syntax hints:  -. wn 2   /\ wa 223   = wceq 1099   e. wcel 1105  {cab 1440  Vcvv 1786   (_ wss 2018  (/)c0 2251  P~cpw 2372  {csn 2380  <.cop 2382  U.cuni 2471   class class class wbr 2587   X. cxp 3131  "cima 3136  ` cfv 3145  (class class class)co 3902  R.cnr 4916  0Rc0r 4917  1Rc1r 4918  RRcr 5156  0cc0 5157  1c1 5158  ici 5159   x. cmul 5162
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-4 951  ax-5 952  ax-6 953  ax-7 954  ax-gen 955  ax-8 1101  ax-9 1102  ax-10 1103  ax-12 1104  ax-13 1107  ax-14 1108  ax-11 1180  ax-17 1190  ax-16 1194  ax-11o 1202  ax-ext 1436  ax-rep 2661  ax-sep 2671  ax-nul 2678  ax-pow 2710  ax-pr 2747  ax-un 2830  ax-inf2 4549
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-3or 773  df-3an 774  df-ex 957  df-sb 1155  df-eu 1359  df-mo 1360  df-clab 1441  df-cleq 1446  df-clel 1449  df-ne 1563  df-ral 1625  df-rex 1626  df-reu 1627  df-rab 1628  df-v 1787  df-sbc 1913  df-csb 1973  df-dif 2020  df-un 2021  df-in 2022  df-ss 2024  df-pss 2026  df-nul 2252  df-if 2333  df-pw 2373  df-sn 2383  df-pr 2384  df-tp 2386  df-op 2387  df-uni 2472  df-int 2502  df-iun 2536  df-br 2588  df-opab 2635  df-tr 2649  df-eprel 2794  df-id 2797  df-po 2804  df-so 2814  df-fr 2880  df-we 2897  df-ord 2914  df-on 2915  df-lim 2916  df-suc 2917  df-om 3095  df-xp 3147  df-rel 3148  df-cnv 3149  df-co 3150  df-dm 3151  df-rn 3152  df-res 3153  df-ima 3154  df-fun 3155  df-fn 3156  df-f 3157  df-fv 3161  df-rdg 3871  df-opr 3904  df-oprab 3905  df-1st 4017  df-2nd 4018  df-1o 4071  df-oadd 4073  df-omul 4074  df-er 4199  df-ec 4201  df-qs 4204  df-ni 4923  df-pli 4924  df-mi 4925  df-lti 4926  df-plpq 4958  df-mpq 4959  df-enq 4960  df-nq 4961  df-plq 4962  df-mq 4963  df-rq 4964  df-ltq 4965  df-1q 4966  df-np 5009  df-1p 5010  df-plp 5011  df-mp 5012  df-ltp 5013  df-plpr 5087  df-mpr 5088  df-enr 5089  df-nr 5090  df-plr 5091  df-mr 5092  df-0r 5094  df-1r 5095  df-m1r 5096  df-c 5163  df-0 5164  df-1 5165  df-i 5166  df-r 5167  df-plus 5168  df-mul 5169
Copyright terms: Public domain