Theorem ssltss1 31903

Description: The first argument of surreal set is a set of surreals. (Contributed by Scott Fenton, 8-Dec-2021.)

Assertion

Ref	Expression
ssltss1	⊢ (𝐴 <<s 𝐵 → 𝐴 ⊆ No )

Proof of Theorem ssltss1

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

Step	Hyp	Ref	Expression
1		brsslt 31900	. 2 ⊢ (𝐴 <<s 𝐵 ↔ ((𝐴 ∈ V ∧ 𝐵 ∈ V) ∧ (𝐴 ⊆ No ∧ 𝐵 ⊆ No ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝑥 <s 𝑦)))
2		simpr1 1067	. 2 ⊢ (((𝐴 ∈ V ∧ 𝐵 ∈ V) ∧ (𝐴 ⊆ No ∧ 𝐵 ⊆ No ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝑥 <s 𝑦)) → 𝐴 ⊆ No )
3	1, 2	sylbi 207	1 ⊢ (𝐴 <<s 𝐵 → 𝐴 ⊆ No )

Syntax hints:   → wi 4   ∧ wa 384   ∧ w3a 1037   ∈ wcel 1990  ∀wral 2912  Vcvv 3200   ⊆ wss 3574   class class class wbr 4653   No csur 31793   <s cslt 31794   <<s csslt 31896

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pr 4906

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ral 2917  df-rex 2918  df-rab 2921  df-v 3202  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-br 4654  df-opab 4713  df-xp 5120  df-sslt 31897

This theorem is referenced by:  sssslt1  31906  sssslt2  31907  conway  31910  scutval  31911  sslttr  31914  ssltun1  31915  ssltun2  31916  dmscut  31918  etasslt  31920  slerec  31923  sltrec  31924