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

Theorem sltsun2 28062
Description: Union law for surreal set less-than. (Contributed by Scott Fenton, 9-Dec-2021.)
Assertion
Ref Expression
sltsun2 ((𝐴 <<s 𝐵𝐴 <<s 𝐶) → 𝐴 <<s (𝐵𝐶))

Proof of Theorem sltsun2
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 sltsex1 28036 . . 3 (𝐴 <<s 𝐵𝐴 ∈ V)
21adantr 486 . 2 ((𝐴 <<s 𝐵𝐴 <<s 𝐶) → 𝐴 ∈ V)
3 sltsex2 28037 . . . 4 (𝐴 <<s 𝐵𝐵 ∈ V)
43adantr 486 . . 3 ((𝐴 <<s 𝐵𝐴 <<s 𝐶) → 𝐵 ∈ V)
5 sltsex2 28037 . . . 4 (𝐴 <<s 𝐶𝐶 ∈ V)
65adantl 487 . . 3 ((𝐴 <<s 𝐵𝐴 <<s 𝐶) → 𝐶 ∈ V)
74, 6unexd 7757 . 2 ((𝐴 <<s 𝐵𝐴 <<s 𝐶) → (𝐵𝐶) ∈ V)
8 sltsss1 28038 . . 3 (𝐴 <<s 𝐵𝐴 No )
98adantr 486 . 2 ((𝐴 <<s 𝐵𝐴 <<s 𝐶) → 𝐴 No )
10 sltsss2 28039 . . . 4 (𝐴 <<s 𝐵𝐵 No )
1110adantr 486 . . 3 ((𝐴 <<s 𝐵𝐴 <<s 𝐶) → 𝐵 No )
12 sltsss2 28039 . . . 4 (𝐴 <<s 𝐶𝐶 No )
1312adantl 487 . . 3 ((𝐴 <<s 𝐵𝐴 <<s 𝐶) → 𝐶 No )
1411, 13unssd 4141 . 2 ((𝐴 <<s 𝐵𝐴 <<s 𝐶) → (𝐵𝐶) ⊆ No )
15 elun 4103 . . . 4 (𝑦 ∈ (𝐵𝐶) ↔ (𝑦𝐵𝑦𝐶))
16 sltssepc 28044 . . . . . . . 8 ((𝐴 <<s 𝐵𝑥𝐴𝑦𝐵) → 𝑥 <s 𝑦)
17163exp 1137 . . . . . . 7 (𝐴 <<s 𝐵 → (𝑥𝐴 → (𝑦𝐵𝑥 <s 𝑦)))
1817adantr 486 . . . . . 6 ((𝐴 <<s 𝐵𝐴 <<s 𝐶) → (𝑥𝐴 → (𝑦𝐵𝑥 <s 𝑦)))
1918com3r 88 . . . . 5 (𝑦𝐵 → ((𝐴 <<s 𝐵𝐴 <<s 𝐶) → (𝑥𝐴𝑥 <s 𝑦)))
20 sltssepc 28044 . . . . . . . 8 ((𝐴 <<s 𝐶𝑥𝐴𝑦𝐶) → 𝑥 <s 𝑦)
21203exp 1137 . . . . . . 7 (𝐴 <<s 𝐶 → (𝑥𝐴 → (𝑦𝐶𝑥 <s 𝑦)))
2221adantl 487 . . . . . 6 ((𝐴 <<s 𝐵𝐴 <<s 𝐶) → (𝑥𝐴 → (𝑦𝐶𝑥 <s 𝑦)))
2322com3r 88 . . . . 5 (𝑦𝐶 → ((𝐴 <<s 𝐵𝐴 <<s 𝐶) → (𝑥𝐴𝑥 <s 𝑦)))
2419, 23jaoi 871 . . . 4 ((𝑦𝐵𝑦𝐶) → ((𝐴 <<s 𝐵𝐴 <<s 𝐶) → (𝑥𝐴𝑥 <s 𝑦)))
2515, 24sylbi 220 . . 3 (𝑦 ∈ (𝐵𝐶) → ((𝐴 <<s 𝐵𝐴 <<s 𝐶) → (𝑥𝐴𝑥 <s 𝑦)))
26253imp231 1130 . 2 (((𝐴 <<s 𝐵𝐴 <<s 𝐶) ∧ 𝑥𝐴𝑦 ∈ (𝐵𝐶)) → 𝑥 <s 𝑦)
272, 7, 9, 14, 26sltsd 28041 1 ((𝐴 <<s 𝐵𝐴 <<s 𝐶) → 𝐴 <<s (𝐵𝐶))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 401  wo 861  wcel 2145  Vcvv 3453  cun 3900  wss 3902   class class class wbr 5107   No csur 27884   <s clts 27885   <<s cslts 28030
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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2734  ax-sep 5255  ax-pr 5402  ax-un 7740
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 2100  df-clab 2741  df-cleq 2754  df-clel 2837  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-br 5108  df-opab 5172  df-xp 5665  df-slts 28031
This theorem is used by:  cutsun12  28063
  Copyright terms: Public domain W3C validator