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

Theorem onnolt 28711
Description: If a surreal ordinal is less than a given surreal, then it is simpler. (Contributed by Scott Fenton, 7-Nov-2025.)
Assertion
Ref Expression
onnolt ((𝐴 ∈ Ons ∧ 𝐵 ∈ No ∧ 𝐴 <s 𝐵) → (bday‘𝐴) ∈ (bday‘𝐵))

Proof of Theorem onnolt
StepHypRef Expression
1 simplr 781 . . . . . . 7 (((𝐴 ∈ Ons ∧ 𝐵 ∈ No) ∧ (bday‘𝐵) ∈ (bday‘𝐴)) → 𝐵 ∈ No)
2 onno 28700 . . . . . . . . 9 (𝐴 ∈ Ons → 𝐴 ∈ No)
32adantr 486 . . . . . . . 8 ((𝐴 ∈ Ons ∧ 𝐵 ∈ No) → 𝐴 ∈ No)
43adantr 486 . . . . . . 7 (((𝐴 ∈ Ons ∧ 𝐵 ∈ No) ∧ (bday‘𝐵) ∈ (bday‘𝐴)) → 𝐴 ∈ No)
5 bdayon 28197 . . . . . . . . . . 11 (bday‘𝐴) ∈ On
6 simpr 490 . . . . . . . . . . 11 ((𝐴 ∈ Ons ∧ 𝐵 ∈ No) → 𝐵 ∈ No)
7 oldbday 28346 . . . . . . . . . . 11 (((bday‘𝐴) ∈ On ∧ 𝐵 ∈ No) → (𝐵 ∈ (O‘(bday‘𝐴)) ↔ (bday‘𝐵) ∈ (bday‘𝐴)))
85, 6, 7sylancr 599 . . . . . . . . . 10 ((𝐴 ∈ Ons ∧ 𝐵 ∈ No) → (𝐵 ∈ (O‘(bday‘𝐴)) ↔ (bday‘𝐵) ∈ (bday‘𝐴)))
9 onleft 28705 . . . . . . . . . . . 12 (𝐴 ∈ Ons → (O‘(bday‘𝐴)) = (L‘𝐴))
109eleq2d 2853 . . . . . . . . . . 11 (𝐴 ∈ Ons → (𝐵 ∈ (O‘(bday‘𝐴)) ↔ 𝐵 ∈ (L‘𝐴)))
1110adantr 486 . . . . . . . . . 10 ((𝐴 ∈ Ons ∧ 𝐵 ∈ No) → (𝐵 ∈ (O‘(bday‘𝐴)) ↔ 𝐵 ∈ (L‘𝐴)))
128, 11bitr3d 284 . . . . . . . . 9 ((𝐴 ∈ Ons ∧ 𝐵 ∈ No) → ((bday‘𝐵) ∈ (bday‘𝐴) ↔ 𝐵 ∈ (L‘𝐴)))
13 leftlt 28298 . . . . . . . . 9 (𝐵 ∈ (L‘𝐴) → 𝐵 <s 𝐴)
1412, 13biimtrdi 256 . . . . . . . 8 ((𝐴 ∈ Ons ∧ 𝐵 ∈ No) → ((bday‘𝐵) ∈ (bday‘𝐴) → 𝐵 <s 𝐴))
1514imp 412 . . . . . . 7 (((𝐴 ∈ Ons ∧ 𝐵 ∈ No) ∧ (bday‘𝐵) ∈ (bday‘𝐴)) → 𝐵 <s 𝐴)
161, 4, 15ltlesd 28189 . . . . . 6 (((𝐴 ∈ Ons ∧ 𝐵 ∈ No) ∧ (bday‘𝐵) ∈ (bday‘𝐴)) → 𝐵 ≤s 𝐴)
1716ex 418 . . . . 5 ((𝐴 ∈ Ons ∧ 𝐵 ∈ No) → ((bday‘𝐵) ∈ (bday‘𝐴) → 𝐵 ≤s 𝐴))
18 leftssold 28316 . . . . . . . 8 (L‘𝐵) ⊆ (O‘(bday‘𝐵))
19 fveq2 6915 . . . . . . . . . 10 ((bday‘𝐵) = (bday‘𝐴) → (O‘(bday‘𝐵)) = (O‘(bday‘𝐴)))
20193ad2ant3 1154 . . . . . . . . 9 ((𝐴 ∈ Ons ∧ 𝐵 ∈ No ∧ (bday‘𝐵) = (bday‘𝐴)) → (O‘(bday‘𝐵)) = (O‘(bday‘𝐴)))
2193ad2ant1 1152 . . . . . . . . 9 ((𝐴 ∈ Ons ∧ 𝐵 ∈ No ∧ (bday‘𝐵) = (bday‘𝐴)) → (O‘(bday‘𝐴)) = (L‘𝐴))
2220, 21eqtrd 2801 . . . . . . . 8 ((𝐴 ∈ Ons ∧ 𝐵 ∈ No ∧ (bday‘𝐵) = (bday‘𝐴)) → (O‘(bday‘𝐵)) = (L‘𝐴))
2318, 22sseqtrid 3954 . . . . . . 7 ((𝐴 ∈ Ons ∧ 𝐵 ∈ No ∧ (bday‘𝐵) = (bday‘𝐴)) → (L‘𝐵) ⊆ (L‘𝐴))
24 simp2 1156 . . . . . . . 8 ((𝐴 ∈ Ons ∧ 𝐵 ∈ No ∧ (bday‘𝐵) = (bday‘𝐴)) → 𝐵 ∈ No)
2523ad2ant1 1152 . . . . . . . 8 ((𝐴 ∈ Ons ∧ 𝐵 ∈ No ∧ (bday‘𝐵) = (bday‘𝐴)) → 𝐴 ∈ No)
26 simp3 1157 . . . . . . . 8 ((𝐴 ∈ Ons ∧ 𝐵 ∈ No ∧ (bday‘𝐵) = (bday‘𝐴)) → (bday‘𝐵) = (bday‘𝐴))
27 leslss 28354 . . . . . . . 8 ((𝐵 ∈ No ∧ 𝐴 ∈ No ∧ (bday‘𝐵) = (bday‘𝐴)) → (𝐵 ≤s 𝐴 ↔ (L‘𝐵) ⊆ (L‘𝐴)))
2824, 25, 26, 27syl3anc 1401 . . . . . . 7 ((𝐴 ∈ Ons ∧ 𝐵 ∈ No ∧ (bday‘𝐵) = (bday‘𝐴)) → (𝐵 ≤s 𝐴 ↔ (L‘𝐵) ⊆ (L‘𝐴)))
2923, 28mpbird 260 . . . . . 6 ((𝐴 ∈ Ons ∧ 𝐵 ∈ No ∧ (bday‘𝐵) = (bday‘𝐴)) → 𝐵 ≤s 𝐴)
30293expia 1140 . . . . 5 ((𝐴 ∈ Ons ∧ 𝐵 ∈ No) → ((bday‘𝐵) = (bday‘𝐴) → 𝐵 ≤s 𝐴))
3117, 30jaod 873 . . . 4 ((𝐴 ∈ Ons ∧ 𝐵 ∈ No) → (((bday‘𝐵) ∈ (bday‘𝐴) ∨ (bday‘𝐵) = (bday‘𝐴)) → 𝐵 ≤s 𝐴))
32 bdayon 28197 . . . . . . 7 (bday‘𝐵) ∈ On
3332, 5onsseli 6510 . . . . . 6 ((bday‘𝐵) ⊆ (bday‘𝐴) ↔ ((bday‘𝐵) ∈ (bday‘𝐴) ∨ (bday‘𝐵) = (bday‘𝐴)))
34 ontri1 6422 . . . . . . 7 (((bday‘𝐵) ∈ On ∧ (bday‘𝐴) ∈ On) → ((bday‘𝐵) ⊆ (bday‘𝐴) ↔ ¬ (bday‘𝐴) ∈ (bday‘𝐵)))
3532, 5, 34mp2an 705 . . . . . 6 ((bday‘𝐵) ⊆ (bday‘𝐴) ↔ ¬ (bday‘𝐴) ∈ (bday‘𝐵))
3633, 35bitr3i 280 . . . . 5 (((bday‘𝐵) ∈ (bday‘𝐴) ∨ (bday‘𝐵) = (bday‘𝐴)) ↔ ¬ (bday‘𝐴) ∈ (bday‘𝐵))
3736a1i 11 . . . 4 ((𝐴 ∈ Ons ∧ 𝐵 ∈ No) → (((bday‘𝐵) ∈ (bday‘𝐴) ∨ (bday‘𝐵) = (bday‘𝐴)) ↔ ¬ (bday‘𝐴) ∈ (bday‘𝐵)))
38 lenlts 28168 . . . . 5 ((𝐵 ∈ No ∧ 𝐴 ∈ No) → (𝐵 ≤s 𝐴 ↔ ¬ 𝐴 <s 𝐵))
396, 3, 38syl2anc 596 . . . 4 ((𝐴 ∈ Ons ∧ 𝐵 ∈ No) → (𝐵 ≤s 𝐴 ↔ ¬ 𝐴 <s 𝐵))
4031, 37, 393imtr3d 296 . . 3 ((𝐴 ∈ Ons ∧ 𝐵 ∈ No) → (¬ (bday‘𝐴) ∈ (bday‘𝐵) → ¬ 𝐴 <s 𝐵))
4140con4d 116 . 2 ((𝐴 ∈ Ons ∧ 𝐵 ∈ No) → (𝐴 <s 𝐵 → (bday‘𝐴) ∈ (bday‘𝐵)))
42413impia 1136 1 ((𝐴 ∈ Ons ∧ 𝐵 ∈ No ∧ 𝐴 <s 𝐵) → (bday‘𝐴) ∈ (bday‘𝐵))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∨ wo 861   ∧ w3a 1104   = wceq 1572   ∈ wcel 2150   ⊆ wss 3899   class class class wbr 5107  Oncon0 6387  ‘cfv 6565  Nocsur 28056   <s clts 28057  bdaycbday 28058   ≤s cles 28160  Ocold 28268  Lcleft 28270  Onscons 28696
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-10 2183  ax-11 2200  ax-12 2219  ax-ext 2738  ax-rep 5237  ax-sep 5254  ax-nul 5265  ax-pow 5333  ax-pr 5397  ax-un 7782
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1105  df-3an 1106  df-tru 1575  df-fal 1585  df-ex 1815  df-nf 1819  df-sb 2104  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2842  df-nfc 2916  df-ne 2963  df-ral 3084  df-rex 3094  df-rmo 3368  df-reu 3369  df-rab 3416  df-v 3455  df-sbc 3742  df-csb 3851  df-ss 3900  df-pss 4016  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-tp 4592  df-op 4840  df-uni 4872  df-int 4912  df-iun 4957  df-br 5108  df-opab 5173  df-mpt 5192  df-tr 5218  df-id 5552  df-eprel 5557  df-po 5565  df-so 5566  df-fr 5610  df-we 5612  df-xp 5663  df-rel 5664  df-cnv 5665  df-co 5666  df-dm 5667  df-rn 5668  df-res 5669  df-ima 5670  df-pred 6329  df-ord 6390  df-on 6391  df-suc 6393  df-iota 6519  df-fun 6567  df-fn 6568  df-f 6569  df-f1 6570  df-fo 6571  df-f1o 6572  df-fv 6573  df-riota 7407  df-ov 7453  df-oprab 7454  df-mpo 7455  df-2nd 8035  df-frecs 8336  df-wrecs 8367  df-recs 8416  df-1o 8513  df-2o 8514  df-no 28059  df-lts 28060  df-bday 28061  df-les 28161  df-slts 28203  df-cuts 28205  df-made 28272  df-old 28273  df-left 28275  df-right 28276  df-ons 28697
This theorem is used by:  onlts  28712  bdayn0p1  28814
  Copyright terms: Public domain W3C validator