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

Theorem nosupinfsep 27471
Description: Given two sets of surreals, a surreal 𝑊 separates them iff its restriction to the maximum of dom 𝑆 and dom 𝑇 separates them. Corollary 4.4 of [Lipparini] p. 7. (Contributed by Scott Fenton, 9-Aug-2024.)
Hypotheses
Ref Expression
nosupinfsep.1 𝑆 = if(∃𝑥𝐴𝑦𝐴 ¬ 𝑥 <s 𝑦, ((𝑥𝐴𝑦𝐴 ¬ 𝑥 <s 𝑦) ∪ {⟨dom (𝑥𝐴𝑦𝐴 ¬ 𝑥 <s 𝑦), 2o⟩}), (𝑔 ∈ {𝑦 ∣ ∃𝑢𝐴 (𝑦 ∈ dom 𝑢 ∧ ∀𝑣𝐴𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑦) = (𝑣 ↾ suc 𝑦)))} ↦ (℩𝑥𝑢𝐴 (𝑔 ∈ dom 𝑢 ∧ ∀𝑣𝐴𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑔) = (𝑣 ↾ suc 𝑔)) ∧ (𝑢𝑔) = 𝑥))))
nosupinfsep.2 𝑇 = if(∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥, ((𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥) ∪ {⟨dom (𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥), 1o⟩}), (𝑔 ∈ {𝑦 ∣ ∃𝑢𝐵 (𝑦 ∈ dom 𝑢 ∧ ∀𝑣𝐵𝑢 <s 𝑣 → (𝑢 ↾ suc 𝑦) = (𝑣 ↾ suc 𝑦)))} ↦ (℩𝑥𝑢𝐵 (𝑔 ∈ dom 𝑢 ∧ ∀𝑣𝐵𝑢 <s 𝑣 → (𝑢 ↾ suc 𝑔) = (𝑣 ↾ suc 𝑔)) ∧ (𝑢𝑔) = 𝑥))))
Assertion
Ref Expression
nosupinfsep (((𝐴 No 𝐴 ∈ V) ∧ (𝐵 No 𝐵 ∈ V) ∧ 𝑊 No ) → ((∀𝑎𝐴 𝑎 <s 𝑊 ∧ ∀𝑏𝐵 𝑊 <s 𝑏) ↔ (∀𝑎𝐴 𝑎 <s (𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) ∧ ∀𝑏𝐵 (𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) <s 𝑏)))
Distinct variable groups:   𝐴,𝑎,𝑔,𝑢,𝑣,𝑥,𝑦   𝐵,𝑏,𝑔   𝑢,𝐵   𝑣,𝑏,𝐵,𝑥,𝑦   𝑢,𝑔,𝑣,𝑥,𝑦   𝑆,𝑎   𝑆,𝑏,𝑔,𝑥   𝑇,𝑎   𝑇,𝑏,𝑔,𝑥   𝑣,𝑢,𝑥,𝑦   𝑊,𝑎   𝑊,𝑏,𝑔,𝑥   𝑥,𝑦
Allowed substitution hints:   𝐴(𝑏)   𝐵(𝑎)   𝑆(𝑦,𝑣,𝑢)   𝑇(𝑦,𝑣,𝑢)   𝑊(𝑦,𝑣,𝑢)

