| 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 489 | . 2 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐵 ≼ 𝐶) → 𝐵 ≼ 𝐶) | |
| 2 | reldom 8947 | . . . 4 ⊢ Rel ≼ | |
| 3 | 2 | brrelex12i 5715 | . . 3 ⊢ (𝐵 ≼ 𝐶 → (𝐵 ∈ V ∧ 𝐶 ∈ V)) |
| 4 | simpl 487 | . . . 4 ⊢ ((𝐴 ⊆ 𝐵 ∧ (𝐵 ∈ V ∧ 𝐶 ∈ V)) → 𝐴 ⊆ 𝐵) | |
| 5 | ssexg 5289 | . . . . 5 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ V) → 𝐴 ∈ V) | |
| 6 | 5 | adantrr 729 | . . . 4 ⊢ ((𝐴 ⊆ 𝐵 ∧ (𝐵 ∈ V ∧ 𝐶 ∈ V)) → 𝐴 ∈ V) |
| 7 | simprr 784 | . . . 4 ⊢ ((𝐴 ⊆ 𝐵 ∧ (𝐵 ∈ V ∧ 𝐶 ∈ V)) → 𝐶 ∈ V) | |
| 8 | 4, 6, 7 | jca32 524 | . . 3 ⊢ ((𝐴 ⊆ 𝐵 ∧ (𝐵 ∈ V ∧ 𝐶 ∈ V)) → (𝐴 ⊆ 𝐵 ∧ (𝐴 ∈ V ∧ 𝐶 ∈ V))) |
| 9 | 3, 8 | sylan2 604 | . 2 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐵 ≼ 𝐶) → (𝐴 ⊆ 𝐵 ∧ (𝐴 ∈ V ∧ 𝐶 ∈ V))) |
| 10 | brdomi 8954 | . . 3 ⊢ (𝐵 ≼ 𝐶 → ∃𝑓 𝑓:𝐵–1-1→𝐶) | |
| 11 | f1ssres 6783 | . . . . . 6 ⊢ ((𝑓:𝐵–1-1→𝐶 ∧ 𝐴 ⊆ 𝐵) → (𝑓 ↾ 𝐴):𝐴–1-1→𝐶) | |
| 12 | vex 3458 | . . . . . . . . 9 ⊢ 𝑓 ∈ V | |
| 13 | 12 | resex 6027 | . . . . . . . 8 ⊢ (𝑓 ↾ 𝐴) ∈ V |
| 14 | f1dom4g 8960 | . . . . . . . 8 ⊢ ((((𝑓 ↾ 𝐴) ∈ V ∧ 𝐴 ∈ V ∧ 𝐶 ∈ V) ∧ (𝑓 ↾ 𝐴):𝐴–1-1→𝐶) → 𝐴 ≼ 𝐶) | |
| 15 | 13, 14 | mp3anl1 1483 | . . . . . . 7 ⊢ (((𝐴 ∈ V ∧ 𝐶 ∈ V) ∧ (𝑓 ↾ 𝐴):𝐴–1-1→𝐶) → 𝐴 ≼ 𝐶) |
| 16 | 15 | ancoms 463 | . . . . . 6 ⊢ (((𝑓 ↾ 𝐴):𝐴–1-1→𝐶 ∧ (𝐴 ∈ V ∧ 𝐶 ∈ V)) → 𝐴 ≼ 𝐶) |
| 17 | 11, 16 | sylan 591 | . . . . 5 ⊢ (((𝑓:𝐵–1-1→𝐶 ∧ 𝐴 ⊆ 𝐵) ∧ (𝐴 ∈ V ∧ 𝐶 ∈ V)) → 𝐴 ≼ 𝐶) |
| 18 | 17 | expl 462 | . . . 4 ⊢ (𝑓:𝐵–1-1→𝐶 → ((𝐴 ⊆ 𝐵 ∧ (𝐴 ∈ V ∧ 𝐶 ∈ V)) → 𝐴 ≼ 𝐶)) |
| 19 | 18 | exlimiv 1959 | . . 3 ⊢ (∃𝑓 𝑓:𝐵–1-1→𝐶 → ((𝐴 ⊆ 𝐵 ∧ (𝐴 ∈ V ∧ 𝐶 ∈ V)) → 𝐴 ≼ 𝐶)) |
| 20 | 10, 19 | syl 18 | . 2 ⊢ (𝐵 ≼ 𝐶 → ((𝐴 ⊆ 𝐵 ∧ (𝐴 ∈ V ∧ 𝐶 ∈ V)) → 𝐴 ≼ 𝐶)) |
| 21 | 1, 9, 20 | sylc 66 | 1 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐵 ≼ 𝐶) → 𝐴 ≼ 𝐶) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 400 ∃wex 1808 ∈ wcel 2142 Vcvv 3454 ⊆ wss 3904 class class class wbr 5108 ↾ cres 5662 –1-1→wf1 6533 ≼ cdom 8939 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-8 2144 ax-9 2152 ax-ext 2734 ax-sep 5256 ax-pr 5403 |
| This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1104 df-tru 1572 df-fal 1582 df-ex 1809 df-sb 2096 df-clab 2741 df-cleq 2754 df-clel 2837 df-ral 3079 df-rex 3089 df-rab 3416 df-v 3456 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-nul 4286 df-if 4487 df-sn 4589 df-pr 4591 df-op 4595 df-br 5109 df-opab 5173 df-xp 5666 df-rel 5667 df-cnv 5668 df-co 5669 df-dm 5670 df-rn 5671 df-res 5672 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-dom 8943 |
| This theorem is used by: ssct 9044 1sdom2dom 9212 |
| Copyright terms: Public domain | W3C validator |