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

Theorem ssslts1 28189
Description: Relation between surreal set less-than and subset. (Contributed by Scott Fenton, 9-Dec-2021.)
Assertion
Ref Expression
ssslts1 ((𝐴 <<s 𝐵 ∧ 𝐶 ⊆ 𝐴) → 𝐶 <<s 𝐵)

Proof of Theorem ssslts1
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 sltsex1 28179 . . . 4 (𝐴 <<s 𝐵 → 𝐴 ∈ V)
21adantr 486 . . 3 ((𝐴 <<s 𝐵 ∧ 𝐶 ⊆ 𝐴) → 𝐴 ∈ V)
3 simpr 490 . . 3 ((𝐴 <<s 𝐵 ∧ 𝐶 ⊆ 𝐴) → 𝐶 ⊆ 𝐴)
42, 3ssexd 5290 . 2 ((𝐴 <<s 𝐵 ∧ 𝐶 ⊆ 𝐴) → 𝐶 ∈ V)
5 sltsex2 28180 . . 3 (𝐴 <<s 𝐵 → 𝐵 ∈ V)
65adantr 486 . 2 ((𝐴 <<s 𝐵 ∧ 𝐶 ⊆ 𝐴) → 𝐵 ∈ V)
7 sltsss1 28181 . . . . 5 (𝐴 <<s 𝐵 → 𝐴 ⊆ No)
87adantr 486 . . . 4 ((𝐴 <<s 𝐵 ∧ 𝐶 ⊆ 𝐴) → 𝐴 ⊆ No)
93, 8sstrd 3923 . . 3 ((𝐴 <<s 𝐵 ∧ 𝐶 ⊆ 𝐴) → 𝐶 ⊆ No)
10 sltsss2 28182 . . . 4 (𝐴 <<s 𝐵 → 𝐵 ⊆ No)
1110adantr 486 . . 3 ((𝐴 <<s 𝐵 ∧ 𝐶 ⊆ 𝐴) → 𝐵 ⊆ No)
12 sltssep 28183 . . . 4 (𝐴 <<s 𝐵 → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝑥 <s 𝑦)
13 ssralv 3982 . . . 4 (𝐶 ⊆ 𝐴 → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝑥 <s 𝑦 → ∀𝑥 ∈ 𝐶 ∀𝑦 ∈ 𝐵 𝑥 <s 𝑦))
1412, 13mpan9 516 . . 3 ((𝐴 <<s 𝐵 ∧ 𝐶 ⊆ 𝐴) → ∀𝑥 ∈ 𝐶 ∀𝑦 ∈ 𝐵 𝑥 <s 𝑦)
159, 11, 143jca 1146 . 2 ((𝐴 <<s 𝐵 ∧ 𝐶 ⊆ 𝐴) → (𝐶 ⊆ No ∧ 𝐵 ⊆ No ∧ ∀𝑥 ∈ 𝐶 ∀𝑦 ∈ 𝐵 𝑥 <s 𝑦))
16 brslts 28178 . 2 (𝐶 <<s 𝐵 ↔ ((𝐶 ∈ V ∧ 𝐵 ∈ V) ∧ (𝐶 ⊆ No ∧ 𝐵 ⊆ No ∧ ∀𝑥 ∈ 𝐶 ∀𝑦 ∈ 𝐵 𝑥 <s 𝑦)))
174, 6, 15, 16syl21anbrc 1363 1 ((𝐴 <<s 𝐵 ∧ 𝐶 ⊆ 𝐴) → 𝐶 <<s 𝐵)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   ∈ wcel 2147  ∀wral 3080  Vcvv 3454   ⊆ wss 3900   class class class wbr 5106  Nocsur 28027   <s clts 28028   <<s cslts 28173
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735  ax-sep 5252  ax-pr 5395
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-br 5107  df-opab 5171  df-xp 5661  df-slts 28174
This theorem is used by:  cutsun12  28206  eqcuts3  28220  cutmax  28350  precsexlem11  28633
  Copyright terms: Public domain W3C validator