![]() |
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 14646 | . . . . 5 ⊢ (𝑆 ∈ 𝐴 → 〈“𝑆”〉 = {〈0, 𝑆〉}) | |
2 | 0cn 11282 | . . . . . 6 ⊢ 0 ∈ ℂ | |
3 | xpsng 7173 | . . . . . 6 ⊢ ((0 ∈ ℂ ∧ 𝑆 ∈ 𝐴) → ({0} × {𝑆}) = {〈0, 𝑆〉}) | |
4 | 2, 3 | mpan 689 | . . . . 5 ⊢ (𝑆 ∈ 𝐴 → ({0} × {𝑆}) = {〈0, 𝑆〉}) |
5 | 1, 4 | eqtr4d 2783 | . . . 4 ⊢ (𝑆 ∈ 𝐴 → 〈“𝑆”〉 = ({0} × {𝑆})) |
6 | 5 | adantr 480 | . . 3 ⊢ ((𝑆 ∈ 𝐴 ∧ 𝐹:𝐴⟶𝐵) → 〈“𝑆”〉 = ({0} × {𝑆})) |
7 | 6 | coeq2d 5887 | . 2 ⊢ ((𝑆 ∈ 𝐴 ∧ 𝐹:𝐴⟶𝐵) → (𝐹 ∘ 〈“𝑆”〉) = (𝐹 ∘ ({0} × {𝑆}))) |
8 | fvex 6933 | . . . . 5 ⊢ (𝐹‘𝑆) ∈ V | |
9 | s1val 14646 | . . . . 5 ⊢ ((𝐹‘𝑆) ∈ V → 〈“(𝐹‘𝑆)”〉 = {〈0, (𝐹‘𝑆)〉}) | |
10 | 8, 9 | ax-mp 5 | . . . 4 ⊢ 〈“(𝐹‘𝑆)”〉 = {〈0, (𝐹‘𝑆)〉} |
11 | c0ex 11284 | . . . . 5 ⊢ 0 ∈ V | |
12 | 11, 8 | xpsn 7175 | . . . 4 ⊢ ({0} × {(𝐹‘𝑆)}) = {〈0, (𝐹‘𝑆)〉} |
13 | 10, 12 | eqtr4i 2771 | . . 3 ⊢ 〈“(𝐹‘𝑆)”〉 = ({0} × {(𝐹‘𝑆)}) |
14 | ffn 6747 | . . . 4 ⊢ (𝐹:𝐴⟶𝐵 → 𝐹 Fn 𝐴) | |
15 | id 22 | . . . 4 ⊢ (𝑆 ∈ 𝐴 → 𝑆 ∈ 𝐴) | |
16 | fcoconst 7168 | . . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑆 ∈ 𝐴) → (𝐹 ∘ ({0} × {𝑆})) = ({0} × {(𝐹‘𝑆)})) | |
17 | 14, 15, 16 | syl2anr 596 | . . 3 ⊢ ((𝑆 ∈ 𝐴 ∧ 𝐹:𝐴⟶𝐵) → (𝐹 ∘ ({0} × {𝑆})) = ({0} × {(𝐹‘𝑆)})) |
18 | 13, 17 | eqtr4id 2799 | . 2 ⊢ ((𝑆 ∈ 𝐴 ∧ 𝐹:𝐴⟶𝐵) → 〈“(𝐹‘𝑆)”〉 = (𝐹 ∘ ({0} × {𝑆}))) |
19 | 7, 18 | eqtr4d 2783 | 1 ⊢ ((𝑆 ∈ 𝐴 ∧ 𝐹:𝐴⟶𝐵) → (𝐹 ∘ 〈“𝑆”〉) = 〈“(𝐹‘𝑆)”〉) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 = wceq 1537 ∈ wcel 2108 Vcvv 3488 {csn 4648 〈cop 4654 × cxp 5698 ∘ ccom 5704 Fn wfn 6568 ⟶wf 6569 ‘cfv 6573 ℂcc 11182 0cc0 11184 〈“cs1 14643 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2158 ax-12 2178 ax-ext 2711 ax-sep 5317 ax-nul 5324 ax-pr 5447 ax-1cn 11242 ax-icn 11243 ax-addcl 11244 ax-mulcl 11246 ax-i2m1 11252 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2065 df-mo 2543 df-eu 2572 df-clab 2718 df-cleq 2732 df-clel 2819 df-nfc 2895 df-ne 2947 df-ral 3068 df-rex 3077 df-reu 3389 df-rab 3444 df-v 3490 df-sbc 3805 df-csb 3922 df-dif 3979 df-un 3981 df-in 3983 df-ss 3993 df-nul 4353 df-if 4549 df-sn 4649 df-pr 4651 df-op 4655 df-uni 4932 df-br 5167 df-opab 5229 df-mpt 5250 df-id 5593 df-xp 5706 df-rel 5707 df-cnv 5708 df-co 5709 df-dm 5710 df-rn 5711 df-res 5712 df-ima 5713 df-iota 6525 df-fun 6575 df-fn 6576 df-f 6577 df-f1 6578 df-fo 6579 df-f1o 6580 df-fv 6581 df-s1 14644 |
This theorem is referenced by: cats1co 14905 s2co 14969 frmdgsum 18897 frmdup2 18900 efginvrel2 19769 vrgpinv 19811 frgpup2 19818 ccatws1f1olast 32919 mrsubcv 35478 |
Copyright terms: Public domain | W3C validator |