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

Theorem cofcutr2d 27918
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 27916 . . 3 ((𝐴 <<s 𝐵𝑋 = (𝐴 |s 𝐵)) → (∀𝑥 ∈ ( L ‘𝑋)∃𝑦𝐴 𝑥 ≤s 𝑦 ∧ ∀𝑧 ∈ ( R ‘𝑋)∃𝑤𝐵 𝑤 ≤s 𝑧))
41, 2, 3syl2anc 585 . 2 (𝜑 → (∀𝑥 ∈ ( L ‘𝑋)∃𝑦𝐴 𝑥 ≤s 𝑦 ∧ ∀𝑧 ∈ ( R ‘𝑋)∃𝑤𝐵 𝑤 ≤s 𝑧))
54simprd 495 1 (𝜑 → ∀𝑧 ∈ ( R ‘𝑋)∃𝑤𝐵 𝑤 ≤s 𝑧)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1542  wral 3051  wrex 3061   class class class wbr 5085  cfv 6498  (class class class)co 7367   ≤s cles 27708   <<s cslts 27749   |s ccuts 27751   L cleft 27817   R cright 27818
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2708  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pow 5307  ax-pr 5375  ax-un 7689
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3062  df-rmo 3342  df-reu 3343  df-rab 3390  df-v 3431  df-sbc 3729  df-csb 3838  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-pss 3909  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-tp 4572  df-op 4574  df-uni 4851  df-int 4890  df-iun 4935  df-br 5086  df-opab 5148  df-mpt 5167  df-tr 5193  df-id 5526  df-eprel 5531  df-po 5539  df-so 5540  df-fr 5584  df-we 5586  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-pred 6265  df-ord 6326  df-on 6327  df-suc 6329  df-iota 6454  df-fun 6500  df-fn 6501  df-f 6502  df-f1 6503  df-fo 6504  df-f1o 6505  df-fv 6506  df-riota 7324  df-ov 7370  df-oprab 7371  df-mpo 7372  df-2nd 7943  df-frecs 8231  df-wrecs 8262  df-recs 8311  df-1o 8405  df-2o 8406  df-no 27606  df-lts 27607  df-bday 27608  df-les 27709  df-slts 27750  df-cuts 27752  df-made 27819  df-old 27820  df-left 27822  df-right 27823
This theorem is referenced by:  addsuniflem  27993  negsunif  28047  mulsuniflem  28141  elons2  28250  elreno2  28487
  Copyright terms: Public domain W3C validator