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 5555 | . . . . 5 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → {(𝐹‘𝐵)} = (𝐹 “ {𝐵})) | |
2 | 1 | 3adant3 1012 | . . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴) → {(𝐹‘𝐵)} = (𝐹 “ {𝐵})) |
3 | fnsnfv 5555 | . . . . 5 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐶 ∈ 𝐴) → {(𝐹‘𝐶)} = (𝐹 “ {𝐶})) | |
4 | 3 | 3adant2 1011 | . . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴) → {(𝐹‘𝐶)} = (𝐹 “ {𝐶})) |
5 | 2, 4 | uneq12d 3282 | . . 3 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴) → ({(𝐹‘𝐵)} ∪ {(𝐹‘𝐶)}) = ((𝐹 “ {𝐵}) ∪ (𝐹 “ {𝐶}))) |
6 | 5 | eqcomd 2176 | . 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴) → ((𝐹 “ {𝐵}) ∪ (𝐹 “ {𝐶})) = ({(𝐹‘𝐵)} ∪ {(𝐹‘𝐶)})) |
7 | df-pr 3590 | . . . 4 ⊢ {𝐵, 𝐶} = ({𝐵} ∪ {𝐶}) | |
8 | 7 | imaeq2i 4951 | . . 3 ⊢ (𝐹 “ {𝐵, 𝐶}) = (𝐹 “ ({𝐵} ∪ {𝐶})) |
9 | imaundi 5023 | . . 3 ⊢ (𝐹 “ ({𝐵} ∪ {𝐶})) = ((𝐹 “ {𝐵}) ∪ (𝐹 “ {𝐶})) | |
10 | 8, 9 | eqtri 2191 | . 2 ⊢ (𝐹 “ {𝐵, 𝐶}) = ((𝐹 “ {𝐵}) ∪ (𝐹 “ {𝐶})) |
11 | df-pr 3590 | . 2 ⊢ {(𝐹‘𝐵), (𝐹‘𝐶)} = ({(𝐹‘𝐵)} ∪ {(𝐹‘𝐶)}) | |
12 | 6, 10, 11 | 3eqtr4g 2228 | 1 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴) → (𝐹 “ {𝐵, 𝐶}) = {(𝐹‘𝐵), (𝐹‘𝐶)}) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ w3a 973 = wceq 1348 ∈ wcel 2141 ∪ cun 3119 {csn 3583 {cpr 3584 “ cima 4614 Fn wfn 5193 ‘cfv 5198 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-io 704 ax-5 1440 ax-7 1441 ax-gen 1442 ax-ie1 1486 ax-ie2 1487 ax-8 1497 ax-10 1498 ax-11 1499 ax-i12 1500 ax-bndl 1502 ax-4 1503 ax-17 1519 ax-i9 1523 ax-ial 1527 ax-i5r 1528 ax-14 2144 ax-ext 2152 ax-sep 4107 ax-pow 4160 ax-pr 4194 |
This theorem depends on definitions: df-bi 116 df-3an 975 df-tru 1351 df-nf 1454 df-sb 1756 df-eu 2022 df-mo 2023 df-clab 2157 df-cleq 2163 df-clel 2166 df-nfc 2301 df-ral 2453 df-rex 2454 df-v 2732 df-sbc 2956 df-un 3125 df-in 3127 df-ss 3134 df-pw 3568 df-sn 3589 df-pr 3590 df-op 3592 df-uni 3797 df-br 3990 df-opab 4051 df-id 4278 df-xp 4617 df-rel 4618 df-cnv 4619 df-co 4620 df-dm 4621 df-rn 4622 df-res 4623 df-ima 4624 df-iota 5160 df-fun 5200 df-fn 5201 df-fv 5206 |
This theorem is referenced by: fvinim0ffz 10197 |
Copyright terms: Public domain | W3C validator |