| 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 6964 | . . . 4 ⊢ ((𝐹 Fn 𝐷 ∧ 𝐴 ∈ 𝐷 ∧ 𝐵 ∈ 𝐷) → (𝐹 “ {𝐴, 𝐵}) = {(𝐹‘𝐴), (𝐹‘𝐵)}) | |
| 5 | 1, 2, 3, 4 | syl3anc 1396 | . . 3 ⊢ (𝜑 → (𝐹 “ {𝐴, 𝐵}) = {(𝐹‘𝐴), (𝐹‘𝐵)}) |
| 6 | fnimatpd.4 | . . . . 5 ⊢ (𝜑 → 𝐶 ∈ 𝐷) | |
| 7 | fnsnfv 6960 | . . . . 5 ⊢ ((𝐹 Fn 𝐷 ∧ 𝐶 ∈ 𝐷) → {(𝐹‘𝐶)} = (𝐹 “ {𝐶})) | |
| 8 | 1, 6, 7 | syl2anc 595 | . . . 4 ⊢ (𝜑 → {(𝐹‘𝐶)} = (𝐹 “ {𝐶})) |
| 9 | 8 | eqcomd 2767 | . . 3 ⊢ (𝜑 → (𝐹 “ {𝐶}) = {(𝐹‘𝐶)}) |
| 10 | 5, 9 | uneq12d 4122 | . 2 ⊢ (𝜑 → ((𝐹 “ {𝐴, 𝐵}) ∪ (𝐹 “ {𝐶})) = ({(𝐹‘𝐴), (𝐹‘𝐵)} ∪ {(𝐹‘𝐶)})) |
| 11 | df-tp 4593 | . . . 4 ⊢ {𝐴, 𝐵, 𝐶} = ({𝐴, 𝐵} ∪ {𝐶}) | |
| 12 | 11 | imaeq2i 6060 | . . 3 ⊢ (𝐹 “ {𝐴, 𝐵, 𝐶}) = (𝐹 “ ({𝐴, 𝐵} ∪ {𝐶})) |
| 13 | imaundi 6147 | . . 3 ⊢ (𝐹 “ ({𝐴, 𝐵} ∪ {𝐶})) = ((𝐹 “ {𝐴, 𝐵}) ∪ (𝐹 “ {𝐶})) | |
| 14 | 12, 13 | eqtri 2784 | . 2 ⊢ (𝐹 “ {𝐴, 𝐵, 𝐶}) = ((𝐹 “ {𝐴, 𝐵}) ∪ (𝐹 “ {𝐶})) |
| 15 | df-tp 4593 | . 2 ⊢ {(𝐹‘𝐴), (𝐹‘𝐵), (𝐹‘𝐶)} = ({(𝐹‘𝐴), (𝐹‘𝐵)} ∪ {(𝐹‘𝐶)}) | |
| 16 | 10, 14, 15 | 3eqtr4g 2821 | 1 ⊢ (𝜑 → (𝐹 “ {𝐴, 𝐵, 𝐶}) = {(𝐹‘𝐴), (𝐹‘𝐵), (𝐹‘𝐶)}) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1568 ∈ wcel 2141 ∪ cun 3902 {csn 4588 {cpr 4590 {ctp 4592 “ cima 5664 Fn wfn 6531 ‘cfv 6536 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1823 ax-4 1837 ax-5 1938 ax-6 1995 ax-7 2036 ax-8 2143 ax-9 2151 ax-10 2174 ax-12 2211 ax-ext 2733 ax-sep 5256 ax-nul 5268 ax-pr 5404 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1571 df-fal 1581 df-ex 1808 df-nf 1812 df-sb 2095 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-ne 2957 df-ral 3078 df-rex 3088 df-rab 3415 df-v 3455 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-nul 4286 df-if 4487 df-sn 4589 df-pr 4591 df-tp 4593 df-op 4595 df-uni 4872 df-br 5109 df-opab 5173 df-id 5556 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-iota 6492 df-fun 6538 df-fn 6539 df-fv 6544 |
| This theorem is referenced by: s3rnOLD 33232 cycl3grtri 48679 grtrimap 48680 |
| Copyright terms: Public domain | W3C validator |