| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > domssl | Structured version Visualization version GIF version | ||
| Description: If 𝐴 is a subset of 𝐵 and 𝐶 dominates 𝐵, then 𝐶 also dominates 𝐴. (Contributed by BTernaryTau, 7-Dec-2024.) |
| Ref | Expression |
|---|---|
| domssl | ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐵 ≼ 𝐶) → 𝐴 ≼ 𝐶) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpr 484 | . 2 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐵 ≼ 𝐶) → 𝐵 ≼ 𝐶) | |
| 2 | reldom 8870 | . . . 4 ⊢ Rel ≼ | |
| 3 | 2 | brrelex12i 5669 | . . 3 ⊢ (𝐵 ≼ 𝐶 → (𝐵 ∈ V ∧ 𝐶 ∈ V)) |
| 4 | simpl 482 | . . . 4 ⊢ ((𝐴 ⊆ 𝐵 ∧ (𝐵 ∈ V ∧ 𝐶 ∈ V)) → 𝐴 ⊆ 𝐵) | |
| 5 | ssexg 5259 | . . . . 5 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ V) → 𝐴 ∈ V) | |
| 6 | 5 | adantrr 717 | . . . 4 ⊢ ((𝐴 ⊆ 𝐵 ∧ (𝐵 ∈ V ∧ 𝐶 ∈ V)) → 𝐴 ∈ V) |
| 7 | simprr 772 | . . . 4 ⊢ ((𝐴 ⊆ 𝐵 ∧ (𝐵 ∈ V ∧ 𝐶 ∈ V)) → 𝐶 ∈ V) | |
| 8 | 4, 6, 7 | jca32 515 | . . 3 ⊢ ((𝐴 ⊆ 𝐵 ∧ (𝐵 ∈ V ∧ 𝐶 ∈ V)) → (𝐴 ⊆ 𝐵 ∧ (𝐴 ∈ V ∧ 𝐶 ∈ V))) |
| 9 | 3, 8 | sylan2 593 | . 2 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐵 ≼ 𝐶) → (𝐴 ⊆ 𝐵 ∧ (𝐴 ∈ V ∧ 𝐶 ∈ V))) |
| 10 | brdomi 8877 | . . 3 ⊢ (𝐵 ≼ 𝐶 → ∃𝑓 𝑓:𝐵–1-1→𝐶) | |
| 11 | f1ssres 6722 | . . . . . 6 ⊢ ((𝑓:𝐵–1-1→𝐶 ∧ 𝐴 ⊆ 𝐵) → (𝑓 ↾ 𝐴):𝐴–1-1→𝐶) | |
| 12 | vex 3438 | . . . . . . . . 9 ⊢ 𝑓 ∈ V | |
| 13 | 12 | resex 5975 | . . . . . . . 8 ⊢ (𝑓 ↾ 𝐴) ∈ V |
| 14 | f1dom4g 8883 | . . . . . . . 8 ⊢ ((((𝑓 ↾ 𝐴) ∈ V ∧ 𝐴 ∈ V ∧ 𝐶 ∈ V) ∧ (𝑓 ↾ 𝐴):𝐴–1-1→𝐶) → 𝐴 ≼ 𝐶) | |
| 15 | 13, 14 | mp3anl1 1457 | . . . . . . 7 ⊢ (((𝐴 ∈ V ∧ 𝐶 ∈ V) ∧ (𝑓 ↾ 𝐴):𝐴–1-1→𝐶) → 𝐴 ≼ 𝐶) |
| 16 | 15 | ancoms 458 | . . . . . 6 ⊢ (((𝑓 ↾ 𝐴):𝐴–1-1→𝐶 ∧ (𝐴 ∈ V ∧ 𝐶 ∈ V)) → 𝐴 ≼ 𝐶) |
| 17 | 11, 16 | sylan 580 | . . . . 5 ⊢ (((𝑓:𝐵–1-1→𝐶 ∧ 𝐴 ⊆ 𝐵) ∧ (𝐴 ∈ V ∧ 𝐶 ∈ V)) → 𝐴 ≼ 𝐶) |
| 18 | 17 | expl 457 | . . . 4 ⊢ (𝑓:𝐵–1-1→𝐶 → ((𝐴 ⊆ 𝐵 ∧ (𝐴 ∈ V ∧ 𝐶 ∈ V)) → 𝐴 ≼ 𝐶)) |
| 19 | 18 | exlimiv 1931 | . . 3 ⊢ (∃𝑓 𝑓:𝐵–1-1→𝐶 → ((𝐴 ⊆ 𝐵 ∧ (𝐴 ∈ V ∧ 𝐶 ∈ V)) → 𝐴 ≼ 𝐶)) |
| 20 | 10, 19 | syl 17 | . 2 ⊢ (𝐵 ≼ 𝐶 → ((𝐴 ⊆ 𝐵 ∧ (𝐴 ∈ V ∧ 𝐶 ∈ V)) → 𝐴 ≼ 𝐶)) |
| 21 | 1, 9, 20 | sylc 65 | 1 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐵 ≼ 𝐶) → 𝐴 ≼ 𝐶) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∃wex 1780 ∈ wcel 2110 Vcvv 3434 ⊆ wss 3900 class class class wbr 5089 ↾ cres 5616 –1-1→wf1 6474 ≼ cdom 8862 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2112 ax-9 2120 ax-ext 2702 ax-sep 5232 ax-nul 5242 ax-pr 5368 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-sb 2067 df-clab 2709 df-cleq 2722 df-clel 2804 df-ral 3046 df-rex 3055 df-rab 3394 df-v 3436 df-dif 3903 df-un 3905 df-in 3907 df-ss 3917 df-nul 4282 df-if 4474 df-sn 4575 df-pr 4577 df-op 4581 df-br 5090 df-opab 5152 df-xp 5620 df-rel 5621 df-cnv 5622 df-co 5623 df-dm 5624 df-rn 5625 df-res 5626 df-fun 6479 df-fn 6480 df-f 6481 df-f1 6482 df-dom 8866 |
| This theorem is referenced by: ssct 8966 1sdom2dom 9133 |
| Copyright terms: Public domain | W3C validator |