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

Theorem oldbday 28280
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 28268 . 2 (𝑋 ∈ ( O ‘𝐴) → ( bday ‘𝑋) ∈ 𝐴)
2 simpl 488 . . 3 ((𝐴 ∈ On ∧ 𝑋 ∈ No ) → 𝐴 ∈ On)
3 onelon 6386 . . . . . . 7 ((𝐴 ∈ On ∧ 𝑏 ∈ 𝐴) → 𝑏 ∈ On)
4 madebday 28279 . . . . . . . 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 3206 . . . 4 (𝐴 ∈ On → ∀𝑏 ∈ 𝐴 ∀𝑦 ∈ No (( bday ‘𝑦) ⊆ 𝑏 → 𝑦 ∈ ( M ‘𝑏)))
98adantr 486 . . 3 ((𝐴 ∈ On ∧ 𝑋 ∈ No ) → ∀𝑏 ∈ 𝐴 ∀𝑦 ∈ No (( bday ‘𝑦) ⊆ 𝑏 → 𝑦 ∈ ( M ‘𝑏)))
10 simpr 490 . . 3 ((𝐴 ∈ On ∧ 𝑋 ∈ No ) → 𝑋 ∈ No )
11 madebdaylemold 28277 . . 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 2145  ∀wral 3077   ⊆ wss 3899  Oncon0 6361  ‘cfv 6537   No csur 27990   bday cbday 27992   M cmade 28201   O cold 28202
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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7749
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 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-tp 4589  df-op 4591  df-uni 4868  df-int 4908  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  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 6303  df-ord 6364  df-on 6365  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-riota 7375  df-ov 7421  df-oprab 7422  df-mpo 7423  df-2nd 8000  df-frecs 8292  df-wrecs 8323  df-recs 8372  df-1o 8469  df-2o 8470  df-no 27993  df-lts 27994  df-bday 27995  df-slts 28137  df-cuts 28139  df-made 28206  df-old 28207  df-left 28209  df-right 28210
This theorem is used by:  newbday  28281  0elold  28289  cofcutr  28303  lrrecval2  28319  addsproplem2  28349  addsproplem4  28351  addsproplem5  28352  addsproplem6  28353  negsproplem4  28410  negsproplem5  28411  negsproplem6  28412  negleft  28437  negright  28438  mulsproplem12  28506  mulsproplem13  28507  mulsproplem14  28508  ltonold  28640  oncutlt  28643  onnolt  28645  onlts  28646  oniso  28650  n0ssoldg  28732  onsfi  28735  bdayfinbndlem1  28846  dfz12s2  28867
  Copyright terms: Public domain W3C validator