| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ssslts2 | Structured version Visualization version GIF version | ||
| Description: Relation between surreal set less-than and subset. (Contributed by Scott Fenton, 9-Dec-2021.) |
| Ref | Expression |
|---|---|
| ssslts2 | ⊢ ((𝐴 <<s 𝐵 ∧ 𝐶 ⊆ 𝐵) → 𝐴 <<s 𝐶) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | sltsex1 27993 | . . 3 ⊢ (𝐴 <<s 𝐵 → 𝐴 ∈ V) | |
| 2 | 1 | adantr 486 | . 2 ⊢ ((𝐴 <<s 𝐵 ∧ 𝐶 ⊆ 𝐵) → 𝐴 ∈ V) |
| 3 | sltsex2 27994 | . . . 4 ⊢ (𝐴 <<s 𝐵 → 𝐵 ∈ V) | |
| 4 | 3 | adantr 486 | . . 3 ⊢ ((𝐴 <<s 𝐵 ∧ 𝐶 ⊆ 𝐵) → 𝐵 ∈ V) |
| 5 | simpr 490 | . . 3 ⊢ ((𝐴 <<s 𝐵 ∧ 𝐶 ⊆ 𝐵) → 𝐶 ⊆ 𝐵) | |
| 6 | 4, 5 | ssexd 5300 | . 2 ⊢ ((𝐴 <<s 𝐵 ∧ 𝐶 ⊆ 𝐵) → 𝐶 ∈ V) |
| 7 | sltsss1 27995 | . . . 4 ⊢ (𝐴 <<s 𝐵 → 𝐴 ⊆ No ) | |
| 8 | 7 | adantr 486 | . . 3 ⊢ ((𝐴 <<s 𝐵 ∧ 𝐶 ⊆ 𝐵) → 𝐴 ⊆ No ) |
| 9 | sltsss2 27996 | . . . . 5 ⊢ (𝐴 <<s 𝐵 → 𝐵 ⊆ No ) | |
| 10 | 9 | adantr 486 | . . . 4 ⊢ ((𝐴 <<s 𝐵 ∧ 𝐶 ⊆ 𝐵) → 𝐵 ⊆ No ) |
| 11 | 5, 10 | sstrd 3950 | . . 3 ⊢ ((𝐴 <<s 𝐵 ∧ 𝐶 ⊆ 𝐵) → 𝐶 ⊆ No ) |
| 12 | sltssep 27997 | . . . 4 ⊢ (𝐴 <<s 𝐵 → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝑥 <s 𝑦) | |
| 13 | ssralv 4009 | . . . . 5 ⊢ (𝐶 ⊆ 𝐵 → (∀𝑦 ∈ 𝐵 𝑥 <s 𝑦 → ∀𝑦 ∈ 𝐶 𝑥 <s 𝑦)) | |
| 14 | 13 | ralimdv 3182 | . . . 4 ⊢ (𝐶 ⊆ 𝐵 → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝑥 <s 𝑦 → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐶 𝑥 <s 𝑦)) |
| 15 | 12, 14 | mpan9 516 | . . 3 ⊢ ((𝐴 <<s 𝐵 ∧ 𝐶 ⊆ 𝐵) → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐶 𝑥 <s 𝑦) |
| 16 | 8, 11, 15 | 3jca 1146 | . 2 ⊢ ((𝐴 <<s 𝐵 ∧ 𝐶 ⊆ 𝐵) → (𝐴 ⊆ No ∧ 𝐶 ⊆ No ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐶 𝑥 <s 𝑦)) |
| 17 | brslts 27992 | . 2 ⊢ (𝐴 <<s 𝐶 ↔ ((𝐴 ∈ V ∧ 𝐶 ∈ V) ∧ (𝐴 ⊆ No ∧ 𝐶 ⊆ No ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐶 𝑥 <s 𝑦))) | |
| 18 | 2, 6, 16, 17 | syl21anbrc 1363 | 1 ⊢ ((𝐴 <<s 𝐵 ∧ 𝐶 ⊆ 𝐵) → 𝐴 <<s 𝐶) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 ∈ wcel 2146 ∀wral 3082 Vcvv 3458 ⊆ wss 3908 class class class wbr 5114 No csur 27841 <s clts 27842 <<s cslts 27987 |
| 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 2148 ax-9 2156 ax-ext 2738 ax-sep 5262 ax-pr 5409 |
| 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 2745 df-cleq 2758 df-clel 2841 df-ral 3083 df-rex 3093 df-rab 3420 df-v 3460 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-nul 4290 df-if 4493 df-sn 4595 df-pr 4597 df-op 4601 df-br 5115 df-opab 5179 df-xp 5672 df-slts 27988 |
| This theorem is used by: cutsun12 28020 eqcuts3 28034 cutmin 28165 cutminmax 28166 |
| Copyright terms: Public domain | W3C validator |