| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > onles | Structured version Visualization version GIF version | ||
| Description: Less-than or equal is the same as non-strict birthday comparison over surreal ordinals. (Contributed by Scott Fenton, 25-Feb-2026.) |
| Ref | Expression |
|---|---|
| onles | ⊢ ((𝐴 ∈ Ons ∧ 𝐵 ∈ Ons) → (𝐴 ≤s 𝐵 ↔ ( bday ‘𝐴) ⊆ ( bday ‘𝐵))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | onlts 28440 | . . . 4 ⊢ ((𝐵 ∈ Ons ∧ 𝐴 ∈ Ons) → (𝐵 <s 𝐴 ↔ ( bday ‘𝐵) ∈ ( bday ‘𝐴))) | |
| 2 | 1 | ancoms 463 | . . 3 ⊢ ((𝐴 ∈ Ons ∧ 𝐵 ∈ Ons) → (𝐵 <s 𝐴 ↔ ( bday ‘𝐵) ∈ ( bday ‘𝐴))) |
| 3 | 2 | notbid 321 | . 2 ⊢ ((𝐴 ∈ Ons ∧ 𝐵 ∈ Ons) → (¬ 𝐵 <s 𝐴 ↔ ¬ ( bday ‘𝐵) ∈ ( bday ‘𝐴))) |
| 4 | onno 28428 | . . 3 ⊢ (𝐴 ∈ Ons → 𝐴 ∈ No ) | |
| 5 | onno 28428 | . . 3 ⊢ (𝐵 ∈ Ons → 𝐵 ∈ No ) | |
| 6 | lenlts 27896 | . . 3 ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ No ) → (𝐴 ≤s 𝐵 ↔ ¬ 𝐵 <s 𝐴)) | |
| 7 | 4, 5, 6 | syl2an 607 | . 2 ⊢ ((𝐴 ∈ Ons ∧ 𝐵 ∈ Ons) → (𝐴 ≤s 𝐵 ↔ ¬ 𝐵 <s 𝐴)) |
| 8 | bdayon 27925 | . . . 4 ⊢ ( bday ‘𝐴) ∈ On | |
| 9 | bdayon 27925 | . . . 4 ⊢ ( bday ‘𝐵) ∈ On | |
| 10 | ontri1 6399 | . . . 4 ⊢ ((( bday ‘𝐴) ∈ On ∧ ( bday ‘𝐵) ∈ On) → (( bday ‘𝐴) ⊆ ( bday ‘𝐵) ↔ ¬ ( bday ‘𝐵) ∈ ( bday ‘𝐴))) | |
| 11 | 8, 9, 10 | mp2an 704 | . . 3 ⊢ (( bday ‘𝐴) ⊆ ( bday ‘𝐵) ↔ ¬ ( bday ‘𝐵) ∈ ( bday ‘𝐴)) |
| 12 | 11 | a1i 11 | . 2 ⊢ ((𝐴 ∈ Ons ∧ 𝐵 ∈ Ons) → (( bday ‘𝐴) ⊆ ( bday ‘𝐵) ↔ ¬ ( bday ‘𝐵) ∈ ( bday ‘𝐴))) |
| 13 | 3, 7, 12 | 3bitr4d 314 | 1 ⊢ ((𝐴 ∈ Ons ∧ 𝐵 ∈ Ons) → (𝐴 ≤s 𝐵 ↔ ( bday ‘𝐴) ⊆ ( bday ‘𝐵))) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 400 ∈ wcel 2150 ⊆ wss 3913 class class class wbr 5114 Oncon0 6364 ‘cfv 6540 No csur 27784 <s clts 27785 bday cbday 27786 ≤s cles 27888 Onscons 28424 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1823 ax-4 1837 ax-5 1938 ax-6 1995 ax-7 2036 ax-8 2152 ax-9 2160 ax-10 2183 ax-11 2199 ax-12 2220 ax-ext 2742 ax-rep 5243 ax-sep 5262 ax-nul 5274 ax-pow 5340 ax-pr 5408 ax-un 7736 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1571 df-fal 1581 df-ex 1808 df-nf 1812 df-sb 2099 df-mo 2574 df-eu 2604 df-clab 2749 df-cleq 2762 df-clel 2845 df-nfc 2919 df-ne 2966 df-ral 3087 df-rex 3097 df-rmo 3376 df-reu 3377 df-rab 3424 df-v 3464 df-sbc 3753 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-pss 3933 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-tp 4599 df-op 4601 df-uni 4878 df-int 4918 df-iun 4963 df-br 5115 df-opab 5179 df-mpt 5198 df-tr 5224 df-id 5560 df-eprel 5565 df-po 5573 df-so 5574 df-fr 5618 df-we 5620 df-xp 5671 df-rel 5672 df-cnv 5673 df-co 5674 df-dm 5675 df-rn 5676 df-res 5677 df-ima 5678 df-pred 6306 df-ord 6367 df-on 6368 df-suc 6370 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-riota 7371 df-ov 7417 df-oprab 7418 df-mpo 7419 df-2nd 7990 df-frecs 8281 df-wrecs 8312 df-recs 8361 df-1o 8456 df-2o 8457 df-no 27787 df-lts 27788 df-bday 27789 df-les 27889 df-slts 27931 df-cuts 27933 df-made 28000 df-old 28001 df-left 28003 df-right 28004 df-ons 28425 |
| This theorem is referenced by: onlesd 28443 |
| Copyright terms: Public domain | W3C validator |