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

Theorem made0 28279
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 6436 . . 3 ∅ ∈ On
2 madeval2 28249 . . 3 (∅ ∈ On → (M‘∅) = {𝑥 ∈ No ∣ ∃𝑙 ∈ 𝒫 ∪ (M “ ∅)∃𝑟 ∈ 𝒫 ∪ (M “ ∅)(𝑙 <<s 𝑟 ∧ (𝑙 |s 𝑟) = 𝑥)})
31, 2ax-mp 5 . 2 (M‘∅) = {𝑥 ∈ No ∣ ∃𝑙 ∈ 𝒫 ∪ (M “ ∅)∃𝑟 ∈ 𝒫 ∪ (M “ ∅)(𝑙 <<s 𝑟 ∧ (𝑙 |s 𝑟) = 𝑥)}
4 rabeqsn 4628 . . 3 ({𝑥 ∈ No ∣ ∃𝑙 ∈ 𝒫 ∪ (M “ ∅)∃𝑟 ∈ 𝒫 ∪ (M “ ∅)(𝑙 <<s 𝑟 ∧ (𝑙 |s 𝑟) = 𝑥)} = { 0s } ↔ ∀𝑥((𝑥 ∈ No ∧ ∃𝑙 ∈ 𝒫 ∪ (M “ ∅)∃𝑟 ∈ 𝒫 ∪ (M “ ∅)(𝑙 <<s 𝑟 ∧ (𝑙 |s 𝑟) = 𝑥)) ↔ 𝑥 = 0s ))
5 0elpw 5321 . . . . . . . 8 ∅ ∈ 𝒫 No
6 nulsgts 28192 . . . . . . . 8 (∅ ∈ 𝒫 No → ∅ <<s ∅)
75, 6ax-mp 5 . . . . . . 7 ∅ <<s ∅
8 ima0 6087 . . . . . . . . . . . . 13 (M “ ∅) = ∅
98unieqi 4882 . . . . . . . . . . . 12 ∪ (M “ ∅) = ∪ ∅
10 uni0 4899 . . . . . . . . . . . 12 ∪ ∅ = ∅
119, 10eqtri 2786 . . . . . . . . . . 11 ∪ (M “ ∅) = ∅
1211pweqi 4576 . . . . . . . . . 10 𝒫 ∪ (M “ ∅) = 𝒫 ∅
13 pw0 4833 . . . . . . . . . 10 𝒫 ∅ = {∅}
1412, 13eqtri 2786 . . . . . . . . 9 𝒫 ∪ (M “ ∅) = {∅}
1514rexeqi 3322 . . . . . . . 8 (∃𝑙 ∈ 𝒫 ∪ (M “ ∅)∃𝑟 ∈ 𝒫 ∪ (M “ ∅)(𝑙 <<s 𝑟 ∧ (𝑙 |s 𝑟) = 𝑥) ↔ ∃𝑙 ∈ {∅}∃𝑟 ∈ 𝒫 ∪ (M “ ∅)(𝑙 <<s 𝑟 ∧ (𝑙 |s 𝑟) = 𝑥))
1614rexeqi 3322 . . . . . . . . 9 (∃𝑟 ∈ 𝒫 ∪ (M “ ∅)(𝑙 <<s 𝑟 ∧ (𝑙 |s 𝑟) = 𝑥) ↔ ∃𝑟 ∈ {∅} (𝑙 <<s 𝑟 ∧ (𝑙 |s 𝑟) = 𝑥))
1716rexbii 3113 . . . . . . . 8 (∃𝑙 ∈ {∅}∃𝑟 ∈ 𝒫 ∪ (M “ ∅)(𝑙 <<s 𝑟 ∧ (𝑙 |s 𝑟) = 𝑥) ↔ ∃𝑙 ∈ {∅}∃𝑟 ∈ {∅} (𝑙 <<s 𝑟 ∧ (𝑙 |s 𝑟) = 𝑥))
18 0ex 5264 . . . . . . . . . . 11 ∅ ∈ V
19 breq2 5110 . . . . . . . . . . . 12 (𝑟 = ∅ → (𝑙 <<s 𝑟 ↔ 𝑙 <<s ∅))
20 oveq2 7451 . . . . . . . . . . . . 13 (𝑟 = ∅ → (𝑙 |s 𝑟) = (𝑙 |s ∅))
2120eqeq1d 2765 . . . . . . . . . . . 12 (𝑟 = ∅ → ((𝑙 |s 𝑟) = 𝑥 ↔ (𝑙 |s ∅) = 𝑥))
2219, 21anbi12d 644 . . . . . . . . . . 11 (𝑟 = ∅ → ((𝑙 <<s 𝑟 ∧ (𝑙 |s 𝑟) = 𝑥) ↔ (𝑙 <<s ∅ ∧ (𝑙 |s ∅) = 𝑥)))
2318, 22rexsn 4643 . . . . . . . . . 10 (∃𝑟 ∈ {∅} (𝑙 <<s 𝑟 ∧ (𝑙 |s 𝑟) = 𝑥) ↔ (𝑙 <<s ∅ ∧ (𝑙 |s ∅) = 𝑥))
2423rexbii 3113 . . . . . . . . 9 (∃𝑙 ∈ {∅}∃𝑟 ∈ {∅} (𝑙 <<s 𝑟 ∧ (𝑙 |s 𝑟) = 𝑥) ↔ ∃𝑙 ∈ {∅} (𝑙 <<s ∅ ∧ (𝑙 |s ∅) = 𝑥))
25 breq1 5109 . . . . . . . . . . 11 (𝑙 = ∅ → (𝑙 <<s ∅ ↔ ∅ <<s ∅))
26 oveq1 7450 . . . . . . . . . . . 12 (𝑙 = ∅ → (𝑙 |s ∅) = (∅ |s ∅))
2726eqeq1d 2765 . . . . . . . . . . 11 (𝑙 = ∅ → ((𝑙 |s ∅) = 𝑥 ↔ (∅ |s ∅) = 𝑥))
2825, 27anbi12d 644 . . . . . . . . . 10 (𝑙 = ∅ → ((𝑙 <<s ∅ ∧ (𝑙 |s ∅) = 𝑥) ↔ (∅ <<s ∅ ∧ (∅ |s ∅) = 𝑥)))
2918, 28rexsn 4643 . . . . . . . . 9 (∃𝑙 ∈ {∅} (𝑙 <<s ∅ ∧ (𝑙 |s ∅) = 𝑥) ↔ (∅ <<s ∅ ∧ (∅ |s ∅) = 𝑥))
3024, 29bitri 278 . . . . . . . 8 (∃𝑙 ∈ {∅}∃𝑟 ∈ {∅} (𝑙 <<s 𝑟 ∧ (𝑙 |s 𝑟) = 𝑥) ↔ (∅ <<s ∅ ∧ (∅ |s ∅) = 𝑥))
3115, 17, 303bitri 300 . . . . . . 7 (∃𝑙 ∈ 𝒫 ∪ (M “ ∅)∃𝑟 ∈ 𝒫 ∪ (M “ ∅)(𝑙 <<s 𝑟 ∧ (𝑙 |s 𝑟) = 𝑥) ↔ (∅ <<s ∅ ∧ (∅ |s ∅) = 𝑥))
327, 31mpbiran 722 . . . . . 6 (∃𝑙 ∈ 𝒫 ∪ (M “ ∅)∃𝑟 ∈ 𝒫 ∪ (M “ ∅)(𝑙 <<s 𝑟 ∧ (𝑙 |s 𝑟) = 𝑥) ↔ (∅ |s ∅) = 𝑥)
33 df-0s 28223 . . . . . . 7 0s = (∅ |s ∅)
3433eqeq1i 2768 . . . . . 6 ( 0s = 𝑥 ↔ (∅ |s ∅) = 𝑥)
35 eqcom 2770 . . . . . 6 ( 0s = 𝑥 ↔ 𝑥 = 0s )
3632, 34, 353bitr2i 302 . . . . 5 (∃𝑙 ∈ 𝒫 ∪ (M “ ∅)∃𝑟 ∈ 𝒫 ∪ (M “ ∅)(𝑙 <<s 𝑟 ∧ (𝑙 |s 𝑟) = 𝑥) ↔ 𝑥 = 0s )
3736anbi2i 635 . . . 4 ((𝑥 ∈ No ∧ ∃𝑙 ∈ 𝒫 ∪ (M “ ∅)∃𝑟 ∈ 𝒫 ∪ (M “ ∅)(𝑙 <<s 𝑟 ∧ (𝑙 |s 𝑟) = 𝑥)) ↔ (𝑥 ∈ No ∧ 𝑥 = 0s ))
38 0no 28225 . . . . . 6 0s ∈ No
39 eleq1 2852 . . . . . 6 (𝑥 = 0s → (𝑥 ∈ No ↔ 0s ∈ No))
4038, 39mpbiri 261 . . . . 5 (𝑥 = 0s → 𝑥 ∈ No)
4140pm4.71ri 570 . . . 4 (𝑥 = 0s ↔ (𝑥 ∈ No ∧ 𝑥 = 0s ))
4237, 41bitr4i 281 . . 3 ((𝑥 ∈ No ∧ ∃𝑙 ∈ 𝒫 ∪ (M “ ∅)∃𝑟 ∈ 𝒫 ∪ (M “ ∅)(𝑙 <<s 𝑟 ∧ (𝑙 |s 𝑟) = 𝑥)) ↔ 𝑥 = 0s )
434, 42mpgbir 1832 . 2 {𝑥 ∈ No ∣ ∃𝑙 ∈ 𝒫 ∪ (M “ ∅)∃𝑟 ∈ 𝒫 ∪ (M “ ∅)(𝑙 <<s 𝑟 ∧ (𝑙 |s 𝑟) = 𝑥)} = { 0s }
443, 43eqtri 2786 1 (M‘∅) = { 0s }
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∃wrex 3090  {crab 3416  ∅c0 4281  𝒫 cpw 4560  {csn 4588  ∪ cuni 4870   class class class wbr 5106   “ cima 5658  Oncon0 6380  ‘cfv 6558  (class class class)co 7443  Nocsur 28027   <<s cslts 28173   |s ccuts 28175   0s c0s 28221  Mcmade 28238
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7775
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-tp 4593  df-op 4839  df-uni 4871  df-int 4911  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-tr 5216  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6322  df-ord 6383  df-on 6384  df-suc 6386  df-iota 6512  df-fun 6560  df-fn 6561  df-f 6562  df-f1 6563  df-fo 6564  df-f1o 6565  df-fv 6566  df-riota 7400  df-ov 7446  df-oprab 7447  df-mpo 7448  df-2nd 8026  df-frecs 8327  df-wrecs 8358  df-recs 8407  df-1o 8504  df-2o 8505  df-no 28030  df-lts 28031  df-bday 28032  df-slts 28174  df-cuts 28176  df-0s 28223  df-made 28243
This theorem is used by:  new0  28280  old1  28281
  Copyright terms: Public domain W3C validator