![]() |
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 4346 | . . 3 ⊢ (𝐵 ≠ ∅ ↔ ∃𝑥 𝑥 ∈ 𝐵) | |
2 | simp1 1136 | . . . . . . . 8 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝑥 ∈ 𝐵) → 𝐴 ∈ 𝑉) | |
3 | simp3 1138 | . . . . . . . 8 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝑥 ∈ 𝐵) → 𝑥 ∈ 𝐵) | |
4 | 2, 3 | mapsnend 9038 | . . . . . . 7 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝑥 ∈ 𝐵) → (𝐴 ↑m {𝑥}) ≈ 𝐴) |
5 | 4 | ensymd 9003 | . . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝑥 ∈ 𝐵) → 𝐴 ≈ (𝐴 ↑m {𝑥})) |
6 | simp2 1137 | . . . . . . . 8 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝑥 ∈ 𝐵) → 𝐵 ∈ 𝑊) | |
7 | 3 | snssd 4812 | . . . . . . . 8 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝑥 ∈ 𝐵) → {𝑥} ⊆ 𝐵) |
8 | ssdomg 8998 | . . . . . . . 8 ⊢ (𝐵 ∈ 𝑊 → ({𝑥} ⊆ 𝐵 → {𝑥} ≼ 𝐵)) | |
9 | 6, 7, 8 | sylc 65 | . . . . . . 7 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝑥 ∈ 𝐵) → {𝑥} ≼ 𝐵) |
10 | vex 3478 | . . . . . . . . 9 ⊢ 𝑥 ∈ V | |
11 | 10 | snnz 4780 | . . . . . . . 8 ⊢ {𝑥} ≠ ∅ |
12 | simpl 483 | . . . . . . . . 9 ⊢ (({𝑥} = ∅ ∧ 𝐴 = ∅) → {𝑥} = ∅) | |
13 | 12 | necon3ai 2965 | . . . . . . . 8 ⊢ ({𝑥} ≠ ∅ → ¬ ({𝑥} = ∅ ∧ 𝐴 = ∅)) |
14 | 11, 13 | ax-mp 5 | . . . . . . 7 ⊢ ¬ ({𝑥} = ∅ ∧ 𝐴 = ∅) |
15 | mapdom2 9150 | . . . . . . 7 ⊢ (({𝑥} ≼ 𝐵 ∧ ¬ ({𝑥} = ∅ ∧ 𝐴 = ∅)) → (𝐴 ↑m {𝑥}) ≼ (𝐴 ↑m 𝐵)) | |
16 | 9, 14, 15 | sylancl 586 | . . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝑥 ∈ 𝐵) → (𝐴 ↑m {𝑥}) ≼ (𝐴 ↑m 𝐵)) |
17 | endomtr 9010 | . . . . . 6 ⊢ ((𝐴 ≈ (𝐴 ↑m {𝑥}) ∧ (𝐴 ↑m {𝑥}) ≼ (𝐴 ↑m 𝐵)) → 𝐴 ≼ (𝐴 ↑m 𝐵)) | |
18 | 5, 16, 17 | syl2anc 584 | . . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝑥 ∈ 𝐵) → 𝐴 ≼ (𝐴 ↑m 𝐵)) |
19 | 18 | 3expia 1121 | . . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝑥 ∈ 𝐵 → 𝐴 ≼ (𝐴 ↑m 𝐵))) |
20 | 19 | exlimdv 1936 | . . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (∃𝑥 𝑥 ∈ 𝐵 → 𝐴 ≼ (𝐴 ↑m 𝐵))) |
21 | 1, 20 | biimtrid 241 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐵 ≠ ∅ → 𝐴 ≼ (𝐴 ↑m 𝐵))) |
22 | 21 | 3impia 1117 | 1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐵 ≠ ∅) → 𝐴 ≼ (𝐴 ↑m 𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 396 ∧ w3a 1087 = wceq 1541 ∃wex 1781 ∈ wcel 2106 ≠ wne 2940 ⊆ wss 3948 ∅c0 4322 {csn 4628 class class class wbr 5148 (class class class)co 7411 ↑m cmap 8822 ≈ cen 8938 ≼ cdom 8939 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2703 ax-sep 5299 ax-nul 5306 ax-pow 5363 ax-pr 5427 ax-un 7727 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2534 df-eu 2563 df-clab 2710 df-cleq 2724 df-clel 2810 df-nfc 2885 df-ne 2941 df-ral 3062 df-rex 3071 df-reu 3377 df-rab 3433 df-v 3476 df-sbc 3778 df-csb 3894 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-nul 4323 df-if 4529 df-pw 4604 df-sn 4629 df-pr 4631 df-op 4635 df-uni 4909 df-int 4951 df-iun 4999 df-br 5149 df-opab 5211 df-mpt 5232 df-id 5574 df-xp 5682 df-rel 5683 df-cnv 5684 df-co 5685 df-dm 5686 df-rn 5687 df-res 5688 df-ima 5689 df-iota 6495 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-ov 7414 df-oprab 7415 df-mpo 7416 df-1st 7977 df-2nd 7978 df-er 8705 df-map 8824 df-en 8942 df-dom 8943 |
This theorem is referenced by: infmap2 10215 |
Copyright terms: Public domain | W3C validator |