Proof of Theorem nosupinfsep
StepHypRef Expression
1 ssun1 4171 . . . . . . . 8 dom 𝑆 ⊆ (dom 𝑆 ∪ dom 𝑇)
2 resabs1 6010 . . . . . . . 8 (dom 𝑆 ⊆ (dom 𝑆 ∪ dom 𝑇) → ((𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) ↾ dom 𝑆) = (𝑊 ↾ dom 𝑆))
31, 2ax-mp 5 . . . . . . 7 ((𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) ↾ dom 𝑆) = (𝑊 ↾ dom 𝑆)
43breq1i 5154 . . . . . 6 (((𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) ↾ dom 𝑆) <s 𝑆 ↔ (𝑊 ↾ dom 𝑆) <s 𝑆)
54notbii 319 . . . . 5 (¬ ((𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) ↾ dom 𝑆) <s 𝑆 ↔ ¬ (𝑊 ↾ dom 𝑆) <s 𝑆)
6 ssun2 4172 . . . . . . . 8 dom 𝑇 ⊆ (dom 𝑆 ∪ dom 𝑇)
7 resabs1 6010 . . . . . . . 8 (dom 𝑇 ⊆ (dom 𝑆 ∪ dom 𝑇) → ((𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) ↾ dom 𝑇) = (𝑊 ↾ dom 𝑇))
86, 7ax-mp 5 . . . . . . 7 ((𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) ↾ dom 𝑇) = (𝑊 ↾ dom 𝑇)
98breq2i 5155 . . . . . 6 (𝑇 <s ((𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) ↾ dom 𝑇) ↔ 𝑇 <s (𝑊 ↾ dom 𝑇))
109notbii 319 . . . . 5 𝑇 <s ((𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) ↾ dom 𝑇) ↔ ¬ 𝑇 <s (𝑊 ↾ dom 𝑇))
115, 10anbi12i 625 . . . 4 ((¬ ((𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) ↾ dom 𝑆) <s 𝑆 ∧ ¬ 𝑇 <s ((𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) ↾ dom 𝑇)) ↔ (¬ (𝑊 ↾ dom 𝑆) <s 𝑆 ∧ ¬ 𝑇 <s (𝑊 ↾ dom 𝑇)))
1211bicomi 223 . . 3 ((¬ (𝑊 ↾ dom 𝑆) <s 𝑆 ∧ ¬ 𝑇 <s (𝑊 ↾ dom 𝑇)) ↔ (¬ ((𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) ↾ dom 𝑆) <s 𝑆 ∧ ¬ 𝑇 <s ((𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) ↾ dom 𝑇)))
1312a1i 11 . 2 (((𝐴 No 𝐴 ∈ V) ∧ (𝐵 No 𝐵 ∈ V) ∧ 𝑊 No ) → ((¬ (𝑊 ↾ dom 𝑆) <s 𝑆 ∧ ¬ 𝑇 <s (𝑊 ↾ dom 𝑇)) ↔ (¬ ((𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) ↾ dom 𝑆) <s 𝑆 ∧ ¬ 𝑇 <s ((𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) ↾ dom 𝑇))))
14 simp1l 1195 . . . 4 (((𝐴 No 𝐴 ∈ V) ∧ (𝐵 No 𝐵 ∈ V) ∧ 𝑊 No ) → 𝐴 No )
15 simp1r 1196 . . . 4 (((𝐴 No 𝐴 ∈ V) ∧ (𝐵 No 𝐵 ∈ V) ∧ 𝑊 No ) → 𝐴 ∈ V)
16 simp3 1136 . . . 4 (((𝐴 No 𝐴 ∈ V) ∧ (𝐵 No 𝐵 ∈ V) ∧ 𝑊 No ) → 𝑊 No )
17 nosupinfsep.1 . . . . 5 𝑆 = if(∃𝑥𝐴𝑦𝐴 ¬ 𝑥 <s 𝑦, ((𝑥𝐴𝑦𝐴 ¬ 𝑥 <s 𝑦) ∪ {⟨dom (𝑥𝐴𝑦𝐴 ¬ 𝑥 <s 𝑦), 2o⟩}), (𝑔 ∈ {𝑦 ∣ ∃𝑢𝐴 (𝑦 ∈ dom 𝑢 ∧ ∀𝑣𝐴𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑦) = (𝑣 ↾ suc 𝑦)))} ↦ (℩𝑥𝑢𝐴 (𝑔 ∈ dom 𝑢 ∧ ∀𝑣𝐴𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑔) = (𝑣 ↾ suc 𝑔)) ∧ (𝑢𝑔) = 𝑥))))
1817nosupbnd2 27455 . . . 4 ((𝐴 No 𝐴 ∈ V ∧ 𝑊 No ) → (∀𝑎𝐴 𝑎 <s 𝑊 ↔ ¬ (𝑊 ↾ dom 𝑆) <s 𝑆))
1914, 15, 16, 18syl3anc 1369 . . 3 (((𝐴 No 𝐴 ∈ V) ∧ (𝐵 No 𝐵 ∈ V) ∧ 𝑊 No ) → (∀𝑎𝐴 𝑎 <s 𝑊 ↔ ¬ (𝑊 ↾ dom 𝑆) <s 𝑆))
20 simp2l 1197 . . . 4 (((𝐴 No 𝐴 ∈ V) ∧ (𝐵 No 𝐵 ∈ V) ∧ 𝑊 No ) → 𝐵 No )
21 simp2r 1198 . . . 4 (((𝐴 No 𝐴 ∈ V) ∧ (𝐵 No 𝐵 ∈ V) ∧ 𝑊 No ) → 𝐵 ∈ V)
22 nosupinfsep.2 . . . . 5 𝑇 = if(∃𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥, ((𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥) ∪ {⟨dom (𝑥𝐵𝑦𝐵 ¬ 𝑦 <s 𝑥), 1o⟩}), (𝑔 ∈ {𝑦 ∣ ∃𝑢𝐵 (𝑦 ∈ dom 𝑢 ∧ ∀𝑣𝐵𝑢 <s 𝑣 → (𝑢 ↾ suc 𝑦) = (𝑣 ↾ suc 𝑦)))} ↦ (℩𝑥𝑢𝐵 (𝑔 ∈ dom 𝑢 ∧ ∀𝑣𝐵𝑢 <s 𝑣 → (𝑢 ↾ suc 𝑔) = (𝑣 ↾ suc 𝑔)) ∧ (𝑢𝑔) = 𝑥))))
2322noinfbnd2 27470 . . . 4 ((𝐵 No 𝐵 ∈ V ∧ 𝑊 No ) → (∀𝑏𝐵 𝑊 <s 𝑏 ↔ ¬ 𝑇 <s (𝑊 ↾ dom 𝑇)))
2420, 21, 16, 23syl3anc 1369 . . 3 (((𝐴 No 𝐴 ∈ V) ∧ (𝐵 No 𝐵 ∈ V) ∧ 𝑊 No ) → (∀𝑏𝐵 𝑊 <s 𝑏 ↔ ¬ 𝑇 <s (𝑊 ↾ dom 𝑇)))
2519, 24anbi12d 629 . 2 (((𝐴 No 𝐴 ∈ V) ∧ (𝐵 No 𝐵 ∈ V) ∧ 𝑊 No ) → ((∀𝑎𝐴 𝑎 <s 𝑊 ∧ ∀𝑏𝐵 𝑊 <s 𝑏) ↔ (¬ (𝑊 ↾ dom 𝑆) <s 𝑆 ∧ ¬ 𝑇 <s (𝑊 ↾ dom 𝑇))))
2617nosupno 27442 . . . . . . . 8 ((𝐴 No 𝐴 ∈ V) → 𝑆 No )
27 nodmon 27389 . . . . . . . 8 (𝑆 No → dom 𝑆 ∈ On)
2826, 27syl 17 . . . . . . 7 ((𝐴 No 𝐴 ∈ V) → dom 𝑆 ∈ On)
29283ad2ant1 1131 . . . . . 6 (((𝐴 No 𝐴 ∈ V) ∧ (𝐵 No 𝐵 ∈ V) ∧ 𝑊 No ) → dom 𝑆 ∈ On)
3022noinfno 27457 . . . . . . . 8 ((𝐵 No 𝐵 ∈ V) → 𝑇 No )
31 nodmon 27389 . . . . . . . 8 (𝑇 No → dom 𝑇 ∈ On)
3230, 31syl 17 . . . . . . 7 ((𝐵 No 𝐵 ∈ V) → dom 𝑇 ∈ On)
33323ad2ant2 1132 . . . . . 6 (((𝐴 No 𝐴 ∈ V) ∧ (𝐵 No 𝐵 ∈ V) ∧ 𝑊 No ) → dom 𝑇 ∈ On)
34 onun2 6471 . . . . . 6 ((dom 𝑆 ∈ On ∧ dom 𝑇 ∈ On) → (dom 𝑆 ∪ dom 𝑇) ∈ On)
3529, 33, 34syl2anc 582 . . . . 5 (((𝐴 No 𝐴 ∈ V) ∧ (𝐵 No 𝐵 ∈ V) ∧ 𝑊 No ) → (dom 𝑆 ∪ dom 𝑇) ∈ On)
36 noreson 27399 . . . . 5 ((𝑊 No ∧ (dom 𝑆 ∪ dom 𝑇) ∈ On) → (𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) ∈ No )
3716, 35, 36syl2anc 582 . . . 4 (((𝐴 No 𝐴 ∈ V) ∧ (𝐵 No 𝐵 ∈ V) ∧ 𝑊 No ) → (𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) ∈ No )
3817nosupbnd2 27455 . . . 4 ((𝐴 No 𝐴 ∈ V ∧ (𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) ∈ No ) → (∀𝑎𝐴 𝑎 <s (𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) ↔ ¬ ((𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) ↾ dom 𝑆) <s 𝑆))
3914, 15, 37, 38syl3anc 1369 . . 3 (((𝐴 No 𝐴 ∈ V) ∧ (𝐵 No 𝐵 ∈ V) ∧ 𝑊 No ) → (∀𝑎𝐴 𝑎 <s (𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) ↔ ¬ ((𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) ↾ dom 𝑆) <s 𝑆))
4020, 21, 373jca 1126 . . . 4 (((𝐴 No 𝐴 ∈ V) ∧ (𝐵 No 𝐵 ∈ V) ∧ 𝑊 No ) → (𝐵 No 𝐵 ∈ V ∧ (𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) ∈ No ))
4122noinfbnd2 27470 . . . 4 ((𝐵 No 𝐵 ∈ V ∧ (𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) ∈ No ) → (∀𝑏𝐵 (𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) <s 𝑏 ↔ ¬ 𝑇 <s ((𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) ↾ dom 𝑇)))
4240, 41syl 17 . . 3 (((𝐴 No 𝐴 ∈ V) ∧ (𝐵 No 𝐵 ∈ V) ∧ 𝑊 No ) → (∀𝑏𝐵 (𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) <s 𝑏 ↔ ¬ 𝑇 <s ((𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) ↾ dom 𝑇)))
4339, 42anbi12d 629 . 2 (((𝐴 No 𝐴 ∈ V) ∧ (𝐵 No 𝐵 ∈ V) ∧ 𝑊 No ) → ((∀𝑎𝐴 𝑎 <s (𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) ∧ ∀𝑏𝐵 (𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) <s 𝑏) ↔ (¬ ((𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) ↾ dom 𝑆) <s 𝑆 ∧ ¬ 𝑇 <s ((𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) ↾ dom 𝑇))))
4413, 25, 433bitr4d 310 1 (((𝐴 No 𝐴 ∈ V) ∧ (𝐵 No 𝐵 ∈ V) ∧ 𝑊 No ) → ((∀𝑎𝐴 𝑎 <s 𝑊 ∧ ∀𝑏𝐵 𝑊 <s 𝑏) ↔ (∀𝑎𝐴 𝑎 <s (𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) ∧ ∀𝑏𝐵 (𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) <s 𝑏)))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 205  wa 394  w3a 1085   = wceq 1539  wcel 2104  {cab 2707  wral 3059  wrex 3068  Vcvv 3472  cun 3945  wss 3947  ifcif 4527  {csn 4627  cop 4633   class class class wbr 5147  cmpt 5230  dom cdm 5675  cres 5677  Oncon0 6363  suc csuc 6365  cio 6492  cfv 6542  crio 7366  1oc1o 8461  2oc2o 8462   No csur 27379   <s cslt 27380
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1911  ax-6 1969  ax-7 2009  ax-8 2106  ax-9 2114  ax-10 2135  ax-11 2152  ax-12 2169  ax-ext 2701  ax-rep 5284  ax-sep 5298  ax-nul 5305  ax-pr 5426  ax-un 7727
This theorem depends on definitions:  df-bi 206  df-an 395  df-or 844  df-3or 1086  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2532  df-eu 2561  df-clab 2708  df-cleq 2722  df-clel 2808  df-nfc 2883  df-ne 2939  df-ral 3060  df-rex 3069  df-rmo 3374  df-reu 3375  df-rab 3431  df-v 3474  df-sbc 3777  df-csb 3893  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-pss 3966  df-nul 4322  df-if 4528  df-pw 4603  df-sn 4628  df-pr 4630  df-tp 4632  df-op 4634  df-uni 4908  df-int 4950  df-iun 4998  df-br 5148  df-opab 5210  df-mpt 5231  df-tr 5265  df-id 5573  df-eprel 5579  df-po 5587  df-so 5588  df-fr 5630  df-we 5632  df-xp 5681  df-rel 5682  df-cnv 5683  df-co 5684  df-dm 5685  df-rn 5686  df-res 5687  df-ima 5688  df-ord 6366  df-on 6367  df-suc 6369  df-iota 6494  df-fun 6544  df-fn 6545  df-f 6546  df-f1 6547  df-fo 6548  df-f1o 6549  df-fv 6550  df-riota 7367  df-1o 8468  df-2o 8469  df-no 27382  df-slt 27383  df-bday 27384
This theorem is referenced by:  noetalem1  27480
  Copyright terms: Public domain W3C validator