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

Theorem oldbday 28288
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 28276 . 2 (𝑋 ∈ (O‘𝐴) → (bday‘𝑋) ∈ 𝐴)
2 simpl 488 . . 3 ((𝐴 ∈ On ∧ 𝑋 ∈ No) → 𝐴 ∈ On)
3 onelon 6388 . . . . . . 7 ((𝐴 ∈ On ∧ 𝑏 ∈ 𝐴) → 𝑏 ∈ On)
4 madebday 28287 . . . . . . . 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 28285 . . 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 3914  Oncon0 6363  ‘cfv 6539  Nocsur 27998  bdaycbday 28000  Mcmade 28209  Ocold 28210
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 7752
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 3900  df-un 3902  df-in 3904  df-ss 3915  df-pss 4035  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 6305  df-ord 6366  df-on 6367  df-suc 6369  df-iota 6495  df-fun 6541  df-fn 6542  df-f 6543  df-f1 6544  df-fo 6545  df-f1o 6546  df-fv 6547  df-riota 7378  df-ov 7424  df-oprab 7425  df-mpo 7426  df-2nd 8003  df-frecs 8300  df-wrecs 8331  df-recs 8380  df-1o 8477  df-2o 8478  df-no 28001  df-lts 28002  df-bday 28003  df-slts 28145  df-cuts 28147  df-made 28214  df-old 28215  df-left 28217  df-right 28218
This theorem is used by:  newbday  28289  0elold  28297  cofcutr  28311  lrrecval2  28327  addsproplem2  28357  addsproplem4  28359  addsproplem5  28360  addsproplem6  28361  negsproplem4  28418  negsproplem5  28419  negsproplem6  28420  negleft  28445  negright  28446  mulsproplem12  28514  mulsproplem13  28515  mulsproplem14  28516  ltonold  28648  oncutlt  28651  onnolt  28653  onlts  28654  oniso  28658  n0ssoldg  28740  onsfi  28743  bdayfinbndlem1  28854  dfz12s2  28875
  Copyright terms: Public domain W3C validator