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

Theorem nosupinfsep 27792
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 4188 . . . . . . . 8 dom 𝑆 ⊆ (dom 𝑆 ∪ dom 𝑇)
2 resabs1 6027 . . . . . . . 8 (dom 𝑆 ⊆ (dom 𝑆 ∪ dom 𝑇) → ((𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) ↾ dom 𝑆) = (𝑊 ↾ dom 𝑆))
31, 2ax-mp 5 . . . . . . 7 ((𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) ↾ dom 𝑆) = (𝑊 ↾ dom 𝑆)
43breq1i 5155 . . . . . 6 (((𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) ↾ dom 𝑆) <s 𝑆 ↔ (𝑊 ↾ dom 𝑆) <s 𝑆)
54notbii 320 . . . . 5 (¬ ((𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) ↾ dom 𝑆) <s 𝑆 ↔ ¬ (𝑊 ↾ dom 𝑆) <s 𝑆)
6 ssun2 4189 . . . . . . . 8 dom 𝑇 ⊆ (dom 𝑆 ∪ dom 𝑇)
7 resabs1 6027 . . . . . . . 8 (dom 𝑇 ⊆ (dom 𝑆 ∪ dom 𝑇) → ((𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) ↾ dom 𝑇) = (𝑊 ↾ dom 𝑇))
86, 7ax-mp 5 . . . . . . 7 ((𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) ↾ dom 𝑇) = (𝑊 ↾ dom 𝑇)
98breq2i 5156 . . . . . 6 (𝑇 <s ((𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) ↾ dom 𝑇) ↔ 𝑇 <s (𝑊 ↾ dom 𝑇))
109notbii 320 . . . . 5 𝑇 <s ((𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) ↾ dom 𝑇) ↔ ¬ 𝑇 <s (𝑊 ↾ dom 𝑇))
115, 10anbi12i 628 . . . 4 ((¬ ((𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) ↾ dom 𝑆) <s 𝑆 ∧ ¬ 𝑇 <s ((𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) ↾ dom 𝑇)) ↔ (¬ (𝑊 ↾ dom 𝑆) <s 𝑆 ∧ ¬ 𝑇 <s (𝑊 ↾ dom 𝑇)))
1211bicomi 224 . . 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 1196 . . . 4 (((𝐴 No 𝐴 ∈ V) ∧ (𝐵 No 𝐵 ∈ V) ∧ 𝑊 No ) → 𝐴 No )
15 simp1r 1197 . . . 4 (((𝐴 No 𝐴 ∈ V) ∧ (𝐵 No 𝐵 ∈ V) ∧ 𝑊 No ) → 𝐴 ∈ V)
16 simp3 1137 . . . 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 27776 . . . 4 ((𝐴 No 𝐴 ∈ V ∧ 𝑊 No ) → (∀𝑎𝐴 𝑎 <s 𝑊 ↔ ¬ (𝑊 ↾ dom 𝑆) <s 𝑆))
1914, 15, 16, 18syl3anc 1370 . . 3 (((𝐴 No 𝐴 ∈ V) ∧ (𝐵 No 𝐵 ∈ V) ∧ 𝑊 No ) → (∀𝑎𝐴 𝑎 <s 𝑊 ↔ ¬ (𝑊 ↾ dom 𝑆) <s 𝑆))
20 simp2l 1198 . . . 4 (((𝐴 No 𝐴 ∈ V) ∧ (𝐵 No 𝐵 ∈ V) ∧ 𝑊 No ) → 𝐵 No )
21 simp2r 1199 . . . 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 27791 . . . 4 ((𝐵 No 𝐵 ∈ V ∧ 𝑊 No ) → (∀𝑏𝐵 𝑊 <s 𝑏 ↔ ¬ 𝑇 <s (𝑊 ↾ dom 𝑇)))
2420, 21, 16, 23syl3anc 1370 . . 3 (((𝐴 No 𝐴 ∈ V) ∧ (𝐵 No 𝐵 ∈ V) ∧ 𝑊 No ) → (∀𝑏𝐵 𝑊 <s 𝑏 ↔ ¬ 𝑇 <s (𝑊 ↾ dom 𝑇)))
2519, 24anbi12d 632 . 2 (((𝐴 No 𝐴 ∈ V) ∧ (𝐵 No 𝐵 ∈ V) ∧ 𝑊 No ) → ((∀𝑎𝐴 𝑎 <s 𝑊 ∧ ∀𝑏𝐵 𝑊 <s 𝑏) ↔ (¬ (𝑊 ↾ dom 𝑆) <s 𝑆 ∧ ¬ 𝑇 <s (𝑊 ↾ dom 𝑇))))
2617nosupno 27763 . . . . . . . 8 ((𝐴 No 𝐴 ∈ V) → 𝑆 No )
27 nodmon 27710 . . . . . . . 8 (𝑆 No → dom 𝑆 ∈ On)
2826, 27syl 17 . . . . . . 7 ((𝐴 No 𝐴 ∈ V) → dom 𝑆 ∈ On)
29283ad2ant1 1132 . . . . . 6 (((𝐴 No 𝐴 ∈ V) ∧ (𝐵 No 𝐵 ∈ V) ∧ 𝑊 No ) → dom 𝑆 ∈ On)
3022noinfno 27778 . . . . . . . 8 ((𝐵 No 𝐵 ∈ V) → 𝑇 No )
31 nodmon 27710 . . . . . . . 8 (𝑇 No → dom 𝑇 ∈ On)
3230, 31syl 17 . . . . . . 7 ((𝐵 No 𝐵 ∈ V) → dom 𝑇 ∈ On)
33323ad2ant2 1133 . . . . . 6 (((𝐴 No 𝐴 ∈ V) ∧ (𝐵 No 𝐵 ∈ V) ∧ 𝑊 No ) → dom 𝑇 ∈ On)
34 onun2 6494 . . . . . 6 ((dom 𝑆 ∈ On ∧ dom 𝑇 ∈ On) → (dom 𝑆 ∪ dom 𝑇) ∈ On)
3529, 33, 34syl2anc 584 . . . . 5 (((𝐴 No 𝐴 ∈ V) ∧ (𝐵 No 𝐵 ∈ V) ∧ 𝑊 No ) → (dom 𝑆 ∪ dom 𝑇) ∈ On)
36 noreson 27720 . . . . 5 ((𝑊 No ∧ (dom 𝑆 ∪ dom 𝑇) ∈ On) → (𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) ∈ No )
3716, 35, 36syl2anc 584 . . . 4 (((𝐴 No 𝐴 ∈ V) ∧ (𝐵 No 𝐵 ∈ V) ∧ 𝑊 No ) → (𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) ∈ No )
3817nosupbnd2 27776 . . . 4 ((𝐴 No 𝐴 ∈ V ∧ (𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) ∈ No ) → (∀𝑎𝐴 𝑎 <s (𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) ↔ ¬ ((𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) ↾ dom 𝑆) <s 𝑆))
3914, 15, 37, 38syl3anc 1370 . . 3 (((𝐴 No 𝐴 ∈ V) ∧ (𝐵 No 𝐵 ∈ V) ∧ 𝑊 No ) → (∀𝑎𝐴 𝑎 <s (𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) ↔ ¬ ((𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) ↾ dom 𝑆) <s 𝑆))
4020, 21, 373jca 1127 . . . 4 (((𝐴 No 𝐴 ∈ V) ∧ (𝐵 No 𝐵 ∈ V) ∧ 𝑊 No ) → (𝐵 No 𝐵 ∈ V ∧ (𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) ∈ No ))
4122noinfbnd2 27791 . . . 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 632 . 2 (((𝐴 No 𝐴 ∈ V) ∧ (𝐵 No 𝐵 ∈ V) ∧ 𝑊 No ) → ((∀𝑎𝐴 𝑎 <s (𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) ∧ ∀𝑏𝐵 (𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) <s 𝑏) ↔ (¬ ((𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) ↾ dom 𝑆) <s 𝑆 ∧ ¬ 𝑇 <s ((𝑊 ↾ (dom 𝑆 ∪ dom 𝑇)) ↾ dom 𝑇))))
4413, 25, 433bitr4d 311 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 206  wa 395  w3a 1086   = wceq 1537  wcel 2106  {cab 2712  wral 3059  wrex 3068  Vcvv 3478  cun 3961  wss 3963  ifcif 4531  {csn 4631  cop 4637   class class class wbr 5148  cmpt 5231  dom cdm 5689  cres 5691  Oncon0 6386  suc csuc 6388  cio 6514  cfv 6563  crio 7387  1oc1o 8498  2oc2o 8499   No csur 27699   <s cslt 27700
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-ext 2706  ax-rep 5285  ax-sep 5302  ax-nul 5312  ax-pow 5371  ax-pr 5438  ax-un 7754
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-nf 1781  df-sb 2063  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2727  df-clel 2814  df-nfc 2890  df-ne 2939  df-ral 3060  df-rex 3069  df-rmo 3378  df-reu 3379  df-rab 3434  df-v 3480  df-sbc 3792  df-csb 3909  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-pss 3983  df-nul 4340  df-if 4532  df-pw 4607  df-sn 4632  df-pr 4634  df-tp 4636  df-op 4638  df-uni 4913  df-int 4952  df-br 5149  df-opab 5211  df-mpt 5232  df-tr 5266  df-id 5583  df-eprel 5589  df-po 5597  df-so 5598  df-fr 5641  df-we 5643  df-xp 5695  df-rel 5696  df-cnv 5697  df-co 5698  df-dm 5699  df-rn 5700  df-res 5701  df-ima 5702  df-ord 6389  df-on 6390  df-suc 6392  df-iota 6516  df-fun 6565  df-fn 6566  df-f 6567  df-f1 6568  df-fo 6569  df-f1o 6570  df-fv 6571  df-riota 7388  df-1o 8505  df-2o 8506  df-no 27702  df-slt 27703  df-bday 27704
This theorem is referenced by:  noetalem1  27801
  Copyright terms: Public domain W3C validator