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 6168 | . . . . 5 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → {(𝐹‘𝐵)} = (𝐹 “ {𝐵})) | |
2 | 1 | 3adant3 1074 | . . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴) → {(𝐹‘𝐵)} = (𝐹 “ {𝐵})) |
3 | fnsnfv 6168 | . . . . 5 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐶 ∈ 𝐴) → {(𝐹‘𝐶)} = (𝐹 “ {𝐶})) | |
4 | 3 | 3adant2 1073 | . . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴) → {(𝐹‘𝐶)} = (𝐹 “ {𝐶})) |
5 | 2, 4 | uneq12d 3730 | . . 3 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴) → ({(𝐹‘𝐵)} ∪ {(𝐹‘𝐶)}) = ((𝐹 “ {𝐵}) ∪ (𝐹 “ {𝐶}))) |
6 | 5 | eqcomd 2616 | . 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴) → ((𝐹 “ {𝐵}) ∪ (𝐹 “ {𝐶})) = ({(𝐹‘𝐵)} ∪ {(𝐹‘𝐶)})) |
7 | df-pr 4128 | . . . 4 ⊢ {𝐵, 𝐶} = ({𝐵} ∪ {𝐶}) | |
8 | 7 | imaeq2i 5383 | . . 3 ⊢ (𝐹 “ {𝐵, 𝐶}) = (𝐹 “ ({𝐵} ∪ {𝐶})) |
9 | imaundi 5464 | . . 3 ⊢ (𝐹 “ ({𝐵} ∪ {𝐶})) = ((𝐹 “ {𝐵}) ∪ (𝐹 “ {𝐶})) | |
10 | 8, 9 | eqtri 2632 | . 2 ⊢ (𝐹 “ {𝐵, 𝐶}) = ((𝐹 “ {𝐵}) ∪ (𝐹 “ {𝐶})) |
11 | df-pr 4128 | . 2 ⊢ {(𝐹‘𝐵), (𝐹‘𝐶)} = ({(𝐹‘𝐵)} ∪ {(𝐹‘𝐶)}) | |
12 | 6, 10, 11 | 3eqtr4g 2669 | 1 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴) → (𝐹 “ {𝐵, 𝐶}) = {(𝐹‘𝐵), (𝐹‘𝐶)}) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ w3a 1031 = wceq 1475 ∈ wcel 1977 ∪ cun 3538 {csn 4125 {cpr 4127 “ cima 5041 Fn wfn 5799 ‘cfv 5804 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-sep 4709 ax-nul 4717 ax-pr 4833 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-ral 2901 df-rex 2902 df-rab 2905 df-v 3175 df-sbc 3403 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-nul 3875 df-if 4037 df-sn 4126 df-pr 4128 df-op 4132 df-uni 4373 df-br 4584 df-opab 4644 df-id 4953 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-iota 5768 df-fun 5806 df-fn 5807 df-fv 5812 |
This theorem is referenced by: fvinim0ffz 12449 mrcun 16105 2pthlem2 26126 constr3pthlem3 26185 poimirlem1 32580 poimirlem9 32588 imarnf1pr 40326 |
Copyright terms: Public domain | W3C validator |