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

Theorem oldbday 28296
Description: A surreal is part of the set older than ordinal 𝐴 iff its birthday is less than 𝐴. Remark in [Conway] p. 29. (Contributed by Scott Fenton, 19-Aug-2024.)
Assertion
Ref Expression
oldbday ((𝐴 ∈ On ∧ 𝑋 ∈ No) → (𝑋 ∈ (O‘𝐴) ↔ (bday‘𝑋) ∈ 𝐴))

Proof of Theorem oldbday
Dummy variables 𝑏 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 oldbdayim 28284 . 2 (𝑋 ∈ (O‘𝐴) → (bday‘𝑋) ∈ 𝐴)
2 simpl 488 . . 3 ((𝐴 ∈ On ∧ 𝑋 ∈ No) → 𝐴 ∈ On)
3 onelon 6390 . . . . . . 7 ((𝐴 ∈ On ∧ 𝑏 ∈ 𝐴) → 𝑏 ∈ On)
4 madebday 28295 . . . . . . . 8 ((𝑏 ∈ On ∧ 𝑦 ∈ No) → (𝑦 ∈ (M‘𝑏) ↔ (bday‘𝑦) ⊆ 𝑏))
54biimprd 251 . . . . . . 7 ((𝑏 ∈ On ∧ 𝑦 ∈ No) → ((bday‘𝑦) ⊆ 𝑏 → 𝑦 ∈ (M‘𝑏)))
63, 5sylan 592 . . . . . 6 (((𝐴 ∈ On ∧ 𝑏 ∈ 𝐴) ∧ 𝑦 ∈ No) → ((bday‘𝑦) ⊆ 𝑏 → 𝑦 ∈ (M‘𝑏)))
76anasss 472 . . . . 5 ((𝐴 ∈ On ∧ (𝑏 ∈ 𝐴 ∧ 𝑦 ∈ No)) → ((bday‘𝑦) ⊆ 𝑏 → 𝑦 ∈ (M‘𝑏)))
87ralrimivva 3205 . . . 4 (𝐴 ∈ On → ∀𝑏 ∈ 𝐴 ∀𝑦 ∈ No ((bday‘𝑦) ⊆ 𝑏 → 𝑦 ∈ (M‘𝑏)))
98adantr 486 . . 3 ((𝐴 ∈ On ∧ 𝑋 ∈ No) → ∀𝑏 ∈ 𝐴 ∀𝑦 ∈ No ((bday‘𝑦) ⊆ 𝑏 → 𝑦 ∈ (M‘𝑏)))
10 simpr 490 . . 3 ((𝐴 ∈ On ∧ 𝑋 ∈ No) → 𝑋 ∈ No)
11 madebdaylemold 28293 . . 3 ((𝐴 ∈ On ∧ ∀𝑏 ∈ 𝐴 ∀𝑦 ∈ No ((bday‘𝑦) ⊆ 𝑏 → 𝑦 ∈ (M‘𝑏)) ∧ 𝑋 ∈ No) → ((bday‘𝑋) ∈ 𝐴 → 𝑋 ∈ (O‘𝐴)))
122, 9, 10, 11syl3anc 1398 . 2 ((𝐴 ∈ On ∧ 𝑋 ∈ No) → ((bday‘𝑋) ∈ 𝐴 → 𝑋 ∈ (O‘𝐴)))
131, 12impbid2 229 1 ((𝐴 ∈ On ∧ 𝑋 ∈ No) → (𝑋 ∈ (O‘𝐴) ↔ (bday‘𝑋) ∈ 𝐴))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∈ wcel 2144  ∀wral 3076   ⊆ wss 3896  Oncon0 6365  ‘cfv 6543  Nocsur 28006  bdaycbday 28008  Mcmade 28217  Ocold 28218
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5327  ax-pr 5391  ax-un 7755
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3848  df-ss 3897  df-pss 4013  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-tp 4589  df-op 4835  df-uni 4867  df-int 4907  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-pred 6307  df-ord 6368  df-on 6369  df-suc 6371  df-iota 6497  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-riota 7381  df-ov 7427  df-oprab 7428  df-mpo 7429  df-2nd 8006  df-frecs 8306  df-wrecs 8337  df-recs 8386  df-1o 8483  df-2o 8484  df-no 28009  df-lts 28010  df-bday 28011  df-slts 28153  df-cuts 28155  df-made 28222  df-old 28223  df-left 28225  df-right 28226
This theorem is used by:  newbday  28297  0elold  28305  cofcutr  28319  lrrecval2  28335  addsproplem2  28365  addsproplem4  28367  addsproplem5  28368  addsproplem6  28369  negsproplem4  28426  negsproplem5  28427  negsproplem6  28428  negleft  28453  negright  28454  mulsproplem12  28522  mulsproplem13  28523  mulsproplem14  28524  ltonold  28656  oncutlt  28659  onnolt  28661  onlts  28662  oniso  28666  n0ssoldg  28748  onsfi  28751  bdayfinbndlem1  28862  dfz12s2  28883
  Copyright terms: Public domain W3C validator