| 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 4315 | . . 3 ⊢ (𝐵 ≠ ∅ ↔ ∃𝑥 𝑥 ∈ 𝐵) | |
| 2 | simp1 1152 | . . . . . . . 8 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝑥 ∈ 𝐵) → 𝐴 ∈ 𝑉) | |
| 3 | simp3 1154 | . . . . . . . 8 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝑥 ∈ 𝐵) → 𝑥 ∈ 𝐵) | |
| 4 | 2, 3 | mapsnend 9032 | . . . . . . 7 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝑥 ∈ 𝐵) → (𝐴 ↑m {𝑥}) ≈ 𝐴) |
| 5 | 4 | ensymd 9001 | . . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝑥 ∈ 𝐵) → 𝐴 ≈ (𝐴 ↑m {𝑥})) |
| 6 | simp2 1153 | . . . . . . . 8 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝑥 ∈ 𝐵) → 𝐵 ∈ 𝑊) | |
| 7 | 3 | snssd 4757 | . . . . . . . 8 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝑥 ∈ 𝐵) → {𝑥} ⊆ 𝐵) |
| 8 | ssdomg 8996 | . . . . . . . 8 ⊢ (𝐵 ∈ 𝑊 → ({𝑥} ⊆ 𝐵 → {𝑥} ≼ 𝐵)) | |
| 9 | 6, 7, 8 | sylc 66 | . . . . . . 7 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝑥 ∈ 𝐵) → {𝑥} ≼ 𝐵) |
| 10 | vex 3467 | . . . . . . . . 9 ⊢ 𝑥 ∈ V | |
| 11 | 10 | snnz 4747 | . . . . . . . 8 ⊢ {𝑥} ≠ ∅ |
| 12 | simpl 487 | . . . . . . . . 9 ⊢ (({𝑥} = ∅ ∧ 𝐴 = ∅) → {𝑥} = ∅) | |
| 13 | 12 | necon3ai 2989 | . . . . . . . 8 ⊢ ({𝑥} ≠ ∅ → ¬ ({𝑥} = ∅ ∧ 𝐴 = ∅)) |
| 14 | 11, 13 | ax-mp 5 | . . . . . . 7 ⊢ ¬ ({𝑥} = ∅ ∧ 𝐴 = ∅) |
| 15 | mapdom2 9135 | . . . . . . 7 ⊢ (({𝑥} ≼ 𝐵 ∧ ¬ ({𝑥} = ∅ ∧ 𝐴 = ∅)) → (𝐴 ↑m {𝑥}) ≼ (𝐴 ↑m 𝐵)) | |
| 16 | 9, 14, 15 | sylancl 597 | . . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝑥 ∈ 𝐵) → (𝐴 ↑m {𝑥}) ≼ (𝐴 ↑m 𝐵)) |
| 17 | endomtr 9008 | . . . . . 6 ⊢ ((𝐴 ≈ (𝐴 ↑m {𝑥}) ∧ (𝐴 ↑m {𝑥}) ≼ (𝐴 ↑m 𝐵)) → 𝐴 ≼ (𝐴 ↑m 𝐵)) | |
| 18 | 5, 16, 17 | syl2anc 595 | . . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝑥 ∈ 𝐵) → 𝐴 ≼ (𝐴 ↑m 𝐵)) |
| 19 | 18 | 3expia 1137 | . . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝑥 ∈ 𝐵 → 𝐴 ≼ (𝐴 ↑m 𝐵))) |
| 20 | 19 | exlimdv 1960 | . . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (∃𝑥 𝑥 ∈ 𝐵 → 𝐴 ≼ (𝐴 ↑m 𝐵))) |
| 21 | 1, 20 | biimtrid 245 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐵 ≠ ∅ → 𝐴 ≼ (𝐴 ↑m 𝐵))) |
| 22 | 21 | 3impia 1133 | 1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐵 ≠ ∅) → 𝐴 ≼ (𝐴 ↑m 𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 400 ∧ w3a 1101 = wceq 1567 ∃wex 1806 ∈ wcel 2149 ≠ wne 2964 ⊆ wss 3913 ∅c0 4294 {csn 4594 class class class wbr 5113 (class class class)co 7411 ↑m cmap 8823 ≈ cen 8939 ≼ cdom 8940 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-sep 5261 ax-nul 5271 ax-pow 5337 ax-pr 5405 ax-un 7733 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-ral 3086 df-rex 3096 df-reu 3377 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4877 df-int 4917 df-iun 4962 df-br 5114 df-opab 5178 df-mpt 5197 df-id 5557 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-res 5674 df-ima 5675 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 7414 df-oprab 7415 df-mpo 7416 df-1st 7985 df-2nd 7986 df-er 8693 df-map 8825 df-en 8943 df-dom 8944 |
| This theorem is referenced by: infmap2 10199 |
| Copyright terms: Public domain | W3C validator |