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

Theorem coinitsslt 27238
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 27126 . . 3 (𝐴 <<s 𝐶𝐴 ∈ V)
213ad2ant3 1135 . 2 ((𝐵 ∈ 𝒫 No ∧ ∀𝑥𝐵𝑦𝐶 𝑦 ≤s 𝑥𝐴 <<s 𝐶) → 𝐴 ∈ V)
3 simp1 1136 . 2 ((𝐵 ∈ 𝒫 No ∧ ∀𝑥𝐵𝑦𝐶 𝑦 ≤s 𝑥𝐴 <<s 𝐶) → 𝐵 ∈ 𝒫 No )
4 ssltss1 27128 . . 3 (𝐴 <<s 𝐶𝐴 No )
543ad2ant3 1135 . 2 ((𝐵 ∈ 𝒫 No ∧ ∀𝑥𝐵𝑦𝐶 𝑦 ≤s 𝑥𝐴 <<s 𝐶) → 𝐴 No )
63elpwid 4569 . 2 ((𝐵 ∈ 𝒫 No ∧ ∀𝑥𝐵𝑦𝐶 𝑦 ≤s 𝑥𝐴 <<s 𝐶) → 𝐵 No )
7 breq2 5109 . . . . . 6 (𝑥 = 𝑏 → (𝑦 ≤s 𝑥𝑦 ≤s 𝑏))
87rexbidv 3175 . . . . 5 (𝑥 = 𝑏 → (∃𝑦𝐶 𝑦 ≤s 𝑥 ↔ ∃𝑦𝐶 𝑦 ≤s 𝑏))
9 simp12 1204 . . . . 5 (((𝐵 ∈ 𝒫 No ∧ ∀𝑥𝐵𝑦𝐶 𝑦 ≤s 𝑥𝐴 <<s 𝐶) ∧ 𝑎𝐴𝑏𝐵) → ∀𝑥𝐵𝑦𝐶 𝑦 ≤s 𝑥)
10 simp3 1138 . . . . 5 (((𝐵 ∈ 𝒫 No ∧ ∀𝑥𝐵𝑦𝐶 𝑦 ≤s 𝑥𝐴 <<s 𝐶) ∧ 𝑎𝐴𝑏𝐵) → 𝑏𝐵)
118, 9, 10rspcdva 3582 . . . 4 (((𝐵 ∈ 𝒫 No ∧ ∀𝑥𝐵𝑦𝐶 𝑦 ≤s 𝑥𝐴 <<s 𝐶) ∧ 𝑎𝐴𝑏𝐵) → ∃𝑦𝐶 𝑦 ≤s 𝑏)
12 breq1 5108 . . . . 5 (𝑦 = 𝑐 → (𝑦 ≤s 𝑏𝑐 ≤s 𝑏))
1312cbvrexvw 3226 . . . 4 (∃𝑦𝐶 𝑦 ≤s 𝑏 ↔ ∃𝑐𝐶 𝑐 ≤s 𝑏)
1411, 13sylib 217 . . 3 (((𝐵 ∈ 𝒫 No ∧ ∀𝑥𝐵𝑦𝐶 𝑦 ≤s 𝑥𝐴 <<s 𝐶) ∧ 𝑎𝐴𝑏𝐵) → ∃𝑐𝐶 𝑐 ≤s 𝑏)
15 simpl13 1250 . . . . . 6 ((((𝐵 ∈ 𝒫 No ∧ ∀𝑥𝐵𝑦𝐶 𝑦 ≤s 𝑥𝐴 <<s 𝐶) ∧ 𝑎𝐴𝑏𝐵) ∧ (𝑐𝐶𝑐 ≤s 𝑏)) → 𝐴 <<s 𝐶)
1615, 4syl 17 . . . . 5 ((((𝐵 ∈ 𝒫 No ∧ ∀𝑥𝐵𝑦𝐶 𝑦 ≤s 𝑥𝐴 <<s 𝐶) ∧ 𝑎𝐴𝑏𝐵) ∧ (𝑐𝐶𝑐 ≤s 𝑏)) → 𝐴 No )
17 simpl2 1192 . . . . 5 ((((𝐵 ∈ 𝒫 No ∧ ∀𝑥𝐵𝑦𝐶 𝑦 ≤s 𝑥𝐴 <<s 𝐶) ∧ 𝑎𝐴𝑏𝐵) ∧ (𝑐𝐶𝑐 ≤s 𝑏)) → 𝑎𝐴)
1816, 17sseldd 3945 . . . 4 ((((𝐵 ∈ 𝒫 No ∧ ∀𝑥𝐵𝑦𝐶 𝑦 ≤s 𝑥𝐴 <<s 𝐶) ∧ 𝑎𝐴𝑏𝐵) ∧ (𝑐𝐶𝑐 ≤s 𝑏)) → 𝑎 No )
19 ssltss2 27129 . . . . . 6 (𝐴 <<s 𝐶𝐶 No )
2015, 19syl 17 . . . . 5 ((((𝐵 ∈ 𝒫 No ∧ ∀𝑥𝐵𝑦𝐶 𝑦 ≤s 𝑥𝐴 <<s 𝐶) ∧ 𝑎𝐴𝑏𝐵) ∧ (𝑐𝐶𝑐 ≤s 𝑏)) → 𝐶 No )
21 simprl 769 . . . . 5 ((((𝐵 ∈ 𝒫 No ∧ ∀𝑥𝐵𝑦𝐶 𝑦 ≤s 𝑥𝐴 <<s 𝐶) ∧ 𝑎𝐴𝑏𝐵) ∧ (𝑐𝐶𝑐 ≤s 𝑏)) → 𝑐𝐶)
2220, 21sseldd 3945 . . . 4 ((((𝐵 ∈ 𝒫 No ∧ ∀𝑥𝐵𝑦𝐶 𝑦 ≤s 𝑥𝐴 <<s 𝐶) ∧ 𝑎𝐴𝑏𝐵) ∧ (𝑐𝐶𝑐 ≤s 𝑏)) → 𝑐 No )
23 simpl1 1191 . . . . . 6 ((((𝐵 ∈ 𝒫 No ∧ ∀𝑥𝐵𝑦𝐶 𝑦 ≤s 𝑥𝐴 <<s 𝐶) ∧ 𝑎𝐴𝑏𝐵) ∧ (𝑐𝐶𝑐 ≤s 𝑏)) → (𝐵 ∈ 𝒫 No ∧ ∀𝑥𝐵𝑦𝐶 𝑦 ≤s 𝑥𝐴 <<s 𝐶))
2423, 6syl 17 . . . . 5 ((((𝐵 ∈ 𝒫 No ∧ ∀𝑥𝐵𝑦𝐶 𝑦 ≤s 𝑥𝐴 <<s 𝐶) ∧ 𝑎𝐴𝑏𝐵) ∧ (𝑐𝐶𝑐 ≤s 𝑏)) → 𝐵 No )
25 simpl3 1193 . . . . 5 ((((𝐵 ∈ 𝒫 No ∧ ∀𝑥𝐵𝑦𝐶 𝑦 ≤s 𝑥𝐴 <<s 𝐶) ∧ 𝑎𝐴𝑏𝐵) ∧ (𝑐𝐶𝑐 ≤s 𝑏)) → 𝑏𝐵)
2624, 25sseldd 3945 . . . 4 ((((𝐵 ∈ 𝒫 No ∧ ∀𝑥𝐵𝑦𝐶 𝑦 ≤s 𝑥𝐴 <<s 𝐶) ∧ 𝑎𝐴𝑏𝐵) ∧ (𝑐𝐶𝑐 ≤s 𝑏)) → 𝑏 No )
2715, 17, 21ssltsepcd 27133 . . . 4 ((((𝐵 ∈ 𝒫 No ∧ ∀𝑥𝐵𝑦𝐶 𝑦 ≤s 𝑥𝐴 <<s 𝐶) ∧ 𝑎𝐴𝑏𝐵) ∧ (𝑐𝐶𝑐 ≤s 𝑏)) → 𝑎 <s 𝑐)
28 simprr 771 . . . 4 ((((𝐵 ∈ 𝒫 No ∧ ∀𝑥𝐵𝑦𝐶 𝑦 ≤s 𝑥𝐴 <<s 𝐶) ∧ 𝑎𝐴𝑏𝐵) ∧ (𝑐𝐶𝑐 ≤s 𝑏)) → 𝑐 ≤s 𝑏)
2918, 22, 26, 27, 28sltletrd 27108 . . 3 ((((𝐵 ∈ 𝒫 No ∧ ∀𝑥𝐵𝑦𝐶 𝑦 ≤s 𝑥𝐴 <<s 𝐶) ∧ 𝑎𝐴𝑏𝐵) ∧ (𝑐𝐶𝑐 ≤s 𝑏)) → 𝑎 <s 𝑏)
3014, 29rexlimddv 3158 . 2 (((𝐵 ∈ 𝒫 No ∧ ∀𝑥𝐵𝑦𝐶 𝑦 ≤s 𝑥𝐴 <<s 𝐶) ∧ 𝑎𝐴𝑏𝐵) → 𝑎 <s 𝑏)
312, 3, 5, 6, 30ssltd 27131 1 ((𝐵 ∈ 𝒫 No ∧ ∀𝑥𝐵𝑦𝐶 𝑦 ≤s 𝑥𝐴 <<s 𝐶) → 𝐴 <<s 𝐵)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 396  w3a 1087  wcel 2106  wral 3064  wrex 3073  Vcvv 3445  wss 3910  𝒫 cpw 4560   class class class wbr 5105   No csur 26988   <s cslt 26989   ≤s csle 27092   <<s csslt 27120
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 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2707  ax-sep 5256  ax-nul 5263  ax-pr 5384
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3or 1088  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2538  df-eu 2567  df-clab 2714  df-cleq 2728  df-clel 2814  df-nfc 2889  df-ne 2944  df-ral 3065  df-rex 3074  df-rab 3408  df-v 3447  df-sbc 3740  df-csb 3856  df-dif 3913  df-un 3915  df-in 3917  df-ss 3927  df-pss 3929  df-nul 4283  df-if 4487  df-pw 4562  df-sn 4587  df-pr 4589  df-tp 4591  df-op 4593  df-uni 4866  df-br 5106  df-opab 5168  df-mpt 5189  df-tr 5223  df-id 5531  df-eprel 5537  df-po 5545  df-so 5546  df-fr 5588  df-we 5590  df-xp 5639  df-rel 5640  df-cnv 5641  df-co 5642  df-dm 5643  df-rn 5644  df-res 5645  df-ima 5646  df-ord 6320  df-on 6321  df-suc 6323  df-iota 6448  df-fun 6498  df-fn 6499  df-f 6500  df-fv 6504  df-1o 8412  df-2o 8413  df-no 26991  df-slt 26992  df-sle 27093  df-sslt 27121
This theorem is referenced by:  cofcut1  27239  cofcut2  27241
  Copyright terms: Public domain W3C validator