| 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 6939 | . . . 4 ⊢ ((𝐹 Fn 𝐷 ∧ 𝐴 ∈ 𝐷 ∧ 𝐵 ∈ 𝐷) → (𝐹 “ {𝐴, 𝐵}) = {(𝐹‘𝐴), (𝐹‘𝐵)}) | |
| 5 | 1, 2, 3, 4 | syl3anc 1386 | . . 3 ⊢ (𝜑 → (𝐹 “ {𝐴, 𝐵}) = {(𝐹‘𝐴), (𝐹‘𝐵)}) |
| 6 | fnimatpd.4 | . . . . 5 ⊢ (𝜑 → 𝐶 ∈ 𝐷) | |
| 7 | fnsnfv 6935 | . . . . 5 ⊢ ((𝐹 Fn 𝐷 ∧ 𝐶 ∈ 𝐷) → {(𝐹‘𝐶)} = (𝐹 “ {𝐶})) | |
| 8 | 1, 6, 7 | syl2anc 592 | . . . 4 ⊢ (𝜑 → {(𝐹‘𝐶)} = (𝐹 “ {𝐶})) |
| 9 | 8 | eqcomd 2762 | . . 3 ⊢ (𝜑 → (𝐹 “ {𝐶}) = {(𝐹‘𝐶)}) |
| 10 | 5, 9 | uneq12d 4117 | . 2 ⊢ (𝜑 → ((𝐹 “ {𝐴, 𝐵}) ∪ (𝐹 “ {𝐶})) = ({(𝐹‘𝐴), (𝐹‘𝐵)} ∪ {(𝐹‘𝐶)})) |
| 11 | df-tp 4581 | . . . 4 ⊢ {𝐴, 𝐵, 𝐶} = ({𝐴, 𝐵} ∪ {𝐶}) | |
| 12 | 11 | imaeq2i 6037 | . . 3 ⊢ (𝐹 “ {𝐴, 𝐵, 𝐶}) = (𝐹 “ ({𝐴, 𝐵} ∪ {𝐶})) |
| 13 | imaundi 6124 | . . 3 ⊢ (𝐹 “ ({𝐴, 𝐵} ∪ {𝐶})) = ((𝐹 “ {𝐴, 𝐵}) ∪ (𝐹 “ {𝐶})) | |
| 14 | 12, 13 | eqtri 2779 | . 2 ⊢ (𝐹 “ {𝐴, 𝐵, 𝐶}) = ((𝐹 “ {𝐴, 𝐵}) ∪ (𝐹 “ {𝐶})) |
| 15 | df-tp 4581 | . 2 ⊢ {(𝐹‘𝐴), (𝐹‘𝐵), (𝐹‘𝐶)} = ({(𝐹‘𝐴), (𝐹‘𝐵)} ∪ {(𝐹‘𝐶)}) | |
| 16 | 10, 14, 15 | 3eqtr4g 2816 | 1 ⊢ (𝜑 → (𝐹 “ {𝐴, 𝐵, 𝐶}) = {(𝐹‘𝐴), (𝐹‘𝐵), (𝐹‘𝐶)}) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1554 ∈ wcel 2136 ∪ cun 3897 {csn 4576 {cpr 4578 {ctp 4580 “ cima 5643 Fn wfn 6505 ‘cfv 6510 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1809 ax-4 1823 ax-5 1924 ax-6 1981 ax-7 2022 ax-8 2138 ax-9 2146 ax-10 2169 ax-12 2206 ax-ext 2728 ax-sep 5240 ax-nul 5250 ax-pr 5384 |
| This theorem depends on definitions: df-bi 209 df-an 399 df-or 857 df-3an 1097 df-tru 1557 df-fal 1567 df-ex 1794 df-nf 1798 df-sb 2085 df-mo 2560 df-eu 2590 df-clab 2735 df-cleq 2748 df-clel 2831 df-ne 2952 df-ral 3071 df-rex 3081 df-rab 3409 df-v 3450 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4281 df-if 4475 df-sn 4577 df-pr 4579 df-tp 4581 df-op 4583 df-uni 4860 df-br 5095 df-opab 5157 df-id 5535 df-xp 5646 df-rel 5647 df-cnv 5648 df-co 5649 df-dm 5650 df-rn 5651 df-res 5652 df-ima 5653 df-iota 6466 df-fun 6512 df-fn 6513 df-fv 6518 |
| This theorem is referenced by: s3rnOLD 33078 cycl3grtri 48517 grtrimap 48518 |
| Copyright terms: Public domain | W3C validator |