Theorem ssltun2 27778

Description: Union law for surreal set less-than. (Contributed by Scott Fenton, 9-Dec-2021.)

Assertion

Ref	Expression
ssltun2	⊢ ((𝐴 <<s 𝐵 ∧ 𝐴 <<s 𝐶) → 𝐴 <<s (𝐵 ∪ 𝐶))

Proof of Theorem ssltun2

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

Step	Hyp	Ref	Expression
1		ssltex1 27755	. . 3 ⊢ (𝐴 <<s 𝐵 → 𝐴 ∈ V)
2	1	adantr 480	. 2 ⊢ ((𝐴 <<s 𝐵 ∧ 𝐴 <<s 𝐶) → 𝐴 ∈ V)
3		ssltex2 27756	. . . 4 ⊢ (𝐴 <<s 𝐵 → 𝐵 ∈ V)
4	3	adantr 480	. . 3 ⊢ ((𝐴 <<s 𝐵 ∧ 𝐴 <<s 𝐶) → 𝐵 ∈ V)
5		ssltex2 27756	. . . 4 ⊢ (𝐴 <<s 𝐶 → 𝐶 ∈ V)
6	5	adantl 481	. . 3 ⊢ ((𝐴 <<s 𝐵 ∧ 𝐴 <<s 𝐶) → 𝐶 ∈ V)
7	4, 6	unexd 7753	. 2 ⊢ ((𝐴 <<s 𝐵 ∧ 𝐴 <<s 𝐶) → (𝐵 ∪ 𝐶) ∈ V)
8		ssltss1 27757	. . 3 ⊢ (𝐴 <<s 𝐵 → 𝐴 ⊆ No )
9	8	adantr 480	. 2 ⊢ ((𝐴 <<s 𝐵 ∧ 𝐴 <<s 𝐶) → 𝐴 ⊆ No )
10		ssltss2 27758	. . . 4 ⊢ (𝐴 <<s 𝐵 → 𝐵 ⊆ No )
11	10	adantr 480	. . 3 ⊢ ((𝐴 <<s 𝐵 ∧ 𝐴 <<s 𝐶) → 𝐵 ⊆ No )
12		ssltss2 27758	. . . 4 ⊢ (𝐴 <<s 𝐶 → 𝐶 ⊆ No )
13	12	adantl 481	. . 3 ⊢ ((𝐴 <<s 𝐵 ∧ 𝐴 <<s 𝐶) → 𝐶 ⊆ No )
14	11, 13	unssd 4172	. 2 ⊢ ((𝐴 <<s 𝐵 ∧ 𝐴 <<s 𝐶) → (𝐵 ∪ 𝐶) ⊆ No )
15		elun 4133	. . . 4 ⊢ (𝑦 ∈ (𝐵 ∪ 𝐶) ↔ (𝑦 ∈ 𝐵 ∨ 𝑦 ∈ 𝐶))
16		ssltsepc 27762	. . . . . . . 8 ⊢ ((𝐴 <<s 𝐵 ∧ 𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → 𝑥 <s 𝑦)
17	16	3exp 1119	. . . . . . 7 ⊢ (𝐴 <<s 𝐵 → (𝑥 ∈ 𝐴 → (𝑦 ∈ 𝐵 → 𝑥 <s 𝑦)))
18	17	adantr 480	. . . . . 6 ⊢ ((𝐴 <<s 𝐵 ∧ 𝐴 <<s 𝐶) → (𝑥 ∈ 𝐴 → (𝑦 ∈ 𝐵 → 𝑥 <s 𝑦)))
19	18	com3r 87	. . . . 5 ⊢ (𝑦 ∈ 𝐵 → ((𝐴 <<s 𝐵 ∧ 𝐴 <<s 𝐶) → (𝑥 ∈ 𝐴 → 𝑥 <s 𝑦)))
20		ssltsepc 27762	. . . . . . . 8 ⊢ ((𝐴 <<s 𝐶 ∧ 𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐶) → 𝑥 <s 𝑦)
21	20	3exp 1119	. . . . . . 7 ⊢ (𝐴 <<s 𝐶 → (𝑥 ∈ 𝐴 → (𝑦 ∈ 𝐶 → 𝑥 <s 𝑦)))
22	21	adantl 481	. . . . . 6 ⊢ ((𝐴 <<s 𝐵 ∧ 𝐴 <<s 𝐶) → (𝑥 ∈ 𝐴 → (𝑦 ∈ 𝐶 → 𝑥 <s 𝑦)))
23	22	com3r 87	. . . . 5 ⊢ (𝑦 ∈ 𝐶 → ((𝐴 <<s 𝐵 ∧ 𝐴 <<s 𝐶) → (𝑥 ∈ 𝐴 → 𝑥 <s 𝑦)))
24	19, 23	jaoi 857	. . . 4 ⊢ ((𝑦 ∈ 𝐵 ∨ 𝑦 ∈ 𝐶) → ((𝐴 <<s 𝐵 ∧ 𝐴 <<s 𝐶) → (𝑥 ∈ 𝐴 → 𝑥 <s 𝑦)))
25	15, 24	sylbi 217	. . 3 ⊢ (𝑦 ∈ (𝐵 ∪ 𝐶) → ((𝐴 <<s 𝐵 ∧ 𝐴 <<s 𝐶) → (𝑥 ∈ 𝐴 → 𝑥 <s 𝑦)))
26	25	3imp231 1112	. 2 ⊢ (((𝐴 <<s 𝐵 ∧ 𝐴 <<s 𝐶) ∧ 𝑥 ∈ 𝐴 ∧ 𝑦 ∈ (𝐵 ∪ 𝐶)) → 𝑥 <s 𝑦)
27	2, 7, 9, 14, 26	ssltd 27760	1 ⊢ ((𝐴 <<s 𝐵 ∧ 𝐴 <<s 𝐶) → 𝐴 <<s (𝐵 ∪ 𝐶))

Syntax hints:   → wi 4   ∧ wa 395   ∨ wo 847   ∈ wcel 2109  Vcvv 3464   ∪ cun 3929   ⊆ wss 3931   class class class wbr 5124   No csur 27608   <s cslt 27609   <<s csslt 27749

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-ext 2708  ax-sep 5271  ax-nul 5281  ax-pr 5407  ax-un 7734

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-sb 2066  df-clab 2715  df-cleq 2728  df-clel 2810  df-ral 3053  df-rex 3062  df-rab 3421  df-v 3466  df-dif 3934  df-un 3936  df-ss 3948  df-nul 4314  df-if 4506  df-sn 4607  df-pr 4609  df-op 4613  df-uni 4889  df-br 5125  df-opab 5187  df-xp 5665  df-sslt 27750

This theorem is referenced by:  scutun12  27779