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

Theorem made0 27837
Description: The only surreal made on day is 0s. (Contributed by Scott Fenton, 7-Aug-2024.)
Assertion
Ref Expression
made0 ( M ‘∅) = { 0s }

Proof of Theorem made0
Dummy variables 𝑥 𝑙 𝑟 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 0elon 6407 . . 3 ∅ ∈ On
2 madeval2 27813 . . 3 (∅ ∈ On → ( M ‘∅) = {𝑥 No ∣ ∃𝑙 ∈ 𝒫 ( M “ ∅)∃𝑟 ∈ 𝒫 ( M “ ∅)(𝑙 <<s 𝑟 ∧ (𝑙 |s 𝑟) = 𝑥)})
31, 2ax-mp 5 . 2 ( M ‘∅) = {𝑥 No ∣ ∃𝑙 ∈ 𝒫 ( M “ ∅)∃𝑟 ∈ 𝒫 ( M “ ∅)(𝑙 <<s 𝑟 ∧ (𝑙 |s 𝑟) = 𝑥)}
4 rabeqsn 4643 . . 3 ({𝑥 No ∣ ∃𝑙 ∈ 𝒫 ( M “ ∅)∃𝑟 ∈ 𝒫 ( M “ ∅)(𝑙 <<s 𝑟 ∧ (𝑙 |s 𝑟) = 𝑥)} = { 0s } ↔ ∀𝑥((𝑥 No ∧ ∃𝑙 ∈ 𝒫 ( M “ ∅)∃𝑟 ∈ 𝒫 ( M “ ∅)(𝑙 <<s 𝑟 ∧ (𝑙 |s 𝑟) = 𝑥)) ↔ 𝑥 = 0s ))
5 0elpw 5326 . . . . . . . 8 ∅ ∈ 𝒫 No
6 nulssgt 27762 . . . . . . . 8 (∅ ∈ 𝒫 No → ∅ <<s ∅)
75, 6ax-mp 5 . . . . . . 7 ∅ <<s ∅
8 ima0 6064 . . . . . . . . . . . . 13 ( M “ ∅) = ∅
98unieqi 4895 . . . . . . . . . . . 12 ( M “ ∅) =
10 uni0 4911 . . . . . . . . . . . 12 ∅ = ∅
119, 10eqtri 2758 . . . . . . . . . . 11 ( M “ ∅) = ∅
1211pweqi 4591 . . . . . . . . . 10 𝒫 ( M “ ∅) = 𝒫 ∅
13 pw0 4788 . . . . . . . . . 10 𝒫 ∅ = {∅}
1412, 13eqtri 2758 . . . . . . . . 9 𝒫 ( M “ ∅) = {∅}
1514rexeqi 3304 . . . . . . . 8 (∃𝑙 ∈ 𝒫 ( M “ ∅)∃𝑟 ∈ 𝒫 ( M “ ∅)(𝑙 <<s 𝑟 ∧ (𝑙 |s 𝑟) = 𝑥) ↔ ∃𝑙 ∈ {∅}∃𝑟 ∈ 𝒫 ( M “ ∅)(𝑙 <<s 𝑟 ∧ (𝑙 |s 𝑟) = 𝑥))
1614rexeqi 3304 . . . . . . . . 9 (∃𝑟 ∈ 𝒫 ( M “ ∅)(𝑙 <<s 𝑟 ∧ (𝑙 |s 𝑟) = 𝑥) ↔ ∃𝑟 ∈ {∅} (𝑙 <<s 𝑟 ∧ (𝑙 |s 𝑟) = 𝑥))
1716rexbii 3083 . . . . . . . 8 (∃𝑙 ∈ {∅}∃𝑟 ∈ 𝒫 ( M “ ∅)(𝑙 <<s 𝑟 ∧ (𝑙 |s 𝑟) = 𝑥) ↔ ∃𝑙 ∈ {∅}∃𝑟 ∈ {∅} (𝑙 <<s 𝑟 ∧ (𝑙 |s 𝑟) = 𝑥))
18 0ex 5277 . . . . . . . . . . 11 ∅ ∈ V
19 breq2 5123 . . . . . . . . . . . 12 (𝑟 = ∅ → (𝑙 <<s 𝑟𝑙 <<s ∅))
20 oveq2 7413 . . . . . . . . . . . . 13 (𝑟 = ∅ → (𝑙 |s 𝑟) = (𝑙 |s ∅))
2120eqeq1d 2737 . . . . . . . . . . . 12 (𝑟 = ∅ → ((𝑙 |s 𝑟) = 𝑥 ↔ (𝑙 |s ∅) = 𝑥))
2219, 21anbi12d 632 . . . . . . . . . . 11 (𝑟 = ∅ → ((𝑙 <<s 𝑟 ∧ (𝑙 |s 𝑟) = 𝑥) ↔ (𝑙 <<s ∅ ∧ (𝑙 |s ∅) = 𝑥)))
2318, 22rexsn 4658 . . . . . . . . . 10 (∃𝑟 ∈ {∅} (𝑙 <<s 𝑟 ∧ (𝑙 |s 𝑟) = 𝑥) ↔ (𝑙 <<s ∅ ∧ (𝑙 |s ∅) = 𝑥))
2423rexbii 3083 . . . . . . . . 9 (∃𝑙 ∈ {∅}∃𝑟 ∈ {∅} (𝑙 <<s 𝑟 ∧ (𝑙 |s 𝑟) = 𝑥) ↔ ∃𝑙 ∈ {∅} (𝑙 <<s ∅ ∧ (𝑙 |s ∅) = 𝑥))
25 breq1 5122 . . . . . . . . . . 11 (𝑙 = ∅ → (𝑙 <<s ∅ ↔ ∅ <<s ∅))
26 oveq1 7412 . . . . . . . . . . . 12 (𝑙 = ∅ → (𝑙 |s ∅) = (∅ |s ∅))
2726eqeq1d 2737 . . . . . . . . . . 11 (𝑙 = ∅ → ((𝑙 |s ∅) = 𝑥 ↔ (∅ |s ∅) = 𝑥))
2825, 27anbi12d 632 . . . . . . . . . 10 (𝑙 = ∅ → ((𝑙 <<s ∅ ∧ (𝑙 |s ∅) = 𝑥) ↔ (∅ <<s ∅ ∧ (∅ |s ∅) = 𝑥)))
2918, 28rexsn 4658 . . . . . . . . 9 (∃𝑙 ∈ {∅} (𝑙 <<s ∅ ∧ (𝑙 |s ∅) = 𝑥) ↔ (∅ <<s ∅ ∧ (∅ |s ∅) = 𝑥))
3024, 29bitri 275 . . . . . . . 8 (∃𝑙 ∈ {∅}∃𝑟 ∈ {∅} (𝑙 <<s 𝑟 ∧ (𝑙 |s 𝑟) = 𝑥) ↔ (∅ <<s ∅ ∧ (∅ |s ∅) = 𝑥))
3115, 17, 303bitri 297 . . . . . . 7 (∃𝑙 ∈ 𝒫 ( M “ ∅)∃𝑟 ∈ 𝒫 ( M “ ∅)(𝑙 <<s 𝑟 ∧ (𝑙 |s 𝑟) = 𝑥) ↔ (∅ <<s ∅ ∧ (∅ |s ∅) = 𝑥))
327, 31mpbiran 709 . . . . . 6 (∃𝑙 ∈ 𝒫 ( M “ ∅)∃𝑟 ∈ 𝒫 ( M “ ∅)(𝑙 <<s 𝑟 ∧ (𝑙 |s 𝑟) = 𝑥) ↔ (∅ |s ∅) = 𝑥)
33 df-0s 27788 . . . . . . 7 0s = (∅ |s ∅)
3433eqeq1i 2740 . . . . . 6 ( 0s = 𝑥 ↔ (∅ |s ∅) = 𝑥)
35 eqcom 2742 . . . . . 6 ( 0s = 𝑥𝑥 = 0s )
3632, 34, 353bitr2i 299 . . . . 5 (∃𝑙 ∈ 𝒫 ( M “ ∅)∃𝑟 ∈ 𝒫 ( M “ ∅)(𝑙 <<s 𝑟 ∧ (𝑙 |s 𝑟) = 𝑥) ↔ 𝑥 = 0s )
3736anbi2i 623 . . . 4 ((𝑥 No ∧ ∃𝑙 ∈ 𝒫 ( M “ ∅)∃𝑟 ∈ 𝒫 ( M “ ∅)(𝑙 <<s 𝑟 ∧ (𝑙 |s 𝑟) = 𝑥)) ↔ (𝑥 No 𝑥 = 0s ))
38 0sno 27790 . . . . . 6 0s No
39 eleq1 2822 . . . . . 6 (𝑥 = 0s → (𝑥 No ↔ 0s No ))
4038, 39mpbiri 258 . . . . 5 (𝑥 = 0s𝑥 No )
4140pm4.71ri 560 . . . 4 (𝑥 = 0s ↔ (𝑥 No 𝑥 = 0s ))
4237, 41bitr4i 278 . . 3 ((𝑥 No ∧ ∃𝑙 ∈ 𝒫 ( M “ ∅)∃𝑟 ∈ 𝒫 ( M “ ∅)(𝑙 <<s 𝑟 ∧ (𝑙 |s 𝑟) = 𝑥)) ↔ 𝑥 = 0s )
434, 42mpgbir 1799 . 2 {𝑥 No ∣ ∃𝑙 ∈ 𝒫 ( M “ ∅)∃𝑟 ∈ 𝒫 ( M “ ∅)(𝑙 <<s 𝑟 ∧ (𝑙 |s 𝑟) = 𝑥)} = { 0s }
443, 43eqtri 2758 1 ( M ‘∅) = { 0s }
Colors of variables: wff setvar class
Syntax hints:  wb 206  wa 395   = wceq 1540  wcel 2108  wrex 3060  {crab 3415  c0 4308  𝒫 cpw 4575  {csn 4601   cuni 4883   class class class wbr 5119  cima 5657  Oncon0 6352  cfv 6531  (class class class)co 7405   No csur 27603   <<s csslt 27744   |s cscut 27746   0s c0s 27786   M cmade 27802
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2707  ax-rep 5249  ax-sep 5266  ax-nul 5276  ax-pow 5335  ax-pr 5402  ax-un 7729
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2539  df-eu 2568  df-clab 2714  df-cleq 2727  df-clel 2809  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3061  df-rmo 3359  df-reu 3360  df-rab 3416  df-v 3461  df-sbc 3766  df-csb 3875  df-dif 3929  df-un 3931  df-in 3933  df-ss 3943  df-pss 3946  df-nul 4309  df-if 4501  df-pw 4577  df-sn 4602  df-pr 4604  df-tp 4606  df-op 4608  df-uni 4884  df-int 4923  df-iun 4969  df-br 5120  df-opab 5182  df-mpt 5202  df-tr 5230  df-id 5548  df-eprel 5553  df-po 5561  df-so 5562  df-fr 5606  df-we 5608  df-xp 5660  df-rel 5661  df-cnv 5662  df-co 5663  df-dm 5664  df-rn 5665  df-res 5666  df-ima 5667  df-pred 6290  df-ord 6355  df-on 6356  df-suc 6358  df-iota 6484  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-riota 7362  df-ov 7408  df-oprab 7409  df-mpo 7410  df-2nd 7989  df-frecs 8280  df-wrecs 8311  df-recs 8385  df-1o 8480  df-2o 8481  df-no 27606  df-slt 27607  df-bday 27608  df-sslt 27745  df-scut 27747  df-0s 27788  df-made 27807
This theorem is referenced by:  new0  27838  old1  27839
  Copyright terms: Public domain W3C validator