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

Theorem cofcut1d 28366
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 28365 . 2 ((𝐴 <<s 𝐵 ∧ (∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐶 𝑥 ≤s 𝑦 ∧ ∀𝑧 ∈ 𝐵 ∃𝑤 ∈ 𝐷 𝑤 ≤s 𝑧) ∧ (𝐶 <<s {(𝐴 |s 𝐵)} ∧ {(𝐴 |s 𝐵)} <<s 𝐷)) → (𝐴 |s 𝐵) = (𝐶 |s 𝐷))
71, 2, 3, 4, 5, 6syl122anc 1409 1 (𝜑 → (𝐴 |s 𝐵) = (𝐶 |s 𝐷))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1572  ∀wral 3083  ∃wrex 3093  {csn 4587   class class class wbr 5107  (class class class)co 7450   ≤s cles 28160   <<s cslts 28202   |s ccuts 28204
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-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-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-1o 8513  df-2o 8514  df-no 28059  df-lts 28060  df-bday 28061  df-les 28161  df-slts 28203  df-cuts 28205
This theorem is used by:  cutmax  28379  cutmin  28380  addsuniflem  28446  negsunif  28500  mulsuniflem  28594  n0fincut  28800  zcuts  28852  halfcut  28903  addhalfcut  28904  elreno2  28940
  Copyright terms: Public domain W3C validator