| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > snmapen | Structured version Visualization version GIF version | ||
| Description: Set exponentiation: a singleton to any set is equinumerous to that singleton. (Contributed by NM, 17-Dec-2003.) (Revised by AV, 17-Jul-2022.) |
| Ref | Expression |
|---|---|
| snmapen | ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ({𝐴} ↑m 𝐵) ≈ {𝐴}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ovexd 7451 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ({𝐴} ↑m 𝐵) ∈ V) | |
| 2 | snex 5408 | . . 3 ⊢ {𝐴} ∈ V | |
| 3 | 2 | a1i 11 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → {𝐴} ∈ V) |
| 4 | simpl 488 | . . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → 𝐴 ∈ 𝑉) | |
| 5 | 4 | a1d 26 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝑥 ∈ ({𝐴} ↑m 𝐵) → 𝐴 ∈ 𝑉)) |
| 6 | 2 | a1i 11 | . . . . 5 ⊢ (𝐴 ∈ 𝑉 → {𝐴} ∈ V) |
| 7 | 6 | anim1ci 628 | . . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐵 ∈ 𝑊 ∧ {𝐴} ∈ V)) |
| 8 | xpexg 7752 | . . . 4 ⊢ ((𝐵 ∈ 𝑊 ∧ {𝐴} ∈ V) → (𝐵 × {𝐴}) ∈ V) | |
| 9 | 7, 8 | syl 18 | . . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐵 × {𝐴}) ∈ V) |
| 10 | 9 | a1d 26 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝑦 ∈ {𝐴} → (𝐵 × {𝐴}) ∈ V)) |
| 11 | velsn 4603 | . . . . 5 ⊢ (𝑦 ∈ {𝐴} ↔ 𝑦 = 𝐴) | |
| 12 | 11 | a1i 11 | . . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝑦 ∈ {𝐴} ↔ 𝑦 = 𝐴)) |
| 13 | elmapg 8841 | . . . . . 6 ⊢ (({𝐴} ∈ V ∧ 𝐵 ∈ 𝑊) → (𝑥 ∈ ({𝐴} ↑m 𝐵) ↔ 𝑥:𝐵⟶{𝐴})) | |
| 14 | 6, 13 | sylan 592 | . . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝑥 ∈ ({𝐴} ↑m 𝐵) ↔ 𝑥:𝐵⟶{𝐴})) |
| 15 | fconst2g 7205 | . . . . . 6 ⊢ (𝐴 ∈ 𝑉 → (𝑥:𝐵⟶{𝐴} ↔ 𝑥 = (𝐵 × {𝐴}))) | |
| 16 | 15 | adantr 486 | . . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝑥:𝐵⟶{𝐴} ↔ 𝑥 = (𝐵 × {𝐴}))) |
| 17 | 14, 16 | bitr2d 283 | . . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝑥 = (𝐵 × {𝐴}) ↔ 𝑥 ∈ ({𝐴} ↑m 𝐵))) |
| 18 | 12, 17 | anbi12d 644 | . . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ((𝑦 ∈ {𝐴} ∧ 𝑥 = (𝐵 × {𝐴})) ↔ (𝑦 = 𝐴 ∧ 𝑥 ∈ ({𝐴} ↑m 𝐵)))) |
| 19 | ancom 466 | . . 3 ⊢ ((𝑦 = 𝐴 ∧ 𝑥 ∈ ({𝐴} ↑m 𝐵)) ↔ (𝑥 ∈ ({𝐴} ↑m 𝐵) ∧ 𝑦 = 𝐴)) | |
| 20 | 18, 19 | bitr2di 291 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ((𝑥 ∈ ({𝐴} ↑m 𝐵) ∧ 𝑦 = 𝐴) ↔ (𝑦 ∈ {𝐴} ∧ 𝑥 = (𝐵 × {𝐴})))) |
| 21 | 1, 3, 5, 10, 20 | en2d 8997 | 1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ({𝐴} ↑m 𝐵) ≈ {𝐴}) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2145 Vcvv 3453 {csn 4587 class class class wbr 5107 × cxp 5657 ⟶wf 6533 (class class class)co 7416 ↑m cmap 8829 ≈ cen 8952 |
| 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-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-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-map 8831 df-en 8956 |
| This theorem is used by: snmapen1 9049 |
| Copyright terms: Public domain | W3C validator |