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

Theorem newbday 27816
Description: A surreal is an element of a new set iff its birthday is equal to that ordinal. Remark in [Conway] p. 29. (Contributed by Scott Fenton, 19-Aug-2024.)
Assertion
Ref Expression
newbday ((𝐴 ∈ On ∧ 𝑋 No ) → (𝑋 ∈ ( N ‘𝐴) ↔ ( bday 𝑋) = 𝐴))

Proof of Theorem newbday
StepHypRef Expression
1 madebday 27814 . . 3 ((𝐴 ∈ On ∧ 𝑋 No ) → (𝑋 ∈ ( M ‘𝐴) ↔ ( bday 𝑋) ⊆ 𝐴))
2 oldbday 27815 . . . 4 ((𝐴 ∈ On ∧ 𝑋 No ) → (𝑋 ∈ ( O ‘𝐴) ↔ ( bday 𝑋) ∈ 𝐴))
32notbid 318 . . 3 ((𝐴 ∈ On ∧ 𝑋 No ) → (¬ 𝑋 ∈ ( O ‘𝐴) ↔ ¬ ( bday 𝑋) ∈ 𝐴))
41, 3anbi12d 632 . 2 ((𝐴 ∈ On ∧ 𝑋 No ) → ((𝑋 ∈ ( M ‘𝐴) ∧ ¬ 𝑋 ∈ ( O ‘𝐴)) ↔ (( bday 𝑋) ⊆ 𝐴 ∧ ¬ ( bday 𝑋) ∈ 𝐴)))
5 newval 27765 . . . . . 6 ( N ‘𝐴) = (( M ‘𝐴) ∖ ( O ‘𝐴))
65a1i 11 . . . . 5 (𝐴 ∈ On → ( N ‘𝐴) = (( M ‘𝐴) ∖ ( O ‘𝐴)))
76eleq2d 2814 . . . 4 (𝐴 ∈ On → (𝑋 ∈ ( N ‘𝐴) ↔ 𝑋 ∈ (( M ‘𝐴) ∖ ( O ‘𝐴))))
8 eldif 3913 . . . 4 (𝑋 ∈ (( M ‘𝐴) ∖ ( O ‘𝐴)) ↔ (𝑋 ∈ ( M ‘𝐴) ∧ ¬ 𝑋 ∈ ( O ‘𝐴)))
97, 8bitrdi 287 . . 3 (𝐴 ∈ On → (𝑋 ∈ ( N ‘𝐴) ↔ (𝑋 ∈ ( M ‘𝐴) ∧ ¬ 𝑋 ∈ ( O ‘𝐴))))
109adantr 480 . 2 ((𝐴 ∈ On ∧ 𝑋 No ) → (𝑋 ∈ ( N ‘𝐴) ↔ (𝑋 ∈ ( M ‘𝐴) ∧ ¬ 𝑋 ∈ ( O ‘𝐴))))
11 bdayelon 27686 . . . . 5 ( bday 𝑋) ∈ On
1211onordi 6420 . . . 4 Ord ( bday 𝑋)
13 eloni 6317 . . . 4 (𝐴 ∈ On → Ord 𝐴)
14 ordtri4 6344 . . . 4 ((Ord ( bday 𝑋) ∧ Ord 𝐴) → (( bday 𝑋) = 𝐴 ↔ (( bday 𝑋) ⊆ 𝐴 ∧ ¬ ( bday 𝑋) ∈ 𝐴)))
1512, 13, 14sylancr 587 . . 3 (𝐴 ∈ On → (( bday 𝑋) = 𝐴 ↔ (( bday 𝑋) ⊆ 𝐴 ∧ ¬ ( bday 𝑋) ∈ 𝐴)))
1615adantr 480 . 2 ((𝐴 ∈ On ∧ 𝑋 No ) → (( bday 𝑋) = 𝐴 ↔ (( bday 𝑋) ⊆ 𝐴 ∧ ¬ ( bday 𝑋) ∈ 𝐴)))
174, 10, 163bitr4d 311 1 ((𝐴 ∈ On ∧ 𝑋 No ) → (𝑋 ∈ ( N ‘𝐴) ↔ ( bday 𝑋) = 𝐴))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 206  wa 395   = wceq 1540  wcel 2109  cdif 3900  wss 3903  Ord word 6306  Oncon0 6307  cfv 6482   No csur 27549   bday cbday 27551   M cmade 27752   O cold 27753   N cnew 27754
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 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-rep 5218  ax-sep 5235  ax-nul 5245  ax-pow 5304  ax-pr 5371  ax-un 7671
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 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-rmo 3343  df-reu 3344  df-rab 3395  df-v 3438  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4285  df-if 4477  df-pw 4553  df-sn 4578  df-pr 4580  df-tp 4582  df-op 4584  df-uni 4859  df-int 4897  df-iun 4943  df-br 5093  df-opab 5155  df-mpt 5174  df-tr 5200  df-id 5514  df-eprel 5519  df-po 5527  df-so 5528  df-fr 5572  df-we 5574  df-xp 5625  df-rel 5626  df-cnv 5627  df-co 5628  df-dm 5629  df-rn 5630  df-res 5631  df-ima 5632  df-pred 6249  df-ord 6310  df-on 6311  df-suc 6313  df-iota 6438  df-fun 6484  df-fn 6485  df-f 6486  df-f1 6487  df-fo 6488  df-f1o 6489  df-fv 6490  df-riota 7306  df-ov 7352  df-oprab 7353  df-mpo 7354  df-2nd 7925  df-frecs 8214  df-wrecs 8245  df-recs 8294  df-1o 8388  df-2o 8389  df-no 27552  df-slt 27553  df-bday 27554  df-sslt 27692  df-scut 27694  df-made 27757  df-old 27758  df-new 27759  df-left 27760  df-right 27761
This theorem is referenced by:  newbdayim  27817  sltonold  28167
  Copyright terms: Public domain W3C validator