| 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 4303 | . . 3 ⊢ (𝐵 ≠ ∅ ↔ ∃𝑥 𝑥 ∈ 𝐵) | |
| 2 | simp1 1154 | . . . . . . . 8 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝑥 ∈ 𝐵) → 𝐴 ∈ 𝑉) | |
| 3 | simp3 1156 | . . . . . . . 8 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝑥 ∈ 𝐵) → 𝑥 ∈ 𝐵) | |
| 4 | 2, 3 | mapsnend 9046 | . . . . . . 7 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝑥 ∈ 𝐵) → (𝐴 ↑m {𝑥}) ≈ 𝐴) |
| 5 | 4 | ensymd 9014 | . . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝑥 ∈ 𝐵) → 𝐴 ≈ (𝐴 ↑m {𝑥})) |
| 6 | simp2 1155 | . . . . . . . 8 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝑥 ∈ 𝐵) → 𝐵 ∈ 𝑊) | |
| 7 | 3 | snssd 4750 | . . . . . . . 8 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝑥 ∈ 𝐵) → {𝑥} ⊆ 𝐵) |
| 8 | ssdomg 9009 | . . . . . . . 8 ⊢ (𝐵 ∈ 𝑊 → ({𝑥} ⊆ 𝐵 → {𝑥} ≼ 𝐵)) | |
| 9 | 6, 7, 8 | sylc 66 | . . . . . . 7 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝑥 ∈ 𝐵) → {𝑥} ≼ 𝐵) |
| 10 | vex 3457 | . . . . . . . . 9 ⊢ 𝑥 ∈ V | |
| 11 | 10 | snnz 4740 | . . . . . . . 8 ⊢ {𝑥} ≠ ∅ |
| 12 | simpl 488 | . . . . . . . . 9 ⊢ (({𝑥} = ∅ ∧ 𝐴 = ∅) → {𝑥} = ∅) | |
| 13 | 12 | necon3ai 2982 | . . . . . . . 8 ⊢ ({𝑥} ≠ ∅ → ¬ ({𝑥} = ∅ ∧ 𝐴 = ∅)) |
| 14 | 11, 13 | ax-mp 5 | . . . . . . 7 ⊢ ¬ ({𝑥} = ∅ ∧ 𝐴 = ∅) |
| 15 | mapdom2 9149 | . . . . . . 7 ⊢ (({𝑥} ≼ 𝐵 ∧ ¬ ({𝑥} = ∅ ∧ 𝐴 = ∅)) → (𝐴 ↑m {𝑥}) ≼ (𝐴 ↑m 𝐵)) | |
| 16 | 9, 14, 15 | sylancl 598 | . . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝑥 ∈ 𝐵) → (𝐴 ↑m {𝑥}) ≼ (𝐴 ↑m 𝐵)) |
| 17 | endomtr 9021 | . . . . . 6 ⊢ ((𝐴 ≈ (𝐴 ↑m {𝑥}) ∧ (𝐴 ↑m {𝑥}) ≼ (𝐴 ↑m 𝐵)) → 𝐴 ≼ (𝐴 ↑m 𝐵)) | |
| 18 | 5, 16, 17 | syl2anc 596 | . . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝑥 ∈ 𝐵) → 𝐴 ≼ (𝐴 ↑m 𝐵)) |
| 19 | 18 | 3expia 1139 | . . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝑥 ∈ 𝐵 → 𝐴 ≼ (𝐴 ↑m 𝐵))) |
| 20 | 19 | exlimdv 1966 | . . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (∃𝑥 𝑥 ∈ 𝐵 → 𝐴 ≼ (𝐴 ↑m 𝐵))) |
| 21 | 1, 20 | biimtrid 245 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐵 ≠ ∅ → 𝐴 ≼ (𝐴 ↑m 𝐵))) |
| 22 | 21 | 3impia 1135 | 1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐵 ≠ ∅) → 𝐴 ≼ (𝐴 ↑m 𝐵)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∃wex 1812 ∈ wcel 2145 ≠ wne 2957 ⊆ wss 3902 ∅c0 4282 {csn 4587 class class class wbr 5107 (class class class)co 7416 ↑m cmap 8829 ≈ cen 8952 ≼ cdom 8953 |
| 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-10 2178 ax-11 2194 ax-12 2215 ax-ext 2734 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 ax-un 7739 |
| 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-nf 1817 df-sb 2100 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3079 df-rex 3089 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-int 4911 df-iun 4956 df-br 5108 df-opab 5172 df-mpt 5191 df-id 5554 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-ov 7419 df-oprab 7420 df-mpo 7421 df-1st 7989 df-2nd 7990 df-er 8699 df-map 8831 df-en 8956 df-dom 8957 |
| This theorem is used by: infmap2 10222 |
| Copyright terms: Public domain | W3C validator |