Users' Mathboxes Mathbox for Scott Fenton < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  cofcut2 Structured version   Visualization version   GIF version

Theorem cofcut2 34018
Description: If 𝐴 and 𝐶 are mutually cofinal and 𝐵 and 𝐷 are mutually coinitial, then the cut of 𝐴 and 𝐵 is equal to the cut of 𝐶 and 𝐷. Theorem 2.7 of [Gonshor] p. 10. (Contributed by Scott Fenton, 25-Sep-2024.)
Assertion
Ref Expression
cofcut2 (((𝐴 <<s 𝐵𝐶 ∈ 𝒫 No 𝐷 ∈ 𝒫 No ) ∧ (∀𝑥𝐴𝑦𝐶 𝑥 ≤s 𝑦 ∧ ∀𝑧𝐵𝑤𝐷 𝑤 ≤s 𝑧) ∧ (∀𝑡𝐶𝑢𝐴 𝑡 ≤s 𝑢 ∧ ∀𝑟𝐷𝑠𝐵 𝑠 ≤s 𝑟)) → (𝐴 |s 𝐵) = (𝐶 |s 𝐷))
Distinct variable groups:   𝑡,𝐴,𝑢   𝑥,𝐴   𝐵,𝑟,𝑠   𝑧,𝐵   𝑡,𝐶   𝑥,𝐶,𝑦   𝐷,𝑟   𝑤,𝐷,𝑧
Allowed substitution hints:   𝐴(𝑦,𝑧,𝑤,𝑠,𝑟)   𝐵(𝑥,𝑦,𝑤,𝑢,𝑡)   𝐶(𝑧,𝑤,𝑢,𝑠,𝑟)   𝐷(𝑥,𝑦,𝑢,𝑡,𝑠)

