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

Theorem newbday 28095
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 28093 . . 3 ((𝐴 ∈ On ∧ 𝑋 No ) → (𝑋 ∈ ( M ‘𝐴) ↔ ( bday 𝑋) ⊆ 𝐴))
2 oldbday 28094 . . . 4 ((𝐴 ∈ On ∧ 𝑋 No ) → (𝑋 ∈ ( O ‘𝐴) ↔ ( bday 𝑋) ∈ 𝐴))
32notbid 321 . . 3 ((𝐴 ∈ On ∧ 𝑋 No ) → (¬ 𝑋 ∈ ( O ‘𝐴) ↔ ¬ ( bday 𝑋) ∈ 𝐴))
41, 3anbi12d 643 . 2 ((𝐴 ∈ On ∧ 𝑋 No ) → ((𝑋 ∈ ( M ‘𝐴) ∧ ¬ 𝑋 ∈ ( O ‘𝐴)) ↔ (( bday 𝑋) ⊆ 𝐴 ∧ ¬ ( bday 𝑋) ∈ 𝐴)))
5 newval 28028 . . . . . 6 ( N ‘𝐴) = (( M ‘𝐴) ∖ ( O ‘𝐴))
65a1i 11 . . . . 5 (𝐴 ∈ On → ( N ‘𝐴) = (( M ‘𝐴) ∖ ( O ‘𝐴)))
76eleq2d 2849 . . . 4 (𝐴 ∈ On → (𝑋 ∈ ( N ‘𝐴) ↔ 𝑋 ∈ (( M ‘𝐴) ∖ ( O ‘𝐴))))
8 eldif 3915 . . . 4 (𝑋 ∈ (( M ‘𝐴) ∖ ( O ‘𝐴)) ↔ (𝑋 ∈ ( M ‘𝐴) ∧ ¬ 𝑋 ∈ ( O ‘𝐴)))
97, 8bitrdi 290 . . 3 (𝐴 ∈ On → (𝑋 ∈ ( N ‘𝐴) ↔ (𝑋 ∈ ( M ‘𝐴) ∧ ¬ 𝑋 ∈ ( O ‘𝐴))))
109adantr 485 . 2 ((𝐴 ∈ On ∧ 𝑋 No ) → (𝑋 ∈ ( N ‘𝐴) ↔ (𝑋 ∈ ( M ‘𝐴) ∧ ¬ 𝑋 ∈ ( O ‘𝐴))))
11 bdayon 27945 . . . . 5 ( bday 𝑋) ∈ On
1211onordi 6474 . . . 4 Ord ( bday 𝑋)
13 eloni 6370 . . . 4 (𝐴 ∈ On → Ord 𝐴)
14 ordtri4 6398 . . . 4 ((Ord ( bday 𝑋) ∧ Ord 𝐴) → (( bday 𝑋) = 𝐴 ↔ (( bday 𝑋) ⊆ 𝐴 ∧ ¬ ( bday 𝑋) ∈ 𝐴)))
1512, 13, 14sylancr 598 . . 3 (𝐴 ∈ On → (( bday 𝑋) = 𝐴 ↔ (( bday 𝑋) ⊆ 𝐴 ∧ ¬ ( bday 𝑋) ∈ 𝐴)))
1615adantr 485 . 2 ((𝐴 ∈ On ∧ 𝑋 No ) → (( bday 𝑋) = 𝐴 ↔ (( bday 𝑋) ⊆ 𝐴 ∧ ¬ ( bday 𝑋) ∈ 𝐴)))
174, 10, 163bitr4d 314 1 ((𝐴 ∈ On ∧ 𝑋 No ) → (𝑋 ∈ ( N ‘𝐴) ↔ ( bday 𝑋) = 𝐴))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 209  wa 400   = wceq 1570  wcel 2143  cdif 3902  wss 3905  Ord word 6359  Oncon0 6360  cfv 6536   No csur 27804   bday cbday 27806   M cmade 28015   O cold 28016   N cnew 28017
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-rep 5238  ax-sep 5257  ax-nul 5269  ax-pow 5336  ax-pr 5404  ax-un 7732
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-pss 3925  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-tp 4594  df-op 4596  df-uni 4873  df-int 4913  df-iun 4958  df-br 5110  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5556  df-eprel 5561  df-po 5569  df-so 5570  df-fr 5614  df-we 5616  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-pred 6302  df-ord 6363  df-on 6364  df-suc 6366  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-riota 7367  df-ov 7413  df-oprab 7414  df-mpo 7415  df-2nd 7983  df-frecs 8274  df-wrecs 8305  df-recs 8354  df-1o 8449  df-2o 8450  df-no 27807  df-lts 27808  df-bday 27809  df-slts 27951  df-cuts 27953  df-made 28020  df-old 28021  df-new 28022  df-left 28023  df-right 28024
This theorem is referenced by:  newbdayim  28096  ltonold  28454
  Copyright terms: Public domain W3C validator