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

Theorem coinitsslt 34016
Description: If 𝐵 is coinitial with 𝐶 and 𝐴 precedes 𝐶, then 𝐴 precedes 𝐵. (Contributed by Scott Fenton, 24-Sep-2024.)
Assertion
Ref Expression
coinitsslt ((𝐵 ∈ 𝒫 No ∧ ∀𝑥𝐵𝑦𝐶 𝑦 ≤s 𝑥𝐴 <<s 𝐶) → 𝐴 <<s 𝐵)
Distinct variable groups:   𝑥,𝐵   𝑥,𝐶,𝑦
Allowed substitution hints:   𝐴(𝑥,𝑦)   𝐵(𝑦)

Proof of Theorem coinitsslt
Dummy variables 𝑎 𝑏 𝑐 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ssltex1 33908 . . 3 (𝐴 <<s 𝐶𝐴 ∈ V)
213ad2ant3 1133 . 2 ((𝐵 ∈ 𝒫 No ∧ ∀𝑥𝐵𝑦𝐶 𝑦 ≤s 𝑥𝐴 <<s 𝐶) → 𝐴 ∈ V)
3 simp1 1134 . 2 ((𝐵 ∈ 𝒫 No ∧ ∀𝑥𝐵𝑦𝐶 𝑦 ≤s 𝑥𝐴 <<s 𝐶) → 𝐵 ∈ 𝒫 No )
4 ssltss1 33910 . . 3 (𝐴 <<s 𝐶𝐴 No )
543ad2ant3 1133 . 2 ((𝐵 ∈ 𝒫 No ∧ ∀𝑥𝐵𝑦𝐶 𝑦 ≤s 𝑥𝐴 <<s 𝐶) → 𝐴 No )
63elpwid 4541 . 2 ((𝐵 ∈ 𝒫 No ∧ ∀𝑥𝐵𝑦𝐶 𝑦 ≤s 𝑥𝐴 <<s 𝐶) → 𝐵 No )
7 breq2 5074 . . . . . 6 (𝑥 = 𝑏 → (𝑦 ≤s 𝑥𝑦 ≤s 𝑏))
87rexbidv 3225 . . . . 5 (𝑥 = 𝑏 → (∃𝑦𝐶 𝑦 ≤s 𝑥 ↔ ∃𝑦𝐶 𝑦 ≤s 𝑏))
9 simp12 1202 . . . . 5 (((𝐵 ∈ 𝒫 No ∧ ∀𝑥𝐵𝑦𝐶 𝑦 ≤s 𝑥𝐴 <<s 𝐶) ∧ 𝑎𝐴𝑏𝐵) → ∀𝑥𝐵𝑦𝐶 𝑦 ≤s 𝑥)
10 simp3 1136 . . . . 5 (((𝐵 ∈ 𝒫 No ∧ ∀𝑥𝐵𝑦𝐶 𝑦 ≤s 𝑥𝐴 <<s 𝐶) ∧ 𝑎𝐴𝑏𝐵) → 𝑏𝐵)
118, 9, 10rspcdva 3554 . . . 4 (((𝐵 ∈ 𝒫 No ∧ ∀𝑥𝐵𝑦𝐶 𝑦 ≤s 𝑥𝐴 <<s 𝐶) ∧ 𝑎𝐴𝑏𝐵) → ∃𝑦𝐶 𝑦 ≤s 𝑏)
12 breq1 5073 . . . . 5 (𝑦 = 𝑐 → (𝑦 ≤s 𝑏𝑐 ≤s 𝑏))
1312cbvrexvw 3373 . . . 4 (∃𝑦𝐶 𝑦 ≤s 𝑏 ↔ ∃𝑐𝐶 𝑐 ≤s 𝑏)
1411, 13sylib 217 . . 3 (((𝐵 ∈ 𝒫 No ∧ ∀𝑥𝐵𝑦𝐶 𝑦 ≤s 𝑥𝐴 <<s 𝐶) ∧ 𝑎𝐴𝑏𝐵) → ∃𝑐𝐶 𝑐 ≤s 𝑏)
15 simpl13 1248 . . . . . 6 ((((𝐵 ∈ 𝒫 No ∧ ∀𝑥𝐵𝑦𝐶 𝑦 ≤s 𝑥𝐴 <<s 𝐶) ∧ 𝑎𝐴𝑏𝐵) ∧ (𝑐𝐶𝑐 ≤s 𝑏)) → 𝐴 <<s 𝐶)
1615, 4syl 17 . . . . 5 ((((𝐵 ∈ 𝒫 No ∧ ∀𝑥𝐵𝑦𝐶 𝑦 ≤s 𝑥𝐴 <<s 𝐶) ∧ 𝑎𝐴𝑏𝐵) ∧ (𝑐𝐶𝑐 ≤s 𝑏)) → 𝐴 No )
17 simpl2 1190 . . . . 5 ((((𝐵 ∈ 𝒫 No ∧ ∀𝑥𝐵𝑦𝐶 𝑦 ≤s 𝑥𝐴 <<s 𝐶) ∧ 𝑎𝐴𝑏𝐵) ∧ (𝑐𝐶𝑐 ≤s 𝑏)) → 𝑎𝐴)
1816, 17sseldd 3918 . . . 4 ((((𝐵 ∈ 𝒫 No ∧ ∀𝑥𝐵𝑦𝐶 𝑦 ≤s 𝑥𝐴 <<s 𝐶) ∧ 𝑎𝐴𝑏𝐵) ∧ (𝑐𝐶𝑐 ≤s 𝑏)) → 𝑎 No )
19 ssltss2 33911 . . . . . 6 (𝐴 <<s 𝐶𝐶 No )
2015, 19syl 17 . . . . 5 ((((𝐵 ∈ 𝒫 No ∧ ∀𝑥𝐵𝑦𝐶 𝑦 ≤s 𝑥𝐴 <<s 𝐶) ∧ 𝑎𝐴𝑏𝐵) ∧ (𝑐𝐶𝑐 ≤s 𝑏)) → 𝐶 No )
21 simprl 767 . . . . 5 ((((𝐵 ∈ 𝒫 No ∧ ∀𝑥𝐵𝑦𝐶 𝑦 ≤s 𝑥𝐴 <<s 𝐶) ∧ 𝑎𝐴𝑏𝐵) ∧ (𝑐𝐶𝑐 ≤s 𝑏)) → 𝑐𝐶)
2220, 21sseldd 3918 . . . 4 ((((𝐵 ∈ 𝒫 No ∧ ∀𝑥𝐵𝑦𝐶 𝑦 ≤s 𝑥𝐴 <<s 𝐶) ∧ 𝑎𝐴𝑏𝐵) ∧ (𝑐𝐶𝑐 ≤s 𝑏)) → 𝑐 No )
23 simpl1 1189 . . . . . 6 ((((𝐵 ∈ 𝒫 No ∧ ∀𝑥𝐵𝑦𝐶 𝑦 ≤s 𝑥𝐴 <<s 𝐶) ∧ 𝑎𝐴𝑏𝐵) ∧ (𝑐𝐶𝑐 ≤s 𝑏)) → (𝐵 ∈ 𝒫 No ∧ ∀𝑥𝐵𝑦𝐶 𝑦 ≤s 𝑥𝐴 <<s 𝐶))
2423, 6syl 17 . . . . 5 ((((𝐵 ∈ 𝒫 No ∧ ∀𝑥𝐵𝑦𝐶 𝑦 ≤s 𝑥𝐴 <<s 𝐶) ∧ 𝑎𝐴𝑏𝐵) ∧ (𝑐𝐶𝑐 ≤s 𝑏)) → 𝐵 No )
25 simpl3 1191 . . . . 5 ((((𝐵 ∈ 𝒫 No ∧ ∀𝑥𝐵𝑦𝐶 𝑦 ≤s 𝑥𝐴 <<s 𝐶) ∧ 𝑎𝐴𝑏𝐵) ∧ (𝑐𝐶𝑐 ≤s 𝑏)) → 𝑏𝐵)
2624, 25sseldd 3918 . . . 4 ((((𝐵 ∈ 𝒫 No ∧ ∀𝑥𝐵𝑦𝐶 𝑦 ≤s 𝑥𝐴 <<s 𝐶) ∧ 𝑎𝐴𝑏𝐵) ∧ (𝑐𝐶𝑐 ≤s 𝑏)) → 𝑏 No )
2715, 17, 21ssltsepcd 33915 . . . 4 ((((𝐵 ∈ 𝒫 No ∧ ∀𝑥𝐵𝑦𝐶 𝑦 ≤s 𝑥𝐴 <<s 𝐶) ∧ 𝑎𝐴𝑏𝐵) ∧ (𝑐𝐶𝑐 ≤s 𝑏)) → 𝑎 <s 𝑐)
28 simprr 769 . . . 4 ((((𝐵 ∈ 𝒫 No ∧ ∀𝑥𝐵𝑦𝐶 𝑦 ≤s 𝑥𝐴 <<s 𝐶) ∧ 𝑎𝐴𝑏𝐵) ∧ (𝑐𝐶𝑐 ≤s 𝑏)) → 𝑐 ≤s 𝑏)
2918, 22, 26, 27, 28sltletrd 33890 . . 3 ((((𝐵 ∈ 𝒫 No ∧ ∀𝑥𝐵𝑦𝐶 𝑦 ≤s 𝑥𝐴 <<s 𝐶) ∧ 𝑎𝐴𝑏𝐵) ∧ (𝑐𝐶𝑐 ≤s 𝑏)) → 𝑎 <s 𝑏)
3014, 29rexlimddv 3219 . 2 (((𝐵 ∈ 𝒫 No ∧ ∀𝑥𝐵𝑦𝐶 𝑦 ≤s 𝑥𝐴 <<s 𝐶) ∧ 𝑎𝐴𝑏𝐵) → 𝑎 <s 𝑏)
312, 3, 5, 6, 30ssltd 33913 1 ((𝐵 ∈ 𝒫 No ∧ ∀𝑥𝐵𝑦𝐶 𝑦 ≤s 𝑥𝐴 <<s 𝐶) → 𝐴 <<s 𝐵)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  w3a 1085  wcel 2108  wral 3063  wrex 3064  Vcvv 3422  wss 3883  𝒫 cpw 4530   class class class wbr 5070   No csur 33770   <s cslt 33771   ≤s csle 33874   <<s csslt 33902
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-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-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-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-fv 6426  df-1o 8267  df-2o 8268  df-no 33773  df-slt 33774  df-sle 33875  df-sslt 33903
This theorem is referenced by:  cofcut1  34017  cofcut2  34018
  Copyright terms: Public domain W3C validator