| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > fnimatpd | Structured version Visualization version GIF version | ||
| Description: The image of an unordered triple under a function. (Contributed by Thierry Arnoux, 19-Sep-2023.) |
| Ref | Expression |
|---|---|
| fnimatpd.1 | ⊢ (𝜑 → 𝐹 Fn 𝐷) |
| fnimatpd.2 | ⊢ (𝜑 → 𝐴 ∈ 𝐷) |
| fnimatpd.3 | ⊢ (𝜑 → 𝐵 ∈ 𝐷) |
| fnimatpd.4 | ⊢ (𝜑 → 𝐶 ∈ 𝐷) |
| Ref | Expression |
|---|---|
| fnimatpd | ⊢ (𝜑 → (𝐹 “ {𝐴, 𝐵, 𝐶}) = {(𝐹‘𝐴), (𝐹‘𝐵), (𝐹‘𝐶)}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fnimatpd.1 | . . . 4 ⊢ (𝜑 → 𝐹 Fn 𝐷) | |
| 2 | fnimatpd.2 | . . . 4 ⊢ (𝜑 → 𝐴 ∈ 𝐷) | |
| 3 | fnimatpd.3 | . . . 4 ⊢ (𝜑 → 𝐵 ∈ 𝐷) | |
| 4 | fnimapr 6962 | . . . 4 ⊢ ((𝐹 Fn 𝐷 ∧ 𝐴 ∈ 𝐷 ∧ 𝐵 ∈ 𝐷) → (𝐹 “ {𝐴, 𝐵}) = {(𝐹‘𝐴), (𝐹‘𝐵)}) | |
| 5 | 1, 2, 3, 4 | syl3anc 1373 | . . 3 ⊢ (𝜑 → (𝐹 “ {𝐴, 𝐵}) = {(𝐹‘𝐴), (𝐹‘𝐵)}) |
| 6 | fnimatpd.4 | . . . . 5 ⊢ (𝜑 → 𝐶 ∈ 𝐷) | |
| 7 | fnsnfv 6958 | . . . . 5 ⊢ ((𝐹 Fn 𝐷 ∧ 𝐶 ∈ 𝐷) → {(𝐹‘𝐶)} = (𝐹 “ {𝐶})) | |
| 8 | 1, 6, 7 | syl2anc 584 | . . . 4 ⊢ (𝜑 → {(𝐹‘𝐶)} = (𝐹 “ {𝐶})) |
| 9 | 8 | eqcomd 2741 | . . 3 ⊢ (𝜑 → (𝐹 “ {𝐶}) = {(𝐹‘𝐶)}) |
| 10 | 5, 9 | uneq12d 4144 | . 2 ⊢ (𝜑 → ((𝐹 “ {𝐴, 𝐵}) ∪ (𝐹 “ {𝐶})) = ({(𝐹‘𝐴), (𝐹‘𝐵)} ∪ {(𝐹‘𝐶)})) |
| 11 | df-tp 4606 | . . . 4 ⊢ {𝐴, 𝐵, 𝐶} = ({𝐴, 𝐵} ∪ {𝐶}) | |
| 12 | 11 | imaeq2i 6045 | . . 3 ⊢ (𝐹 “ {𝐴, 𝐵, 𝐶}) = (𝐹 “ ({𝐴, 𝐵} ∪ {𝐶})) |
| 13 | imaundi 6138 | . . 3 ⊢ (𝐹 “ ({𝐴, 𝐵} ∪ {𝐶})) = ((𝐹 “ {𝐴, 𝐵}) ∪ (𝐹 “ {𝐶})) | |
| 14 | 12, 13 | eqtri 2758 | . 2 ⊢ (𝐹 “ {𝐴, 𝐵, 𝐶}) = ((𝐹 “ {𝐴, 𝐵}) ∪ (𝐹 “ {𝐶})) |
| 15 | df-tp 4606 | . 2 ⊢ {(𝐹‘𝐴), (𝐹‘𝐵), (𝐹‘𝐶)} = ({(𝐹‘𝐴), (𝐹‘𝐵)} ∪ {(𝐹‘𝐶)}) | |
| 16 | 10, 14, 15 | 3eqtr4g 2795 | 1 ⊢ (𝜑 → (𝐹 “ {𝐴, 𝐵, 𝐶}) = {(𝐹‘𝐴), (𝐹‘𝐵), (𝐹‘𝐶)}) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1540 ∈ wcel 2108 ∪ cun 3924 {csn 4601 {cpr 4603 {ctp 4605 “ cima 5657 Fn wfn 6526 ‘cfv 6531 |
| 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 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-12 2177 ax-ext 2707 ax-sep 5266 ax-nul 5276 ax-pr 5402 |
| 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 2065 df-mo 2539 df-eu 2568 df-clab 2714 df-cleq 2727 df-clel 2809 df-ne 2933 df-ral 3052 df-rex 3061 df-rab 3416 df-v 3461 df-dif 3929 df-un 3931 df-in 3933 df-ss 3943 df-nul 4309 df-if 4501 df-sn 4602 df-pr 4604 df-tp 4606 df-op 4608 df-uni 4884 df-br 5120 df-opab 5182 df-id 5548 df-xp 5660 df-rel 5661 df-cnv 5662 df-co 5663 df-dm 5664 df-rn 5665 df-res 5666 df-ima 5667 df-iota 6484 df-fun 6533 df-fn 6534 df-fv 6539 |
| This theorem is referenced by: s3rnOLD 32921 cycl3grtri 47959 grtrimap 47960 |
| Copyright terms: Public domain | W3C validator |