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 33777
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 1205 . 2 (((𝐴 <<s 𝐵𝐶 ∈ 𝒫 No 𝐷 ∈ 𝒫 No ) ∧ (∀𝑥𝐴𝑦𝐶 𝑥 ≤s 𝑦 ∧ ∀𝑧𝐵𝑤𝐷 𝑤 ≤s 𝑧) ∧ (∀𝑡𝐶𝑢𝐴 𝑡 ≤s 𝑢 ∧ ∀𝑟𝐷𝑠𝐵 𝑠 ≤s 𝑟)) → 𝐴 <<s 𝐵)
2 simp2 1139 . 2 (((𝐴 <<s 𝐵𝐶 ∈ 𝒫 No 𝐷 ∈ 𝒫 No ) ∧ (∀𝑥𝐴𝑦𝐶 𝑥 ≤s 𝑦 ∧ ∀𝑧𝐵𝑤𝐷 𝑤 ≤s 𝑧) ∧ (∀𝑡𝐶𝑢𝐴 𝑡 ≤s 𝑢 ∧ ∀𝑟𝐷𝑠𝐵 𝑠 ≤s 𝑟)) → (∀𝑥𝐴𝑦𝐶 𝑥 ≤s 𝑦 ∧ ∀𝑧𝐵𝑤𝐷 𝑤 ≤s 𝑧))
3 simp12 1206 . . 3 (((𝐴 <<s 𝐵𝐶 ∈ 𝒫 No 𝐷 ∈ 𝒫 No ) ∧ (∀𝑥𝐴𝑦𝐶 𝑥 ≤s 𝑦 ∧ ∀𝑧𝐵𝑤𝐷 𝑤 ≤s 𝑧) ∧ (∀𝑡𝐶𝑢𝐴 𝑡 ≤s 𝑢 ∧ ∀𝑟𝐷𝑠𝐵 𝑠 ≤s 𝑟)) → 𝐶 ∈ 𝒫 No )
4 simp3l 1203 . . 3 (((𝐴 <<s 𝐵𝐶 ∈ 𝒫 No 𝐷 ∈ 𝒫 No ) ∧ (∀𝑥𝐴𝑦𝐶 𝑥 ≤s 𝑦 ∧ ∀𝑧𝐵𝑤𝐷 𝑤 ≤s 𝑧) ∧ (∀𝑡𝐶𝑢𝐴 𝑡 ≤s 𝑢 ∧ ∀𝑟𝐷𝑠𝐵 𝑠 ≤s 𝑟)) → ∀𝑡𝐶𝑢𝐴 𝑡 ≤s 𝑢)
5 scutcut 33681 . . . . 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 1145 . . 3 (((𝐴 <<s 𝐵𝐶 ∈ 𝒫 No 𝐷 ∈ 𝒫 No ) ∧ (∀𝑥𝐴𝑦𝐶 𝑥 ≤s 𝑦 ∧ ∀𝑧𝐵𝑤𝐷 𝑤 ≤s 𝑧) ∧ (∀𝑡𝐶𝑢𝐴 𝑡 ≤s 𝑢 ∧ ∀𝑟𝐷𝑠𝐵 𝑠 ≤s 𝑟)) → 𝐴 <<s {(𝐴 |s 𝐵)})
8 cofsslt 33774 . . 3 ((𝐶 ∈ 𝒫 No ∧ ∀𝑡𝐶𝑢𝐴 𝑡 ≤s 𝑢𝐴 <<s {(𝐴 |s 𝐵)}) → 𝐶 <<s {(𝐴 |s 𝐵)})
93, 4, 7, 8syl3anc 1373 . 2 (((𝐴 <<s 𝐵𝐶 ∈ 𝒫 No 𝐷 ∈ 𝒫 No ) ∧ (∀𝑥𝐴𝑦𝐶 𝑥 ≤s 𝑦 ∧ ∀𝑧𝐵𝑤𝐷 𝑤 ≤s 𝑧) ∧ (∀𝑡𝐶𝑢𝐴 𝑡 ≤s 𝑢 ∧ ∀𝑟𝐷𝑠𝐵 𝑠 ≤s 𝑟)) → 𝐶 <<s {(𝐴 |s 𝐵)})
10 simp13 1207 . . 3 (((𝐴 <<s 𝐵𝐶 ∈ 𝒫 No 𝐷 ∈ 𝒫 No ) ∧ (∀𝑥𝐴𝑦𝐶 𝑥 ≤s 𝑦 ∧ ∀𝑧𝐵𝑤𝐷 𝑤 ≤s 𝑧) ∧ (∀𝑡𝐶𝑢𝐴 𝑡 ≤s 𝑢 ∧ ∀𝑟𝐷𝑠𝐵 𝑠 ≤s 𝑟)) → 𝐷 ∈ 𝒫 No )
11 simp3r 1204 . . 3 (((𝐴 <<s 𝐵𝐶 ∈ 𝒫 No 𝐷 ∈ 𝒫 No ) ∧ (∀𝑥𝐴𝑦𝐶 𝑥 ≤s 𝑦 ∧ ∀𝑧𝐵𝑤𝐷 𝑤 ≤s 𝑧) ∧ (∀𝑡𝐶𝑢𝐴 𝑡 ≤s 𝑢 ∧ ∀𝑟𝐷𝑠𝐵 𝑠 ≤s 𝑟)) → ∀𝑟𝐷𝑠𝐵 𝑠 ≤s 𝑟)
126simp3d 1146 . . 3 (((𝐴 <<s 𝐵𝐶 ∈ 𝒫 No 𝐷 ∈ 𝒫 No ) ∧ (∀𝑥𝐴𝑦𝐶 𝑥 ≤s 𝑦 ∧ ∀𝑧𝐵𝑤𝐷 𝑤 ≤s 𝑧) ∧ (∀𝑡𝐶𝑢𝐴 𝑡 ≤s 𝑢 ∧ ∀𝑟𝐷𝑠𝐵 𝑠 ≤s 𝑟)) → {(𝐴 |s 𝐵)} <<s 𝐵)
13 coinitsslt 33775 . . 3 ((𝐷 ∈ 𝒫 No ∧ ∀𝑟𝐷𝑠𝐵 𝑠 ≤s 𝑟 ∧ {(𝐴 |s 𝐵)} <<s 𝐵) → {(𝐴 |s 𝐵)} <<s 𝐷)
1410, 11, 12, 13syl3anc 1373 . 2 (((𝐴 <<s 𝐵𝐶 ∈ 𝒫 No 𝐷 ∈ 𝒫 No ) ∧ (∀𝑥𝐴𝑦𝐶 𝑥 ≤s 𝑦 ∧ ∀𝑧𝐵𝑤𝐷 𝑤 ≤s 𝑧) ∧ (∀𝑡𝐶𝑢𝐴 𝑡 ≤s 𝑢 ∧ ∀𝑟𝐷𝑠𝐵 𝑠 ≤s 𝑟)) → {(𝐴 |s 𝐵)} <<s 𝐷)
15 cofcut1 33776 . 2 ((𝐴 <<s 𝐵 ∧ (∀𝑥𝐴𝑦𝐶 𝑥 ≤s 𝑦 ∧ ∀𝑧𝐵𝑤𝐷 𝑤 ≤s 𝑧) ∧ (𝐶 <<s {(𝐴 |s 𝐵)} ∧ {(𝐴 |s 𝐵)} <<s 𝐷)) → (𝐴 |s 𝐵) = (𝐶 |s 𝐷))
161, 2, 9, 14, 15syl112anc 1376 1 (((𝐴 <<s 𝐵𝐶 ∈ 𝒫 No 𝐷 ∈ 𝒫 No ) ∧ (∀𝑥𝐴𝑦𝐶 𝑥 ≤s 𝑦 ∧ ∀𝑧𝐵𝑤𝐷 𝑤 ≤s 𝑧) ∧ (∀𝑡𝐶𝑢𝐴 𝑡 ≤s 𝑢 ∧ ∀𝑟𝐷𝑠𝐵 𝑠 ≤s 𝑟)) → (𝐴 |s 𝐵) = (𝐶 |s 𝐷))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 399  w3a 1089   = wceq 1543  wcel 2112  wral 3051  wrex 3052  𝒫 cpw 4499  {csn 4527   class class class wbr 5039  (class class class)co 7191   No csur 33529   ≤s csle 33633   <<s csslt 33661   |s cscut 33663
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1976  ax-7 2018  ax-8 2114  ax-9 2122  ax-10 2143  ax-11 2160  ax-12 2177  ax-ext 2708  ax-rep 5164  ax-sep 5177  ax-nul 5184  ax-pr 5307  ax-un 7501
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 848  df-3or 1090  df-3an 1091  df-tru 1546  df-fal 1556  df-ex 1788  df-nf 1792  df-sb 2073  df-mo 2539  df-eu 2568  df-clab 2715  df-cleq 2728  df-clel 2809  df-nfc 2879  df-ne 2933  df-ral 3056  df-rex 3057  df-reu 3058  df-rmo 3059  df-rab 3060  df-v 3400  df-sbc 3684  df-csb 3799  df-dif 3856  df-un 3858  df-in 3860  df-ss 3870  df-pss 3872  df-nul 4224  df-if 4426  df-pw 4501  df-sn 4528  df-pr 4530  df-tp 4532  df-op 4534  df-uni 4806  df-int 4846  df-iun 4892  df-br 5040  df-opab 5102  df-mpt 5121  df-tr 5147  df-id 5440  df-eprel 5445  df-po 5453  df-so 5454  df-fr 5494  df-we 5496  df-xp 5542  df-rel 5543  df-cnv 5544  df-co 5545  df-dm 5546  df-rn 5547  df-res 5548  df-ima 5549  df-ord 6194  df-on 6195  df-suc 6197  df-iota 6316  df-fun 6360  df-fn 6361  df-f 6362  df-f1 6363  df-fo 6364  df-f1o 6365  df-fv 6366  df-riota 7148  df-ov 7194  df-oprab 7195  df-mpo 7196  df-1o 8180  df-2o 8181  df-no 33532  df-slt 33533  df-bday 33534  df-sle 33634  df-sslt 33662  df-scut 33664
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator