| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > fnimapr | Structured version Visualization version GIF version | ||
| Description: The image of a pair under a function. (Contributed by Jeff Madsen, 6-Jan-2011.) |
| Ref | Expression |
|---|---|
| fnimapr | ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴) → (𝐹 “ {𝐵, 𝐶}) = {(𝐹‘𝐵), (𝐹‘𝐶)}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fnsnfv 6906 | . . . . 5 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → {(𝐹‘𝐵)} = (𝐹 “ {𝐵})) | |
| 2 | 1 | 3adant3 1132 | . . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴) → {(𝐹‘𝐵)} = (𝐹 “ {𝐵})) |
| 3 | fnsnfv 6906 | . . . . 5 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐶 ∈ 𝐴) → {(𝐹‘𝐶)} = (𝐹 “ {𝐶})) | |
| 4 | 3 | 3adant2 1131 | . . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴) → {(𝐹‘𝐶)} = (𝐹 “ {𝐶})) |
| 5 | 2, 4 | uneq12d 4122 | . . 3 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴) → ({(𝐹‘𝐵)} ∪ {(𝐹‘𝐶)}) = ((𝐹 “ {𝐵}) ∪ (𝐹 “ {𝐶}))) |
| 6 | 5 | eqcomd 2735 | . 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴) → ((𝐹 “ {𝐵}) ∪ (𝐹 “ {𝐶})) = ({(𝐹‘𝐵)} ∪ {(𝐹‘𝐶)})) |
| 7 | df-pr 4582 | . . . 4 ⊢ {𝐵, 𝐶} = ({𝐵} ∪ {𝐶}) | |
| 8 | 7 | imaeq2i 6013 | . . 3 ⊢ (𝐹 “ {𝐵, 𝐶}) = (𝐹 “ ({𝐵} ∪ {𝐶})) |
| 9 | imaundi 6102 | . . 3 ⊢ (𝐹 “ ({𝐵} ∪ {𝐶})) = ((𝐹 “ {𝐵}) ∪ (𝐹 “ {𝐶})) | |
| 10 | 8, 9 | eqtri 2752 | . 2 ⊢ (𝐹 “ {𝐵, 𝐶}) = ((𝐹 “ {𝐵}) ∪ (𝐹 “ {𝐶})) |
| 11 | df-pr 4582 | . 2 ⊢ {(𝐹‘𝐵), (𝐹‘𝐶)} = ({(𝐹‘𝐵)} ∪ {(𝐹‘𝐶)}) | |
| 12 | 6, 10, 11 | 3eqtr4g 2789 | 1 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴) → (𝐹 “ {𝐵, 𝐶}) = {(𝐹‘𝐵), (𝐹‘𝐶)}) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ w3a 1086 = wceq 1540 ∈ wcel 2109 ∪ cun 3903 {csn 4579 {cpr 4581 “ cima 5626 Fn wfn 6481 ‘cfv 6486 |
| 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 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-12 2178 ax-ext 2701 ax-sep 5238 ax-nul 5248 ax-pr 5374 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-ne 2926 df-ral 3045 df-rex 3054 df-rab 3397 df-v 3440 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-nul 4287 df-if 4479 df-sn 4580 df-pr 4582 df-op 4586 df-uni 4862 df-br 5096 df-opab 5158 df-id 5518 df-xp 5629 df-rel 5630 df-cnv 5631 df-co 5632 df-dm 5633 df-rn 5634 df-res 5635 df-ima 5636 df-iota 6442 df-fun 6488 df-fn 6489 df-fv 6494 |
| This theorem is referenced by: fnimatpd 6911 fvinim0ffz 13707 mrcun 17546 negs1s 27956 dfpth2 29692 s2rnOLD 32898 poimirlem1 37600 poimirlem9 37608 imarnf1pr 47267 uhgrimprop 47876 isuspgrimlem 47879 upgrimwlklem5 47885 upgrimpths 47893 clnbgrgrimlem 47917 clnbgrgrim 47918 grimgrtri 47932 isubgr3stgrlem4 47952 isubgr3stgrlem7 47955 grlimgrtrilem2 47978 |
| Copyright terms: Public domain | W3C validator |