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

Theorem cofcut1d 27932
Description: If 𝐶 is cofinal with 𝐴 and 𝐷 is coinitial with 𝐵 and the cut of 𝐴 and 𝐵 lies between 𝐶 and 𝐷, then the cut of 𝐶 and 𝐷 is equal to the cut of 𝐴 and 𝐵. Theorem 2.6 of [Gonshor] p. 10. (Contributed by Scott Fenton, 23-Jan-2025.)
Hypotheses
Ref Expression
cofcut1d.1 (𝜑𝐴 <<s 𝐵)
cofcut1d.2 (𝜑 → ∀𝑥𝐴𝑦𝐶 𝑥 ≤s 𝑦)
cofcut1d.3 (𝜑 → ∀𝑧𝐵𝑤𝐷 𝑤 ≤s 𝑧)
cofcut1d.4 (𝜑𝐶 <<s {(𝐴 |s 𝐵)})
cofcut1d.5 (𝜑 → {(𝐴 |s 𝐵)} <<s 𝐷)
Assertion
Ref Expression
cofcut1d (𝜑 → (𝐴 |s 𝐵) = (𝐶 |s 𝐷))
Distinct variable groups:   𝑥,𝐴   𝑧,𝐵   𝑥,𝐶,𝑦   𝑤,𝐷,𝑧
Allowed substitution hints:   𝜑(𝑥,𝑦,𝑧,𝑤)   𝐴(𝑦,𝑧,𝑤)   𝐵(𝑥,𝑦,𝑤)   𝐶(𝑧,𝑤)   𝐷(𝑥,𝑦)

Proof of Theorem cofcut1d
StepHypRef Expression
1 cofcut1d.1 . 2 (𝜑𝐴 <<s 𝐵)
2 cofcut1d.2 . 2 (𝜑 → ∀𝑥𝐴𝑦𝐶 𝑥 ≤s 𝑦)
3 cofcut1d.3 . 2 (𝜑 → ∀𝑧𝐵𝑤𝐷 𝑤 ≤s 𝑧)
4 cofcut1d.4 . 2 (𝜑𝐶 <<s {(𝐴 |s 𝐵)})
5 cofcut1d.5 . 2 (𝜑 → {(𝐴 |s 𝐵)} <<s 𝐷)
6 cofcut1 27931 . 2 ((𝐴 <<s 𝐵 ∧ (∀𝑥𝐴𝑦𝐶 𝑥 ≤s 𝑦 ∧ ∀𝑧𝐵𝑤𝐷 𝑤 ≤s 𝑧) ∧ (𝐶 <<s {(𝐴 |s 𝐵)} ∧ {(𝐴 |s 𝐵)} <<s 𝐷)) → (𝐴 |s 𝐵) = (𝐶 |s 𝐷))
71, 2, 3, 4, 5, 6syl122anc 1387 1 (𝜑 → (𝐴 |s 𝐵) = (𝐶 |s 𝐷))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1547  wral 3053  wrex 3063  {csn 4556   class class class wbr 5073  (class class class)co 7357   ≤s cles 27727   <<s cslts 27768   |s ccuts 27770
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2711  ax-rep 5200  ax-sep 5219  ax-nul 5229  ax-pow 5295  ax-pr 5363  ax-un 7679
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3or 1093  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2718  df-cleq 2731  df-clel 2814  df-nfc 2888  df-ne 2935  df-ral 3054  df-rex 3064  df-rmo 3344  df-reu 3345  df-rab 3392  df-v 3433  df-sbc 3724  df-csb 3832  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-pss 3903  df-nul 4263  df-if 4456  df-pw 4532  df-sn 4557  df-pr 4559  df-tp 4561  df-op 4563  df-uni 4840  df-int 4879  df-br 5074  df-opab 5136  df-mpt 5155  df-tr 5181  df-id 5514  df-eprel 5519  df-po 5527  df-so 5528  df-fr 5572  df-we 5574  df-xp 5625  df-rel 5626  df-cnv 5627  df-co 5628  df-dm 5629  df-rn 5630  df-res 5631  df-ima 5632  df-ord 6314  df-on 6315  df-suc 6317  df-iota 6442  df-fun 6488  df-fn 6489  df-f 6490  df-f1 6491  df-fo 6492  df-f1o 6493  df-fv 6494  df-riota 7314  df-ov 7360  df-oprab 7361  df-mpo 7362  df-1o 8396  df-2o 8397  df-no 27625  df-lts 27626  df-bday 27627  df-les 27728  df-slts 27769  df-cuts 27771
This theorem is referenced by:  cutmax  27945  cutmin  27946  addsuniflem  28012  negsunif  28066  mulsuniflem  28160  n0fincut  28366  zcuts  28418  halfcut  28469  addhalfcut  28470  elreno2  28506
  Copyright terms: Public domain W3C validator