| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > s1co | Structured version Visualization version GIF version | ||
| Description: Mapping of a singleton word. (Contributed by Mario Carneiro, 27-Sep-2015.) (Revised by Mario Carneiro, 26-Feb-2016.) |
| Ref | Expression |
|---|---|
| s1co | ⊢ ((𝑆 ∈ 𝐴 ∧ 𝐹:𝐴⟶𝐵) → (𝐹 ∘ 〈“𝑆”〉) = 〈“(𝐹‘𝑆)”〉) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | s1val 14638 | . . . . 5 ⊢ (𝑆 ∈ 𝐴 → 〈“𝑆”〉 = {〈0, 𝑆〉}) | |
| 2 | 0cn 11199 | . . . . . 6 ⊢ 0 ∈ ℂ | |
| 3 | xpsng 7137 | . . . . . 6 ⊢ ((0 ∈ ℂ ∧ 𝑆 ∈ 𝐴) → ({0} × {𝑆}) = {〈0, 𝑆〉}) | |
| 4 | 2, 3 | mpan 702 | . . . . 5 ⊢ (𝑆 ∈ 𝐴 → ({0} × {𝑆}) = {〈0, 𝑆〉}) |
| 5 | 1, 4 | eqtr4d 2801 | . . . 4 ⊢ (𝑆 ∈ 𝐴 → 〈“𝑆”〉 = ({0} × {𝑆})) |
| 6 | 5 | adantr 485 | . . 3 ⊢ ((𝑆 ∈ 𝐴 ∧ 𝐹:𝐴⟶𝐵) → 〈“𝑆”〉 = ({0} × {𝑆})) |
| 7 | 6 | coeq2d 5850 | . 2 ⊢ ((𝑆 ∈ 𝐴 ∧ 𝐹:𝐴⟶𝐵) → (𝐹 ∘ 〈“𝑆”〉) = (𝐹 ∘ ({0} × {𝑆}))) |
| 8 | fvex 6896 | . . . . 5 ⊢ (𝐹‘𝑆) ∈ V | |
| 9 | s1val 14638 | . . . . 5 ⊢ ((𝐹‘𝑆) ∈ V → 〈“(𝐹‘𝑆)”〉 = {〈0, (𝐹‘𝑆)〉}) | |
| 10 | 8, 9 | ax-mp 5 | . . . 4 ⊢ 〈“(𝐹‘𝑆)”〉 = {〈0, (𝐹‘𝑆)〉} |
| 11 | c0ex 11201 | . . . . 5 ⊢ 0 ∈ V | |
| 12 | 11, 8 | xpsn 7139 | . . . 4 ⊢ ({0} × {(𝐹‘𝑆)}) = {〈0, (𝐹‘𝑆)〉} |
| 13 | 10, 12 | eqtr4i 2789 | . . 3 ⊢ 〈“(𝐹‘𝑆)”〉 = ({0} × {(𝐹‘𝑆)}) |
| 14 | ffn 6707 | . . . 4 ⊢ (𝐹:𝐴⟶𝐵 → 𝐹 Fn 𝐴) | |
| 15 | id 23 | . . . 4 ⊢ (𝑆 ∈ 𝐴 → 𝑆 ∈ 𝐴) | |
| 16 | fcoconst 7132 | . . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑆 ∈ 𝐴) → (𝐹 ∘ ({0} × {𝑆})) = ({0} × {(𝐹‘𝑆)})) | |
| 17 | 14, 15, 16 | syl2anr 608 | . . 3 ⊢ ((𝑆 ∈ 𝐴 ∧ 𝐹:𝐴⟶𝐵) → (𝐹 ∘ ({0} × {𝑆})) = ({0} × {(𝐹‘𝑆)})) |
| 18 | 13, 17 | eqtr4id 2817 | . 2 ⊢ ((𝑆 ∈ 𝐴 ∧ 𝐹:𝐴⟶𝐵) → 〈“(𝐹‘𝑆)”〉 = (𝐹 ∘ ({0} × {𝑆}))) |
| 19 | 7, 18 | eqtr4d 2801 | 1 ⊢ ((𝑆 ∈ 𝐴 ∧ 𝐹:𝐴⟶𝐵) → (𝐹 ∘ 〈“𝑆”〉) = 〈“(𝐹‘𝑆)”〉) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 = wceq 1570 ∈ wcel 2143 Vcvv 3455 {csn 4590 〈cop 4596 × cxp 5661 ∘ ccom 5667 Fn wfn 6533 ⟶wf 6534 ‘cfv 6538 ℂcc 11099 0cc0 11101 〈“cs1 14635 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-sep 5258 ax-nul 5270 ax-pr 5406 ax-1cn 11159 ax-icn 11160 ax-addcl 11161 ax-mulcl 11163 ax-i2m1 11169 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-ral 3080 df-rex 3090 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3746 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4288 df-if 4489 df-sn 4591 df-pr 4593 df-op 4597 df-uni 4874 df-br 5111 df-opab 5175 df-mpt 5194 df-id 5558 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 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-s1 14636 |
| This theorem is referenced by: cats1co 14895 s2co 14959 frmdgsum 18922 frmdup2 18925 efginvrel2 19798 vrgpinv 19840 frgpup2 19847 ccatws1f1olast 33250 mrsubcv 35980 |
| Copyright terms: Public domain | W3C validator |