| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > onlts | Structured version Visualization version GIF version | ||
| Description: Less-than is the same as birthday comparison over surreal ordinals. (Contributed by Scott Fenton, 7-Nov-2025.) |
| Ref | Expression |
|---|---|
| onlts | ⊢ ((𝐴 ∈ Ons ∧ 𝐵 ∈ Ons) → (𝐴 <s 𝐵 ↔ ( bday ‘𝐴) ∈ ( bday ‘𝐵))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | onno 28429 | . . 3 ⊢ (𝐵 ∈ Ons → 𝐵 ∈ No ) | |
| 2 | onnolt 28440 | . . . 4 ⊢ ((𝐴 ∈ Ons ∧ 𝐵 ∈ No ∧ 𝐴 <s 𝐵) → ( bday ‘𝐴) ∈ ( bday ‘𝐵)) | |
| 3 | 2 | 3expia 1139 | . . 3 ⊢ ((𝐴 ∈ Ons ∧ 𝐵 ∈ No ) → (𝐴 <s 𝐵 → ( bday ‘𝐴) ∈ ( bday ‘𝐵))) |
| 4 | 1, 3 | sylan2 604 | . 2 ⊢ ((𝐴 ∈ Ons ∧ 𝐵 ∈ Ons) → (𝐴 <s 𝐵 → ( bday ‘𝐴) ∈ ( bday ‘𝐵))) |
| 5 | bdayon 27926 | . . . . 5 ⊢ ( bday ‘𝐵) ∈ On | |
| 6 | onno 28429 | . . . . . 6 ⊢ (𝐴 ∈ Ons → 𝐴 ∈ No ) | |
| 7 | 6 | adantr 485 | . . . . 5 ⊢ ((𝐴 ∈ Ons ∧ 𝐵 ∈ Ons) → 𝐴 ∈ No ) |
| 8 | oldbday 28075 | . . . . 5 ⊢ ((( bday ‘𝐵) ∈ On ∧ 𝐴 ∈ No ) → (𝐴 ∈ ( O ‘( bday ‘𝐵)) ↔ ( bday ‘𝐴) ∈ ( bday ‘𝐵))) | |
| 9 | 5, 7, 8 | sylancr 598 | . . . 4 ⊢ ((𝐴 ∈ Ons ∧ 𝐵 ∈ Ons) → (𝐴 ∈ ( O ‘( bday ‘𝐵)) ↔ ( bday ‘𝐴) ∈ ( bday ‘𝐵))) |
| 10 | onleft 28434 | . . . . . 6 ⊢ (𝐵 ∈ Ons → ( O ‘( bday ‘𝐵)) = ( L ‘𝐵)) | |
| 11 | 10 | eleq2d 2849 | . . . . 5 ⊢ (𝐵 ∈ Ons → (𝐴 ∈ ( O ‘( bday ‘𝐵)) ↔ 𝐴 ∈ ( L ‘𝐵))) |
| 12 | 11 | adantl 486 | . . . 4 ⊢ ((𝐴 ∈ Ons ∧ 𝐵 ∈ Ons) → (𝐴 ∈ ( O ‘( bday ‘𝐵)) ↔ 𝐴 ∈ ( L ‘𝐵))) |
| 13 | 9, 12 | bitr3d 284 | . . 3 ⊢ ((𝐴 ∈ Ons ∧ 𝐵 ∈ Ons) → (( bday ‘𝐴) ∈ ( bday ‘𝐵) ↔ 𝐴 ∈ ( L ‘𝐵))) |
| 14 | leftlt 28027 | . . 3 ⊢ (𝐴 ∈ ( L ‘𝐵) → 𝐴 <s 𝐵) | |
| 15 | 13, 14 | biimtrdi 256 | . 2 ⊢ ((𝐴 ∈ Ons ∧ 𝐵 ∈ Ons) → (( bday ‘𝐴) ∈ ( bday ‘𝐵) → 𝐴 <s 𝐵)) |
| 16 | 4, 15 | impbid 215 | 1 ⊢ ((𝐴 ∈ Ons ∧ 𝐵 ∈ Ons) → (𝐴 <s 𝐵 ↔ ( bday ‘𝐴) ∈ ( bday ‘𝐵))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 ∈ wcel 2143 class class class wbr 5110 Oncon0 6362 ‘cfv 6538 No csur 27785 <s clts 27786 bday cbday 27787 O cold 27997 L cleft 27999 Onscons 28425 |
| 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 5239 ax-sep 5258 ax-nul 5270 ax-pow 5338 ax-pr 5406 ax-un 7734 |
| 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 3746 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4288 df-if 4489 df-pw 4565 df-sn 4591 df-pr 4593 df-tp 4595 df-op 4597 df-uni 4874 df-int 4914 df-iun 4959 df-br 5111 df-opab 5175 df-mpt 5194 df-tr 5220 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-pred 6304 df-ord 6365 df-on 6366 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-2nd 7988 df-frecs 8279 df-wrecs 8310 df-recs 8359 df-1o 8454 df-2o 8455 df-no 27788 df-lts 27789 df-bday 27790 df-les 27890 df-slts 27932 df-cuts 27934 df-made 28001 df-old 28002 df-left 28004 df-right 28005 df-ons 28426 |
| This theorem is referenced by: onles 28442 onltsd 28443 oniso 28445 bdayons 28450 addonbday 28453 onltn0s 28532 bdaypw2bnd 28639 |
| Copyright terms: Public domain | W3C validator |