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

Theorem cofcutr2d 27839
Description: If 𝑋 is the cut of 𝐴 and 𝐵, then 𝐵 is coinitial with ( R ‘𝑋). Second half of theorem 2.9 of [Gonshor] p. 12. (Contributed by Scott Fenton, 25-Sep-2024.)
Hypotheses
Ref Expression
cofcutrd.1 (𝜑𝐴 <<s 𝐵)
cofcutrd.2 (𝜑𝑋 = (𝐴 |s 𝐵))
Assertion
Ref Expression
cofcutr2d (𝜑 → ∀𝑧 ∈ ( R ‘𝑋)∃𝑤𝐵 𝑤 ≤s 𝑧)
Distinct variable groups:   𝑤,𝐴,𝑧   𝑤,𝐵,𝑧   𝑤,𝑋,𝑧
Allowed substitution hints:   𝜑(𝑧,𝑤)

Proof of Theorem cofcutr2d
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 cofcutrd.1 . . 3 (𝜑𝐴 <<s 𝐵)
2 cofcutrd.2 . . 3 (𝜑𝑋 = (𝐴 |s 𝐵))
3 cofcutr 27837 . . 3 ((𝐴 <<s 𝐵𝑋 = (𝐴 |s 𝐵)) → (∀𝑥 ∈ ( L ‘𝑋)∃𝑦𝐴 𝑥 ≤s 𝑦 ∧ ∀𝑧 ∈ ( R ‘𝑋)∃𝑤𝐵 𝑤 ≤s 𝑧))
41, 2, 3syl2anc 584 . 2 (𝜑 → (∀𝑥 ∈ ( L ‘𝑋)∃𝑦𝐴 𝑥 ≤s 𝑦 ∧ ∀𝑧 ∈ ( R ‘𝑋)∃𝑤𝐵 𝑤 ≤s 𝑧))
54simprd 495 1 (𝜑 → ∀𝑧 ∈ ( R ‘𝑋)∃𝑤𝐵 𝑤 ≤s 𝑧)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1540  wral 3044  wrex 3053   class class class wbr 5092  cfv 6482  (class class class)co 7349   ≤s csle 27654   <<s csslt 27691   |s cscut 27693   L cleft 27755   R cright 27756
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 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-rep 5218  ax-sep 5235  ax-nul 5245  ax-pow 5304  ax-pr 5371  ax-un 7671
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-rmo 3343  df-reu 3344  df-rab 3395  df-v 3438  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4285  df-if 4477  df-pw 4553  df-sn 4578  df-pr 4580  df-tp 4582  df-op 4584  df-uni 4859  df-int 4897  df-iun 4943  df-br 5093  df-opab 5155  df-mpt 5174  df-tr 5200  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-pred 6249  df-ord 6310  df-on 6311  df-suc 6313  df-iota 6438  df-fun 6484  df-fn 6485  df-f 6486  df-f1 6487  df-fo 6488  df-f1o 6489  df-fv 6490  df-riota 7306  df-ov 7352  df-oprab 7353  df-mpo 7354  df-2nd 7925  df-frecs 8214  df-wrecs 8245  df-recs 8294  df-1o 8388  df-2o 8389  df-no 27552  df-slt 27553  df-bday 27554  df-sle 27655  df-sslt 27692  df-scut 27694  df-made 27757  df-old 27758  df-left 27760  df-right 27761
This theorem is referenced by:  addsuniflem  27913  negsunif  27966  mulsuniflem  28057  elons2  28164
  Copyright terms: Public domain W3C validator