| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > mapdom3 | Structured version Visualization version GIF version | ||
| Description: Set exponentiation dominates the base. (Contributed by Mario Carneiro, 30-Apr-2015.) (Proof shortened by AV, 17-Jul-2022.) |
| Ref | Expression |
|---|---|
| mapdom3 | ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐵 ≠ ∅) → 𝐴 ≼ (𝐴 ↑m 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | n0 4307 | . . 3 ⊢ (𝐵 ≠ ∅ ↔ ∃𝑥 𝑥 ∈ 𝐵) | |
| 2 | simp1 1154 | . . . . . . . 8 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝑥 ∈ 𝐵) → 𝐴 ∈ 𝑉) | |
| 3 | simp3 1156 | . . . . . . . 8 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝑥 ∈ 𝐵) → 𝑥 ∈ 𝐵) | |
| 4 | 2, 3 | mapsnend 9029 | . . . . . . 7 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝑥 ∈ 𝐵) → (𝐴 ↑m {𝑥}) ≈ 𝐴) |
| 5 | 4 | ensymd 8998 | . . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝑥 ∈ 𝐵) → 𝐴 ≈ (𝐴 ↑m {𝑥})) |
| 6 | simp2 1155 | . . . . . . . 8 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝑥 ∈ 𝐵) → 𝐵 ∈ 𝑊) | |
| 7 | 3 | snssd 4752 | . . . . . . . 8 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝑥 ∈ 𝐵) → {𝑥} ⊆ 𝐵) |
| 8 | ssdomg 8993 | . . . . . . . 8 ⊢ (𝐵 ∈ 𝑊 → ({𝑥} ⊆ 𝐵 → {𝑥} ≼ 𝐵)) | |
| 9 | 6, 7, 8 | sylc 66 | . . . . . . 7 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝑥 ∈ 𝐵) → {𝑥} ≼ 𝐵) |
| 10 | vex 3459 | . . . . . . . . 9 ⊢ 𝑥 ∈ V | |
| 11 | 10 | snnz 4742 | . . . . . . . 8 ⊢ {𝑥} ≠ ∅ |
| 12 | simpl 487 | . . . . . . . . 9 ⊢ (({𝑥} = ∅ ∧ 𝐴 = ∅) → {𝑥} = ∅) | |
| 13 | 12 | necon3ai 2983 | . . . . . . . 8 ⊢ ({𝑥} ≠ ∅ → ¬ ({𝑥} = ∅ ∧ 𝐴 = ∅)) |
| 14 | 11, 13 | ax-mp 5 | . . . . . . 7 ⊢ ¬ ({𝑥} = ∅ ∧ 𝐴 = ∅) |
| 15 | mapdom2 9132 | . . . . . . 7 ⊢ (({𝑥} ≼ 𝐵 ∧ ¬ ({𝑥} = ∅ ∧ 𝐴 = ∅)) → (𝐴 ↑m {𝑥}) ≼ (𝐴 ↑m 𝐵)) | |
| 16 | 9, 14, 15 | sylancl 597 | . . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝑥 ∈ 𝐵) → (𝐴 ↑m {𝑥}) ≼ (𝐴 ↑m 𝐵)) |
| 17 | endomtr 9005 | . . . . . 6 ⊢ ((𝐴 ≈ (𝐴 ↑m {𝑥}) ∧ (𝐴 ↑m {𝑥}) ≼ (𝐴 ↑m 𝐵)) → 𝐴 ≼ (𝐴 ↑m 𝐵)) | |
| 18 | 5, 16, 17 | syl2anc 595 | . . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝑥 ∈ 𝐵) → 𝐴 ≼ (𝐴 ↑m 𝐵)) |
| 19 | 18 | 3expia 1139 | . . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝑥 ∈ 𝐵 → 𝐴 ≼ (𝐴 ↑m 𝐵))) |
| 20 | 19 | exlimdv 1963 | . . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (∃𝑥 𝑥 ∈ 𝐵 → 𝐴 ≼ (𝐴 ↑m 𝐵))) |
| 21 | 1, 20 | biimtrid 245 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐵 ≠ ∅ → 𝐴 ≼ (𝐴 ↑m 𝐵))) |
| 22 | 21 | 3impia 1135 | 1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐵 ≠ ∅) → 𝐴 ≼ (𝐴 ↑m 𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 400 ∧ w3a 1103 = wceq 1570 ∃wex 1809 ∈ wcel 2143 ≠ wne 2958 ⊆ wss 3905 ∅c0 4286 {csn 4589 class class class wbr 5109 (class class class)co 7410 ↑m cmap 8820 ≈ cen 8936 ≼ cdom 8937 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-sep 5257 ax-nul 5269 ax-pow 5336 ax-pr 5404 ax-un 7732 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-ral 3080 df-rex 3090 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3745 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-nul 4287 df-if 4488 df-pw 4564 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4873 df-int 4913 df-iun 4958 df-br 5110 df-opab 5174 df-mpt 5193 df-id 5556 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-ov 7413 df-oprab 7414 df-mpo 7415 df-1st 7982 df-2nd 7983 df-er 8690 df-map 8822 df-en 8940 df-dom 8941 |
| This theorem is referenced by: infmap2 10196 |
| Copyright terms: Public domain | W3C validator |