| 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 12613 | . . . . . 6 ⊢ 0 ∈ ℤ | |
| 2 | 1 | a1i 11 | . . . . 5 ⊢ (𝑁 ∈ 𝑉 → 0 ∈ ℤ) |
| 3 | id 23 | . . . . 5 ⊢ (𝑁 ∈ 𝑉 → 𝑁 ∈ 𝑉) | |
| 4 | 2, 3 | fsnd 6869 | . . . 4 ⊢ (𝑁 ∈ 𝑉 → {〈0, 𝑁〉}:{0}⟶𝑉) |
| 5 | fvsng 7182 | . . . . 5 ⊢ ((0 ∈ ℤ ∧ 𝑁 ∈ 𝑉) → ({〈0, 𝑁〉}‘0) = 𝑁) | |
| 6 | 1, 5 | mpan 703 | . . . 4 ⊢ (𝑁 ∈ 𝑉 → ({〈0, 𝑁〉}‘0) = 𝑁) |
| 7 | 4, 6 | jca 521 | . . 3 ⊢ (𝑁 ∈ 𝑉 → ({〈0, 𝑁〉}:{0}⟶𝑉 ∧ ({〈0, 𝑁〉}‘0) = 𝑁)) |
| 8 | 7 | adantr 486 | . 2 ⊢ ((𝑁 ∈ 𝑉 ∧ 𝑃 = {〈0, 𝑁〉}) → ({〈0, 𝑁〉}:{0}⟶𝑉 ∧ ({〈0, 𝑁〉}‘0) = 𝑁)) |
| 9 | id 23 | . . . . 5 ⊢ (𝑃 = {〈0, 𝑁〉} → 𝑃 = {〈0, 𝑁〉}) | |
| 10 | fz0sn 13668 | . . . . . 6 ⊢ (0...0) = {0} | |
| 11 | 10 | a1i 11 | . . . . 5 ⊢ (𝑃 = {〈0, 𝑁〉} → (0...0) = {0}) |
| 12 | 9, 11 | feq12d 6697 | . . . 4 ⊢ (𝑃 = {〈0, 𝑁〉} → (𝑃:(0...0)⟶𝑉 ↔ {〈0, 𝑁〉}:{0}⟶𝑉)) |
| 13 | fveq1 6884 | . . . . 5 ⊢ (𝑃 = {〈0, 𝑁〉} → (𝑃‘0) = ({〈0, 𝑁〉}‘0)) | |
| 14 | 13 | eqeq1d 2767 | . . . 4 ⊢ (𝑃 = {〈0, 𝑁〉} → ((𝑃‘0) = 𝑁 ↔ ({〈0, 𝑁〉}‘0) = 𝑁)) |
| 15 | 12, 14 | anbi12d 644 | . . 3 ⊢ (𝑃 = {〈0, 𝑁〉} → ((𝑃:(0...0)⟶𝑉 ∧ (𝑃‘0) = 𝑁) ↔ ({〈0, 𝑁〉}:{0}⟶𝑉 ∧ ({〈0, 𝑁〉}‘0) = 𝑁))) |
| 16 | 15 | adantl 487 | . 2 ⊢ ((𝑁 ∈ 𝑉 ∧ 𝑃 = {〈0, 𝑁〉}) → ((𝑃:(0...0)⟶𝑉 ∧ (𝑃‘0) = 𝑁) ↔ ({〈0, 𝑁〉}:{0}⟶𝑉 ∧ ({〈0, 𝑁〉}‘0) = 𝑁))) |
| 17 | 8, 16 | mpbird 260 | 1 ⊢ ((𝑁 ∈ 𝑉 ∧ 𝑃 = {〈0, 𝑁〉}) → (𝑃:(0...0)⟶𝑉 ∧ (𝑃‘0) = 𝑁)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2146 {csn 4591 〈cop 4597 ⟶wf 6536 ‘cfv 6540 (class class class)co 7416 0cc0 11111 ℤcz 12602 ...cfz 13547 |
| 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 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7738 ax-cnex 11167 ax-resscn 11168 ax-1cn 11169 ax-addrcl 11172 ax-rnegex 11182 ax-cnre 11184 ax-pre-lttri 11185 ax-pre-lttrn 11186 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3067 df-ral 3082 df-rex 3092 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-id 5558 df-po 5571 df-so 5572 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-ov 7419 df-oprab 7420 df-mpo 7421 df-1st 7988 df-2nd 7989 df-er 8696 df-en 8946 df-dom 8947 df-sdom 8948 df-pnf 11256 df-mnf 11257 df-xr 11258 df-ltxr 11259 df-le 11260 df-neg 11455 df-z 12603 df-uz 12875 df-fz 13548 |
| This theorem is used by: is0wlk 30511 is0trl 30517 0pthon1 30522 |
| Copyright terms: Public domain | W3C validator |