Theorem ssltun2 32242

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 32227	. . . 4 ⊢ (𝐴 <<s 𝐵 → 𝐴 ∈ V)
2	1	adantr 468	. . 3 ⊢ ((𝐴 <<s 𝐵 ∧ 𝐴 <<s 𝐶) → 𝐴 ∈ V)
3		ssltex2 32228	. . . 4 ⊢ (𝐴 <<s 𝐵 → 𝐵 ∈ V)
4		ssltex2 32228	. . . 4 ⊢ (𝐴 <<s 𝐶 → 𝐶 ∈ V)
5		unexg 7192	. . . 4 ⊢ ((𝐵 ∈ V ∧ 𝐶 ∈ V) → (𝐵 ∪ 𝐶) ∈ V)
6	3, 4, 5	syl2an 585	. . 3 ⊢ ((𝐴 <<s 𝐵 ∧ 𝐴 <<s 𝐶) → (𝐵 ∪ 𝐶) ∈ V)
7	2, 6	jca 503	. 2 ⊢ ((𝐴 <<s 𝐵 ∧ 𝐴 <<s 𝐶) → (𝐴 ∈ V ∧ (𝐵 ∪ 𝐶) ∈ V))
8		ssltss1 32229	. . . 4 ⊢ (𝐴 <<s 𝐵 → 𝐴 ⊆ No )
9	8	adantr 468	. . 3 ⊢ ((𝐴 <<s 𝐵 ∧ 𝐴 <<s 𝐶) → 𝐴 ⊆ No )
10		ssltss2 32230	. . . . 5 ⊢ (𝐴 <<s 𝐵 → 𝐵 ⊆ No )
11	10	adantr 468	. . . 4 ⊢ ((𝐴 <<s 𝐵 ∧ 𝐴 <<s 𝐶) → 𝐵 ⊆ No )
12		ssltss2 32230	. . . . 5 ⊢ (𝐴 <<s 𝐶 → 𝐶 ⊆ No )
13	12	adantl 469	. . . 4 ⊢ ((𝐴 <<s 𝐵 ∧ 𝐴 <<s 𝐶) → 𝐶 ⊆ No )
14	11, 13	unssd 3995	. . 3 ⊢ ((𝐴 <<s 𝐵 ∧ 𝐴 <<s 𝐶) → (𝐵 ∪ 𝐶) ⊆ No )
15		ssltsep 32231	. . . . 5 ⊢ (𝐴 <<s 𝐵 → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝑥 <s 𝑦)
16	15	adantr 468	. . . 4 ⊢ ((𝐴 <<s 𝐵 ∧ 𝐴 <<s 𝐶) → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝑥 <s 𝑦)
17		ssltsep 32231	. . . . 5 ⊢ (𝐴 <<s 𝐶 → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐶 𝑥 <s 𝑦)
18	17	adantl 469	. . . 4 ⊢ ((𝐴 <<s 𝐵 ∧ 𝐴 <<s 𝐶) → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐶 𝑥 <s 𝑦)
19		ralunb 4000	. . . . . 6 ⊢ (∀𝑦 ∈ (𝐵 ∪ 𝐶)𝑥 <s 𝑦 ↔ (∀𝑦 ∈ 𝐵 𝑥 <s 𝑦 ∧ ∀𝑦 ∈ 𝐶 𝑥 <s 𝑦))
20	19	ralbii 3175	. . . . 5 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ (𝐵 ∪ 𝐶)𝑥 <s 𝑦 ↔ ∀𝑥 ∈ 𝐴 (∀𝑦 ∈ 𝐵 𝑥 <s 𝑦 ∧ ∀𝑦 ∈ 𝐶 𝑥 <s 𝑦))
21		r19.26 3259	. . . . 5 ⊢ (∀𝑥 ∈ 𝐴 (∀𝑦 ∈ 𝐵 𝑥 <s 𝑦 ∧ ∀𝑦 ∈ 𝐶 𝑥 <s 𝑦) ↔ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝑥 <s 𝑦 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐶 𝑥 <s 𝑦))
22	20, 21	bitri 266	. . . 4 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ (𝐵 ∪ 𝐶)𝑥 <s 𝑦 ↔ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝑥 <s 𝑦 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐶 𝑥 <s 𝑦))
23	16, 18, 22	sylanbrc 574	. . 3 ⊢ ((𝐴 <<s 𝐵 ∧ 𝐴 <<s 𝐶) → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ (𝐵 ∪ 𝐶)𝑥 <s 𝑦)
24	9, 14, 23	3jca 1151	. 2 ⊢ ((𝐴 <<s 𝐵 ∧ 𝐴 <<s 𝐶) → (𝐴 ⊆ No ∧ (𝐵 ∪ 𝐶) ⊆ No ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ (𝐵 ∪ 𝐶)𝑥 <s 𝑦))
25		brsslt 32226	. 2 ⊢ (𝐴 <<s (𝐵 ∪ 𝐶) ↔ ((𝐴 ∈ V ∧ (𝐵 ∪ 𝐶) ∈ V) ∧ (𝐴 ⊆ No ∧ (𝐵 ∪ 𝐶) ⊆ No ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ (𝐵 ∪ 𝐶)𝑥 <s 𝑦)))
26	7, 24, 25	sylanbrc 574	1 ⊢ ((𝐴 <<s 𝐵 ∧ 𝐴 <<s 𝐶) → 𝐴 <<s (𝐵 ∪ 𝐶))

Syntax hints:   → wi 4   ∧ wa 384   ∧ w3a 1100   ∈ wcel 2157  ∀wral 3103  Vcvv 3398   ∪ cun 3774   ⊆ wss 3776   class class class wbr 4851   No csur 32119   <s cslt 32120   <<s csslt 32222

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1877  ax-4 1894  ax-5 2001  ax-6 2069  ax-7 2105  ax-8 2159  ax-9 2166  ax-10 2186  ax-11 2202  ax-12 2215  ax-13 2422  ax-ext 2791  ax-sep 4982  ax-nul 4990  ax-pr 5103  ax-un 7182

This theorem depends on definitions:  df-bi 198  df-an 385  df-or 866  df-3an 1102  df-tru 1641  df-ex 1860  df-nf 1864  df-sb 2062  df-mo 2635  df-eu 2638  df-clab 2800  df-cleq 2806  df-clel 2809  df-nfc 2944  df-ral 3108  df-rex 3109  df-rab 3112  df-v 3400  df-dif 3779  df-un 3781  df-in 3783  df-ss 3790  df-nul 4124  df-if 4287  df-sn 4378  df-pr 4380  df-op 4384  df-uni 4638  df-br 4852  df-opab 4914  df-xp 5324  df-sslt 32223

This theorem is referenced by:  scutun12  32243