Theorem ssslts2 27945

Description: Relation between surreal set less-than and subset. (Contributed by Scott Fenton, 9-Dec-2021.)

Assertion

Ref	Expression
ssslts2	⊢ ((𝐴 <<s 𝐵 ∧ 𝐶 ⊆ 𝐵) → 𝐴 <<s 𝐶)

Proof of Theorem ssslts2

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		sltsex1 27934	. . 3 ⊢ (𝐴 <<s 𝐵 → 𝐴 ∈ V)
2	1	adantr 485	. 2 ⊢ ((𝐴 <<s 𝐵 ∧ 𝐶 ⊆ 𝐵) → 𝐴 ∈ V)
3		sltsex2 27935	. . . 4 ⊢ (𝐴 <<s 𝐵 → 𝐵 ∈ V)
4	3	adantr 485	. . 3 ⊢ ((𝐴 <<s 𝐵 ∧ 𝐶 ⊆ 𝐵) → 𝐵 ∈ V)
5		simpr 489	. . 3 ⊢ ((𝐴 <<s 𝐵 ∧ 𝐶 ⊆ 𝐵) → 𝐶 ⊆ 𝐵)
6	4, 5	ssexd 5296	. 2 ⊢ ((𝐴 <<s 𝐵 ∧ 𝐶 ⊆ 𝐵) → 𝐶 ∈ V)
7		sltsss1 27936	. . . 4 ⊢ (𝐴 <<s 𝐵 → 𝐴 ⊆ No )
8	7	adantr 485	. . 3 ⊢ ((𝐴 <<s 𝐵 ∧ 𝐶 ⊆ 𝐵) → 𝐴 ⊆ No )
9		sltsss2 27937	. . . . 5 ⊢ (𝐴 <<s 𝐵 → 𝐵 ⊆ No )
10	9	adantr 485	. . . 4 ⊢ ((𝐴 <<s 𝐵 ∧ 𝐶 ⊆ 𝐵) → 𝐵 ⊆ No )
11	5, 10	sstrd 3948	. . 3 ⊢ ((𝐴 <<s 𝐵 ∧ 𝐶 ⊆ 𝐵) → 𝐶 ⊆ No )
12		sltssep 27938	. . . 4 ⊢ (𝐴 <<s 𝐵 → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝑥 <s 𝑦)
13		ssralv 4007	. . . . 5 ⊢ (𝐶 ⊆ 𝐵 → (∀𝑦 ∈ 𝐵 𝑥 <s 𝑦 → ∀𝑦 ∈ 𝐶 𝑥 <s 𝑦))
14	13	ralimdv 3179	. . . 4 ⊢ (𝐶 ⊆ 𝐵 → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝑥 <s 𝑦 → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐶 𝑥 <s 𝑦))
15	12, 14	mpan9 515	. . 3 ⊢ ((𝐴 <<s 𝐵 ∧ 𝐶 ⊆ 𝐵) → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐶 𝑥 <s 𝑦)
16	8, 11, 15	3jca 1146	. 2 ⊢ ((𝐴 <<s 𝐵 ∧ 𝐶 ⊆ 𝐵) → (𝐴 ⊆ No ∧ 𝐶 ⊆ No ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐶 𝑥 <s 𝑦))
17		brslts 27933	. 2 ⊢ (𝐴 <<s 𝐶 ↔ ((𝐴 ∈ V ∧ 𝐶 ∈ V) ∧ (𝐴 ⊆ No ∧ 𝐶 ⊆ No ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐶 𝑥 <s 𝑦)))
18	2, 6, 16, 17	syl21anbrc 1363	1 ⊢ ((𝐴 <<s 𝐵 ∧ 𝐶 ⊆ 𝐵) → 𝐴 <<s 𝐶)

Syntax hints:   → wi 4   ∧ wa 400   ∧ w3a 1103   ∈ wcel 2143  ∀wral 3079  Vcvv 3455   ⊆ wss 3906   class class class wbr 5110   No csur 27782   <s clts 27783   <<s cslts 27928

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-ext 2735  ax-sep 5258  ax-pr 5406

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-sb 2097  df-clab 2742  df-cleq 2755  df-clel 2838  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4288  df-if 4489  df-sn 4591  df-pr 4593  df-op 4597  df-br 5111  df-opab 5175  df-xp 5669  df-slts 27929

This theorem is referenced by:  cutsun12  27961  eqcuts3  27975  cutmin  28106  cutminmax  28107