Theorem ssltun2 33383

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 33368	. . . 4 ⊢ (𝐴 <<s 𝐵 → 𝐴 ∈ V)
2	1	adantr 484	. . 3 ⊢ ((𝐴 <<s 𝐵 ∧ 𝐴 <<s 𝐶) → 𝐴 ∈ V)
3		ssltex2 33369	. . . 4 ⊢ (𝐴 <<s 𝐵 → 𝐵 ∈ V)
4		ssltex2 33369	. . . 4 ⊢ (𝐴 <<s 𝐶 → 𝐶 ∈ V)
5		unexg 7452	. . . 4 ⊢ ((𝐵 ∈ V ∧ 𝐶 ∈ V) → (𝐵 ∪ 𝐶) ∈ V)
6	3, 4, 5	syl2an 598	. . 3 ⊢ ((𝐴 <<s 𝐵 ∧ 𝐴 <<s 𝐶) → (𝐵 ∪ 𝐶) ∈ V)
7	2, 6	jca 515	. 2 ⊢ ((𝐴 <<s 𝐵 ∧ 𝐴 <<s 𝐶) → (𝐴 ∈ V ∧ (𝐵 ∪ 𝐶) ∈ V))
8		ssltss1 33370	. . . 4 ⊢ (𝐴 <<s 𝐵 → 𝐴 ⊆ No )
9	8	adantr 484	. . 3 ⊢ ((𝐴 <<s 𝐵 ∧ 𝐴 <<s 𝐶) → 𝐴 ⊆ No )
10		ssltss2 33371	. . . . 5 ⊢ (𝐴 <<s 𝐵 → 𝐵 ⊆ No )
11	10	adantr 484	. . . 4 ⊢ ((𝐴 <<s 𝐵 ∧ 𝐴 <<s 𝐶) → 𝐵 ⊆ No )
12		ssltss2 33371	. . . . 5 ⊢ (𝐴 <<s 𝐶 → 𝐶 ⊆ No )
13	12	adantl 485	. . . 4 ⊢ ((𝐴 <<s 𝐵 ∧ 𝐴 <<s 𝐶) → 𝐶 ⊆ No )
14	11, 13	unssd 4113	. . 3 ⊢ ((𝐴 <<s 𝐵 ∧ 𝐴 <<s 𝐶) → (𝐵 ∪ 𝐶) ⊆ No )
15		ssltsep 33372	. . . . 5 ⊢ (𝐴 <<s 𝐵 → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝑥 <s 𝑦)
16	15	adantr 484	. . . 4 ⊢ ((𝐴 <<s 𝐵 ∧ 𝐴 <<s 𝐶) → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝑥 <s 𝑦)
17		ssltsep 33372	. . . . 5 ⊢ (𝐴 <<s 𝐶 → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐶 𝑥 <s 𝑦)
18	17	adantl 485	. . . 4 ⊢ ((𝐴 <<s 𝐵 ∧ 𝐴 <<s 𝐶) → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐶 𝑥 <s 𝑦)
19		ralunb 4118	. . . . . 6 ⊢ (∀𝑦 ∈ (𝐵 ∪ 𝐶)𝑥 <s 𝑦 ↔ (∀𝑦 ∈ 𝐵 𝑥 <s 𝑦 ∧ ∀𝑦 ∈ 𝐶 𝑥 <s 𝑦))
20	19	ralbii 3133	. . . . 5 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ (𝐵 ∪ 𝐶)𝑥 <s 𝑦 ↔ ∀𝑥 ∈ 𝐴 (∀𝑦 ∈ 𝐵 𝑥 <s 𝑦 ∧ ∀𝑦 ∈ 𝐶 𝑥 <s 𝑦))
21		r19.26 3137	. . . . 5 ⊢ (∀𝑥 ∈ 𝐴 (∀𝑦 ∈ 𝐵 𝑥 <s 𝑦 ∧ ∀𝑦 ∈ 𝐶 𝑥 <s 𝑦) ↔ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝑥 <s 𝑦 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐶 𝑥 <s 𝑦))
22	20, 21	bitri 278	. . . 4 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ (𝐵 ∪ 𝐶)𝑥 <s 𝑦 ↔ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝑥 <s 𝑦 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐶 𝑥 <s 𝑦))
23	16, 18, 22	sylanbrc 586	. . 3 ⊢ ((𝐴 <<s 𝐵 ∧ 𝐴 <<s 𝐶) → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ (𝐵 ∪ 𝐶)𝑥 <s 𝑦)
24	9, 14, 23	3jca 1125	. 2 ⊢ ((𝐴 <<s 𝐵 ∧ 𝐴 <<s 𝐶) → (𝐴 ⊆ No ∧ (𝐵 ∪ 𝐶) ⊆ No ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ (𝐵 ∪ 𝐶)𝑥 <s 𝑦))
25		brsslt 33367	. 2 ⊢ (𝐴 <<s (𝐵 ∪ 𝐶) ↔ ((𝐴 ∈ V ∧ (𝐵 ∪ 𝐶) ∈ V) ∧ (𝐴 ⊆ No ∧ (𝐵 ∪ 𝐶) ⊆ No ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ (𝐵 ∪ 𝐶)𝑥 <s 𝑦)))
26	7, 24, 25	sylanbrc 586	1 ⊢ ((𝐴 <<s 𝐵 ∧ 𝐴 <<s 𝐶) → 𝐴 <<s (𝐵 ∪ 𝐶))

Syntax hints:   → wi 4   ∧ wa 399   ∧ w3a 1084   ∈ wcel 2111  ∀wral 3106  Vcvv 3441   ∪ cun 3879   ⊆ wss 3881   class class class wbr 5030   No csur 33260   <s cslt 33261   <<s csslt 33363

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 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-sep 5167  ax-nul 5174  ax-pr 5295  ax-un 7441

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ral 3111  df-rex 3112  df-rab 3115  df-v 3443  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-nul 4244  df-if 4426  df-sn 4526  df-pr 4528  df-op 4532  df-uni 4801  df-br 5031  df-opab 5093  df-xp 5525  df-sslt 33364

This theorem is referenced by:  scutun12  33384