| 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 6954 | . . . 4 ⊢ ((𝐹 Fn 𝐷 ∧ 𝐴 ∈ 𝐷 ∧ 𝐵 ∈ 𝐷) → (𝐹 “ {𝐴, 𝐵}) = {(𝐹‘𝐴), (𝐹‘𝐵)}) | |
| 5 | 1, 2, 3, 4 | syl3anc 1394 | . . 3 ⊢ (𝜑 → (𝐹 “ {𝐴, 𝐵}) = {(𝐹‘𝐴), (𝐹‘𝐵)}) |
| 6 | fnimatpd.4 | . . . . 5 ⊢ (𝜑 → 𝐶 ∈ 𝐷) | |
| 7 | fnsnfv 6950 | . . . . 5 ⊢ ((𝐹 Fn 𝐷 ∧ 𝐶 ∈ 𝐷) → {(𝐹‘𝐶)} = (𝐹 “ {𝐶})) | |
| 8 | 1, 6, 7 | syl2anc 595 | . . . 4 ⊢ (𝜑 → {(𝐹‘𝐶)} = (𝐹 “ {𝐶})) |
| 9 | 8 | eqcomd 2771 | . . 3 ⊢ (𝜑 → (𝐹 “ {𝐶}) = {(𝐹‘𝐶)}) |
| 10 | 5, 9 | uneq12d 4125 | . 2 ⊢ (𝜑 → ((𝐹 “ {𝐴, 𝐵}) ∪ (𝐹 “ {𝐶})) = ({(𝐹‘𝐴), (𝐹‘𝐵)} ∪ {(𝐹‘𝐶)})) |
| 11 | df-tp 4590 | . . . 4 ⊢ {𝐴, 𝐵, 𝐶} = ({𝐴, 𝐵} ∪ {𝐶}) | |
| 12 | 11 | imaeq2i 6051 | . . 3 ⊢ (𝐹 “ {𝐴, 𝐵, 𝐶}) = (𝐹 “ ({𝐴, 𝐵} ∪ {𝐶})) |
| 13 | imaundi 6138 | . . 3 ⊢ (𝐹 “ ({𝐴, 𝐵} ∪ {𝐶})) = ((𝐹 “ {𝐴, 𝐵}) ∪ (𝐹 “ {𝐶})) | |
| 14 | 12, 13 | eqtri 2788 | . 2 ⊢ (𝐹 “ {𝐴, 𝐵, 𝐶}) = ((𝐹 “ {𝐴, 𝐵}) ∪ (𝐹 “ {𝐶})) |
| 15 | df-tp 4590 | . 2 ⊢ {(𝐹‘𝐴), (𝐹‘𝐵), (𝐹‘𝐶)} = ({(𝐹‘𝐴), (𝐹‘𝐵)} ∪ {(𝐹‘𝐶)}) | |
| 16 | 10, 14, 15 | 3eqtr4g 2825 | 1 ⊢ (𝜑 → (𝐹 “ {𝐴, 𝐵, 𝐶}) = {(𝐹‘𝐴), (𝐹‘𝐵), (𝐹‘𝐶)}) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1563 ∈ wcel 2145 ∪ cun 3905 {csn 4585 {cpr 4587 {ctp 4589 “ cima 5655 Fn wfn 6520 ‘cfv 6525 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-10 2178 ax-12 2215 ax-ext 2737 ax-sep 5251 ax-nul 5261 ax-pr 5395 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1566 df-fal 1576 df-ex 1803 df-nf 1807 df-sb 2094 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-ne 2961 df-ral 3080 df-rex 3090 df-rab 3418 df-v 3459 df-dif 3910 df-un 3912 df-in 3914 df-ss 3924 df-nul 4289 df-if 4484 df-sn 4586 df-pr 4588 df-tp 4590 df-op 4592 df-uni 4869 df-br 5106 df-opab 5168 df-id 5547 df-xp 5658 df-rel 5659 df-cnv 5660 df-co 5661 df-dm 5662 df-rn 5663 df-res 5664 df-ima 5665 df-iota 6481 df-fun 6527 df-fn 6528 df-fv 6533 |
| This theorem is referenced by: s3rnOLD 33179 cycl3grtri 48567 grtrimap 48568 |
| Copyright terms: Public domain | W3C validator |