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

Theorem cofcut1d 28334
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 28333 . 2 ((𝐴 <<s 𝐵 ∧ (∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐶 𝑥 ≤s 𝑦 ∧ ∀𝑧 ∈ 𝐵 ∃𝑤 ∈ 𝐷 𝑤 ≤s 𝑧) ∧ (𝐶 <<s {(𝐴 |s 𝐵)} ∧ {(𝐴 |s 𝐵)} <<s 𝐷)) → (𝐴 |s 𝐵) = (𝐶 |s 𝐷))
71, 2, 3, 4, 5, 6syl122anc 1407 1 (𝜑 → (𝐴 |s 𝐵) = (𝐶 |s 𝐷))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1570  ∀wral 3080  ∃wrex 3090  {csn 4588   class class class wbr 5106  (class class class)co 7440   ≤s cles 28128   <<s cslts 28170   |s ccuts 28172
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7772
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-tp 4593  df-op 4839  df-uni 4871  df-int 4911  df-br 5107  df-opab 5171  df-mpt 5190  df-tr 5216  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-ord 6380  df-on 6381  df-suc 6383  df-iota 6509  df-fun 6557  df-fn 6558  df-f 6559  df-f1 6560  df-fo 6561  df-f1o 6562  df-fv 6563  df-riota 7397  df-ov 7443  df-oprab 7444  df-mpo 7445  df-1o 8501  df-2o 8502  df-no 28027  df-lts 28028  df-bday 28029  df-les 28129  df-slts 28171  df-cuts 28173
This theorem is used by:  cutmax  28347  cutmin  28348  addsuniflem  28414  negsunif  28468  mulsuniflem  28562  n0fincut  28768  zcuts  28820  halfcut  28871  addhalfcut  28872  elreno2  28908
  Copyright terms: Public domain W3C validator