Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > 1fv | Structured version Visualization version GIF version |
Description: A function on a singleton. (Contributed by Alexander van der Vekens, 3-Dec-2017.) (Proof shortened by AV, 18-Apr-2021.) |
Ref | Expression |
---|---|
1fv | ⊢ ((𝑁 ∈ 𝑉 ∧ 𝑃 = {〈0, 𝑁〉}) → (𝑃:(0...0)⟶𝑉 ∧ (𝑃‘0) = 𝑁)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 0z 12376 | . . . . . 6 ⊢ 0 ∈ ℤ | |
2 | 1 | a1i 11 | . . . . 5 ⊢ (𝑁 ∈ 𝑉 → 0 ∈ ℤ) |
3 | id 22 | . . . . 5 ⊢ (𝑁 ∈ 𝑉 → 𝑁 ∈ 𝑉) | |
4 | 2, 3 | fsnd 6789 | . . . 4 ⊢ (𝑁 ∈ 𝑉 → {〈0, 𝑁〉}:{0}⟶𝑉) |
5 | fvsng 7084 | . . . . 5 ⊢ ((0 ∈ ℤ ∧ 𝑁 ∈ 𝑉) → ({〈0, 𝑁〉}‘0) = 𝑁) | |
6 | 1, 5 | mpan 688 | . . . 4 ⊢ (𝑁 ∈ 𝑉 → ({〈0, 𝑁〉}‘0) = 𝑁) |
7 | 4, 6 | jca 513 | . . 3 ⊢ (𝑁 ∈ 𝑉 → ({〈0, 𝑁〉}:{0}⟶𝑉 ∧ ({〈0, 𝑁〉}‘0) = 𝑁)) |
8 | 7 | adantr 482 | . 2 ⊢ ((𝑁 ∈ 𝑉 ∧ 𝑃 = {〈0, 𝑁〉}) → ({〈0, 𝑁〉}:{0}⟶𝑉 ∧ ({〈0, 𝑁〉}‘0) = 𝑁)) |
9 | id 22 | . . . . 5 ⊢ (𝑃 = {〈0, 𝑁〉} → 𝑃 = {〈0, 𝑁〉}) | |
10 | fz0sn 13402 | . . . . . 6 ⊢ (0...0) = {0} | |
11 | 10 | a1i 11 | . . . . 5 ⊢ (𝑃 = {〈0, 𝑁〉} → (0...0) = {0}) |
12 | 9, 11 | feq12d 6618 | . . . 4 ⊢ (𝑃 = {〈0, 𝑁〉} → (𝑃:(0...0)⟶𝑉 ↔ {〈0, 𝑁〉}:{0}⟶𝑉)) |
13 | fveq1 6803 | . . . . 5 ⊢ (𝑃 = {〈0, 𝑁〉} → (𝑃‘0) = ({〈0, 𝑁〉}‘0)) | |
14 | 13 | eqeq1d 2738 | . . . 4 ⊢ (𝑃 = {〈0, 𝑁〉} → ((𝑃‘0) = 𝑁 ↔ ({〈0, 𝑁〉}‘0) = 𝑁)) |
15 | 12, 14 | anbi12d 632 | . . 3 ⊢ (𝑃 = {〈0, 𝑁〉} → ((𝑃:(0...0)⟶𝑉 ∧ (𝑃‘0) = 𝑁) ↔ ({〈0, 𝑁〉}:{0}⟶𝑉 ∧ ({〈0, 𝑁〉}‘0) = 𝑁))) |
16 | 15 | adantl 483 | . 2 ⊢ ((𝑁 ∈ 𝑉 ∧ 𝑃 = {〈0, 𝑁〉}) → ((𝑃:(0...0)⟶𝑉 ∧ (𝑃‘0) = 𝑁) ↔ ({〈0, 𝑁〉}:{0}⟶𝑉 ∧ ({〈0, 𝑁〉}‘0) = 𝑁))) |
17 | 8, 16 | mpbird 257 | 1 ⊢ ((𝑁 ∈ 𝑉 ∧ 𝑃 = {〈0, 𝑁〉}) → (𝑃:(0...0)⟶𝑉 ∧ (𝑃‘0) = 𝑁)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 397 = wceq 1539 ∈ wcel 2104 {csn 4565 〈cop 4571 ⟶wf 6454 ‘cfv 6458 (class class class)co 7307 0cc0 10917 ℤcz 12365 ...cfz 13285 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1911 ax-6 1969 ax-7 2009 ax-8 2106 ax-9 2114 ax-10 2135 ax-11 2152 ax-12 2169 ax-ext 2707 ax-sep 5232 ax-nul 5239 ax-pow 5297 ax-pr 5361 ax-un 7620 ax-cnex 10973 ax-resscn 10974 ax-1cn 10975 ax-addrcl 10978 ax-rnegex 10988 ax-cnre 10990 ax-pre-lttri 10991 ax-pre-lttrn 10992 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 846 df-3or 1088 df-3an 1089 df-tru 1542 df-fal 1552 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2538 df-eu 2567 df-clab 2714 df-cleq 2728 df-clel 2814 df-nfc 2887 df-ne 2942 df-nel 3048 df-ral 3063 df-rex 3072 df-rab 3287 df-v 3439 df-sbc 3722 df-csb 3838 df-dif 3895 df-un 3897 df-in 3899 df-ss 3909 df-nul 4263 df-if 4466 df-pw 4541 df-sn 4566 df-pr 4568 df-op 4572 df-uni 4845 df-iun 4933 df-br 5082 df-opab 5144 df-mpt 5165 df-id 5500 df-po 5514 df-so 5515 df-xp 5606 df-rel 5607 df-cnv 5608 df-co 5609 df-dm 5610 df-rn 5611 df-res 5612 df-ima 5613 df-iota 6410 df-fun 6460 df-fn 6461 df-f 6462 df-f1 6463 df-fo 6464 df-f1o 6465 df-fv 6466 df-ov 7310 df-oprab 7311 df-mpo 7312 df-1st 7863 df-2nd 7864 df-er 8529 df-en 8765 df-dom 8766 df-sdom 8767 df-pnf 11057 df-mnf 11058 df-xr 11059 df-ltxr 11060 df-le 11061 df-neg 11254 df-z 12366 df-uz 12629 df-fz 13286 |
This theorem is referenced by: is0wlk 28526 is0trl 28532 0pthon1 28537 |
Copyright terms: Public domain | W3C validator |