| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > fnimapr | 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 5705 | . . . . 5 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → {(𝐹‘𝐵)} = (𝐹 “ {𝐵})) | |
| 2 | 1 | 3adant3 1043 | . . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴) → {(𝐹‘𝐵)} = (𝐹 “ {𝐵})) |
| 3 | fnsnfv 5705 | . . . . 5 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐶 ∈ 𝐴) → {(𝐹‘𝐶)} = (𝐹 “ {𝐶})) | |
| 4 | 3 | 3adant2 1042 | . . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴) → {(𝐹‘𝐶)} = (𝐹 “ {𝐶})) |
| 5 | 2, 4 | uneq12d 3362 | . . 3 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴) → ({(𝐹‘𝐵)} ∪ {(𝐹‘𝐶)}) = ((𝐹 “ {𝐵}) ∪ (𝐹 “ {𝐶}))) |
| 6 | 5 | eqcomd 2237 | . 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴) → ((𝐹 “ {𝐵}) ∪ (𝐹 “ {𝐶})) = ({(𝐹‘𝐵)} ∪ {(𝐹‘𝐶)})) |
| 7 | df-pr 3676 | . . . 4 ⊢ {𝐵, 𝐶} = ({𝐵} ∪ {𝐶}) | |
| 8 | 7 | imaeq2i 5074 | . . 3 ⊢ (𝐹 “ {𝐵, 𝐶}) = (𝐹 “ ({𝐵} ∪ {𝐶})) |
| 9 | imaundi 5149 | . . 3 ⊢ (𝐹 “ ({𝐵} ∪ {𝐶})) = ((𝐹 “ {𝐵}) ∪ (𝐹 “ {𝐶})) | |
| 10 | 8, 9 | eqtri 2252 | . 2 ⊢ (𝐹 “ {𝐵, 𝐶}) = ((𝐹 “ {𝐵}) ∪ (𝐹 “ {𝐶})) |
| 11 | df-pr 3676 | . 2 ⊢ {(𝐹‘𝐵), (𝐹‘𝐶)} = ({(𝐹‘𝐵)} ∪ {(𝐹‘𝐶)}) | |
| 12 | 6, 10, 11 | 3eqtr4g 2289 | 1 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴) → (𝐹 “ {𝐵, 𝐶}) = {(𝐹‘𝐵), (𝐹‘𝐶)}) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ w3a 1004 = wceq 1397 ∈ wcel 2202 ∪ cun 3198 {csn 3669 {cpr 3670 “ cima 4728 Fn wfn 5321 ‘cfv 5326 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-14 2205 ax-ext 2213 ax-sep 4207 ax-pow 4264 ax-pr 4299 |
| This theorem depends on definitions: df-bi 117 df-3an 1006 df-tru 1400 df-nf 1509 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ral 2515 df-rex 2516 df-v 2804 df-sbc 3032 df-un 3204 df-in 3206 df-ss 3213 df-pw 3654 df-sn 3675 df-pr 3676 df-op 3678 df-uni 3894 df-br 4089 df-opab 4151 df-id 4390 df-xp 4731 df-rel 4732 df-cnv 4733 df-co 4734 df-dm 4735 df-rn 4736 df-res 4737 df-ima 4738 df-iota 5286 df-fun 5328 df-fn 5329 df-fv 5334 |
| This theorem is referenced by: en2 6998 fvinim0ffz 10488 |
| Copyright terms: Public domain | W3C validator |