Proof of Theorem cofcut2
StepHypRef Expression
1 simp11 1201 . 2 (((𝐴 <<s 𝐵𝐶 ∈ 𝒫 No 𝐷 ∈ 𝒫 No ) ∧ (∀𝑥𝐴𝑦𝐶 𝑥 ≤s 𝑦 ∧ ∀𝑧𝐵𝑤𝐷 𝑤 ≤s 𝑧) ∧ (∀𝑡𝐶𝑢𝐴 𝑡 ≤s 𝑢 ∧ ∀𝑟𝐷𝑠𝐵 𝑠 ≤s 𝑟)) → 𝐴 <<s 𝐵)
2 simp2 1135 . 2 (((𝐴 <<s 𝐵𝐶 ∈ 𝒫 No 𝐷 ∈ 𝒫 No ) ∧ (∀𝑥𝐴𝑦𝐶 𝑥 ≤s 𝑦 ∧ ∀𝑧𝐵𝑤𝐷 𝑤 ≤s 𝑧) ∧ (∀𝑡𝐶𝑢𝐴 𝑡 ≤s 𝑢 ∧ ∀𝑟𝐷𝑠𝐵 𝑠 ≤s 𝑟)) → (∀𝑥𝐴𝑦𝐶 𝑥 ≤s 𝑦 ∧ ∀𝑧𝐵𝑤𝐷 𝑤 ≤s 𝑧))
3 simp12 1202 . . 3 (((𝐴 <<s 𝐵𝐶 ∈ 𝒫 No 𝐷 ∈ 𝒫 No ) ∧ (∀𝑥𝐴𝑦𝐶 𝑥 ≤s 𝑦 ∧ ∀𝑧𝐵𝑤𝐷 𝑤 ≤s 𝑧) ∧ (∀𝑡𝐶𝑢𝐴 𝑡 ≤s 𝑢 ∧ ∀𝑟𝐷𝑠𝐵 𝑠 ≤s 𝑟)) → 𝐶 ∈ 𝒫 No )
4 simp3l 1199 . . 3 (((𝐴 <<s 𝐵𝐶 ∈ 𝒫 No 𝐷 ∈ 𝒫 No ) ∧ (∀𝑥𝐴𝑦𝐶 𝑥 ≤s 𝑦 ∧ ∀𝑧𝐵𝑤𝐷 𝑤 ≤s 𝑧) ∧ (∀𝑡𝐶𝑢𝐴 𝑡 ≤s 𝑢 ∧ ∀𝑟𝐷𝑠𝐵 𝑠 ≤s 𝑟)) → ∀𝑡𝐶𝑢𝐴 𝑡 ≤s 𝑢)
5 scutcut 33922 . . . . 5 (𝐴 <<s 𝐵 → ((𝐴 |s 𝐵) ∈ No 𝐴 <<s {(𝐴 |s 𝐵)} ∧ {(𝐴 |s 𝐵)} <<s 𝐵))
61, 5syl 17 . . . 4 (((𝐴 <<s 𝐵𝐶 ∈ 𝒫 No 𝐷 ∈ 𝒫 No ) ∧ (∀𝑥𝐴𝑦𝐶 𝑥 ≤s 𝑦 ∧ ∀𝑧𝐵𝑤𝐷 𝑤 ≤s 𝑧) ∧ (∀𝑡𝐶𝑢𝐴 𝑡 ≤s 𝑢 ∧ ∀𝑟𝐷𝑠𝐵 𝑠 ≤s 𝑟)) → ((𝐴 |s 𝐵) ∈ No 𝐴 <<s {(𝐴 |s 𝐵)} ∧ {(𝐴 |s 𝐵)} <<s 𝐵))
76simp2d 1141 . . 3 (((𝐴 <<s 𝐵𝐶 ∈ 𝒫 No 𝐷 ∈ 𝒫 No ) ∧ (∀𝑥𝐴𝑦𝐶 𝑥 ≤s 𝑦 ∧ ∀𝑧𝐵𝑤𝐷 𝑤 ≤s 𝑧) ∧ (∀𝑡𝐶𝑢𝐴 𝑡 ≤s 𝑢 ∧ ∀𝑟𝐷𝑠𝐵 𝑠 ≤s 𝑟)) → 𝐴 <<s {(𝐴 |s 𝐵)})
8 cofsslt 34015 . . 3 ((𝐶 ∈ 𝒫 No ∧ ∀𝑡𝐶𝑢𝐴 𝑡 ≤s 𝑢𝐴 <<s {(𝐴 |s 𝐵)}) → 𝐶 <<s {(𝐴 |s 𝐵)})
93, 4, 7, 8syl3anc 1369 . 2 (((𝐴 <<s 𝐵𝐶 ∈ 𝒫 No 𝐷 ∈ 𝒫 No ) ∧ (∀𝑥𝐴𝑦𝐶 𝑥 ≤s 𝑦 ∧ ∀𝑧𝐵𝑤𝐷 𝑤 ≤s 𝑧) ∧ (∀𝑡𝐶𝑢𝐴 𝑡 ≤s 𝑢 ∧ ∀𝑟𝐷𝑠𝐵 𝑠 ≤s 𝑟)) → 𝐶 <<s {(𝐴 |s 𝐵)})
10 simp13 1203 . . 3 (((𝐴 <<s 𝐵𝐶 ∈ 𝒫 No 𝐷 ∈ 𝒫 No ) ∧ (∀𝑥𝐴𝑦𝐶 𝑥 ≤s 𝑦 ∧ ∀𝑧𝐵𝑤𝐷 𝑤 ≤s 𝑧) ∧ (∀𝑡𝐶𝑢𝐴 𝑡 ≤s 𝑢 ∧ ∀𝑟𝐷𝑠𝐵 𝑠 ≤s 𝑟)) → 𝐷 ∈ 𝒫 No )
11 simp3r 1200 . . 3 (((𝐴 <<s 𝐵𝐶 ∈ 𝒫 No 𝐷 ∈ 𝒫 No ) ∧ (∀𝑥𝐴𝑦𝐶 𝑥 ≤s 𝑦 ∧ ∀𝑧𝐵𝑤𝐷 𝑤 ≤s 𝑧) ∧ (∀𝑡𝐶𝑢𝐴 𝑡 ≤s 𝑢 ∧ ∀𝑟𝐷𝑠𝐵 𝑠 ≤s 𝑟)) → ∀𝑟𝐷𝑠𝐵 𝑠 ≤s 𝑟)
126simp3d 1142 . . 3 (((𝐴 <<s 𝐵𝐶 ∈ 𝒫 No 𝐷 ∈ 𝒫 No ) ∧ (∀𝑥𝐴𝑦𝐶 𝑥 ≤s 𝑦 ∧ ∀𝑧𝐵𝑤𝐷 𝑤 ≤s 𝑧) ∧ (∀𝑡𝐶𝑢𝐴 𝑡 ≤s 𝑢 ∧ ∀𝑟𝐷𝑠𝐵 𝑠 ≤s 𝑟)) → {(𝐴 |s 𝐵)} <<s 𝐵)
13 coinitsslt 34016 . . 3 ((𝐷 ∈ 𝒫 No ∧ ∀𝑟𝐷𝑠𝐵 𝑠 ≤s 𝑟 ∧ {(𝐴 |s 𝐵)} <<s 𝐵) → {(𝐴 |s 𝐵)} <<s 𝐷)
1410, 11, 12, 13syl3anc 1369 . 2 (((𝐴 <<s 𝐵𝐶 ∈ 𝒫 No 𝐷 ∈ 𝒫 No ) ∧ (∀𝑥𝐴𝑦𝐶 𝑥 ≤s 𝑦 ∧ ∀𝑧𝐵𝑤𝐷 𝑤 ≤s 𝑧) ∧ (∀𝑡𝐶𝑢𝐴 𝑡 ≤s 𝑢 ∧ ∀𝑟𝐷𝑠𝐵 𝑠 ≤s 𝑟)) → {(𝐴 |s 𝐵)} <<s 𝐷)
15 cofcut1 34017 . 2 ((𝐴 <<s 𝐵 ∧ (∀𝑥𝐴𝑦𝐶 𝑥 ≤s 𝑦 ∧ ∀𝑧𝐵𝑤𝐷 𝑤 ≤s 𝑧) ∧ (𝐶 <<s {(𝐴 |s 𝐵)} ∧ {(𝐴 |s 𝐵)} <<s 𝐷)) → (𝐴 |s 𝐵) = (𝐶 |s 𝐷))
161, 2, 9, 14, 15syl112anc 1372 1 (((𝐴 <<s 𝐵𝐶 ∈ 𝒫 No 𝐷 ∈ 𝒫 No ) ∧ (∀𝑥𝐴𝑦𝐶 𝑥 ≤s 𝑦 ∧ ∀𝑧𝐵𝑤𝐷 𝑤 ≤s 𝑧) ∧ (∀𝑡𝐶𝑢𝐴 𝑡 ≤s 𝑢 ∧ ∀𝑟𝐷𝑠𝐵 𝑠 ≤s 𝑟)) → (𝐴 |s 𝐵) = (𝐶 |s 𝐷))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  w3a 1085   = wceq 1539  wcel 2108  wral 3063  wrex 3064  𝒫 cpw 4530  {csn 4558   class class class wbr 5070  (class class class)co 7255   No csur 33770   ≤s csle 33874   <<s csslt 33902   |s cscut 33904
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-rep 5205  ax-sep 5218  ax-nul 5225  ax-pr 5347  ax-un 7566
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3or 1086  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-ral 3068  df-rex 3069  df-reu 3070  df-rmo 3071  df-rab 3072  df-v 3424  df-sbc 3712  df-csb 3829  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-pss 3902  df-nul 4254  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-tp 4563  df-op 4565  df-uni 4837  df-int 4877  df-iun 4923  df-br 5071  df-opab 5133  df-mpt 5154  df-tr 5188  df-id 5480  df-eprel 5486  df-po 5494  df-so 5495  df-fr 5535  df-we 5537  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-res 5592  df-ima 5593  df-ord 6254  df-on 6255  df-suc 6257  df-iota 6376  df-fun 6420  df-fn 6421  df-f 6422  df-f1 6423  df-fo 6424  df-f1o 6425  df-fv 6426  df-riota 7212  df-ov 7258  df-oprab 7259  df-mpo 7260  df-1o 8267  df-2o 8268  df-no 33773  df-slt 33774  df-bday 33775  df-sle 33875  df-sslt 33903  df-scut 33905
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator