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 mantissa. (Contributed by Mario Carneiro, 30-Apr-2015.) |
Ref | Expression |
---|---|
mapdom3 | ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐵 ≠ ∅) → 𝐴 ≼ (𝐴 ↑𝑚 𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | n0 3890 | . . 3 ⊢ (𝐵 ≠ ∅ ↔ ∃𝑥 𝑥 ∈ 𝐵) | |
2 | oveq1 6556 | . . . . . . . . . 10 ⊢ (𝑦 = 𝐴 → (𝑦 ↑𝑚 {𝑥}) = (𝐴 ↑𝑚 {𝑥})) | |
3 | id 22 | . . . . . . . . . 10 ⊢ (𝑦 = 𝐴 → 𝑦 = 𝐴) | |
4 | 2, 3 | breq12d 4596 | . . . . . . . . 9 ⊢ (𝑦 = 𝐴 → ((𝑦 ↑𝑚 {𝑥}) ≈ 𝑦 ↔ (𝐴 ↑𝑚 {𝑥}) ≈ 𝐴)) |
5 | vex 3176 | . . . . . . . . . 10 ⊢ 𝑦 ∈ V | |
6 | vex 3176 | . . . . . . . . . 10 ⊢ 𝑥 ∈ V | |
7 | 5, 6 | mapsnen 7920 | . . . . . . . . 9 ⊢ (𝑦 ↑𝑚 {𝑥}) ≈ 𝑦 |
8 | 4, 7 | vtoclg 3239 | . . . . . . . 8 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ↑𝑚 {𝑥}) ≈ 𝐴) |
9 | 8 | 3ad2ant1 1075 | . . . . . . 7 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝑥 ∈ 𝐵) → (𝐴 ↑𝑚 {𝑥}) ≈ 𝐴) |
10 | 9 | ensymd 7893 | . . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝑥 ∈ 𝐵) → 𝐴 ≈ (𝐴 ↑𝑚 {𝑥})) |
11 | simp2 1055 | . . . . . . . 8 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝑥 ∈ 𝐵) → 𝐵 ∈ 𝑊) | |
12 | simp3 1056 | . . . . . . . . 9 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝑥 ∈ 𝐵) → 𝑥 ∈ 𝐵) | |
13 | 12 | snssd 4281 | . . . . . . . 8 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝑥 ∈ 𝐵) → {𝑥} ⊆ 𝐵) |
14 | ssdomg 7887 | . . . . . . . 8 ⊢ (𝐵 ∈ 𝑊 → ({𝑥} ⊆ 𝐵 → {𝑥} ≼ 𝐵)) | |
15 | 11, 13, 14 | sylc 63 | . . . . . . 7 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝑥 ∈ 𝐵) → {𝑥} ≼ 𝐵) |
16 | 6 | snnz 4252 | . . . . . . . 8 ⊢ {𝑥} ≠ ∅ |
17 | simpl 472 | . . . . . . . . 9 ⊢ (({𝑥} = ∅ ∧ 𝐴 = ∅) → {𝑥} = ∅) | |
18 | 17 | necon3ai 2807 | . . . . . . . 8 ⊢ ({𝑥} ≠ ∅ → ¬ ({𝑥} = ∅ ∧ 𝐴 = ∅)) |
19 | 16, 18 | ax-mp 5 | . . . . . . 7 ⊢ ¬ ({𝑥} = ∅ ∧ 𝐴 = ∅) |
20 | mapdom2 8016 | . . . . . . 7 ⊢ (({𝑥} ≼ 𝐵 ∧ ¬ ({𝑥} = ∅ ∧ 𝐴 = ∅)) → (𝐴 ↑𝑚 {𝑥}) ≼ (𝐴 ↑𝑚 𝐵)) | |
21 | 15, 19, 20 | sylancl 693 | . . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝑥 ∈ 𝐵) → (𝐴 ↑𝑚 {𝑥}) ≼ (𝐴 ↑𝑚 𝐵)) |
22 | endomtr 7900 | . . . . . 6 ⊢ ((𝐴 ≈ (𝐴 ↑𝑚 {𝑥}) ∧ (𝐴 ↑𝑚 {𝑥}) ≼ (𝐴 ↑𝑚 𝐵)) → 𝐴 ≼ (𝐴 ↑𝑚 𝐵)) | |
23 | 10, 21, 22 | syl2anc 691 | . . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝑥 ∈ 𝐵) → 𝐴 ≼ (𝐴 ↑𝑚 𝐵)) |
24 | 23 | 3expia 1259 | . . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝑥 ∈ 𝐵 → 𝐴 ≼ (𝐴 ↑𝑚 𝐵))) |
25 | 24 | exlimdv 1848 | . . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (∃𝑥 𝑥 ∈ 𝐵 → 𝐴 ≼ (𝐴 ↑𝑚 𝐵))) |
26 | 1, 25 | syl5bi 231 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐵 ≠ ∅ → 𝐴 ≼ (𝐴 ↑𝑚 𝐵))) |
27 | 26 | 3impia 1253 | 1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐵 ≠ ∅) → 𝐴 ≼ (𝐴 ↑𝑚 𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 383 ∧ w3a 1031 = wceq 1475 ∃wex 1695 ∈ wcel 1977 ≠ wne 2780 ⊆ wss 3540 ∅c0 3874 {csn 4125 class class class wbr 4583 (class class class)co 6549 ↑𝑚 cmap 7744 ≈ cen 7838 ≼ cdom 7839 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-un 6847 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-ral 2901 df-rex 2902 df-reu 2903 df-rab 2905 df-v 3175 df-sbc 3403 df-csb 3500 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-nul 3875 df-if 4037 df-pw 4110 df-sn 4126 df-pr 4128 df-op 4132 df-uni 4373 df-int 4411 df-iun 4457 df-br 4584 df-opab 4644 df-mpt 4645 df-id 4953 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-iota 5768 df-fun 5806 df-fn 5807 df-f 5808 df-f1 5809 df-fo 5810 df-f1o 5811 df-fv 5812 df-ov 6552 df-oprab 6553 df-mpt2 6554 df-1st 7059 df-2nd 7060 df-er 7629 df-map 7746 df-en 7842 df-dom 7843 |
This theorem is referenced by: infmap2 8923 |
Copyright terms: Public domain | W3C validator |