MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  fnimatpd Structured version   Visualization version   GIF version

Theorem fnimatpd 6901
Description: The image of an unordered triple under a function. (Contributed by Thierry Arnoux, 19-Sep-2023.)
Hypotheses
Ref Expression
fnimatpd.1 (𝜑𝐹 Fn 𝐷)
fnimatpd.2 (𝜑𝐴𝐷)
fnimatpd.3 (𝜑𝐵𝐷)
fnimatpd.4 (𝜑𝐶𝐷)
Assertion
Ref Expression
fnimatpd (𝜑 → (𝐹 “ {𝐴, 𝐵, 𝐶}) = {(𝐹𝐴), (𝐹𝐵), (𝐹𝐶)})

Proof of Theorem fnimatpd
StepHypRef Expression
1 fnimatpd.1 . . . 4 (𝜑𝐹 Fn 𝐷)
2 fnimatpd.2 . . . 4 (𝜑𝐴𝐷)
3 fnimatpd.3 . . . 4 (𝜑𝐵𝐷)
4 fnimapr 6900 . . . 4 ((𝐹 Fn 𝐷𝐴𝐷𝐵𝐷) → (𝐹 “ {𝐴, 𝐵}) = {(𝐹𝐴), (𝐹𝐵)})
51, 2, 3, 4syl3anc 1373 . . 3 (𝜑 → (𝐹 “ {𝐴, 𝐵}) = {(𝐹𝐴), (𝐹𝐵)})
6 fnimatpd.4 . . . . 5 (𝜑𝐶𝐷)
7 fnsnfv 6896 . . . . 5 ((𝐹 Fn 𝐷𝐶𝐷) → {(𝐹𝐶)} = (𝐹 “ {𝐶}))
81, 6, 7syl2anc 584 . . . 4 (𝜑 → {(𝐹𝐶)} = (𝐹 “ {𝐶}))
98eqcomd 2736 . . 3 (𝜑 → (𝐹 “ {𝐶}) = {(𝐹𝐶)})
105, 9uneq12d 4117 . 2 (𝜑 → ((𝐹 “ {𝐴, 𝐵}) ∪ (𝐹 “ {𝐶})) = ({(𝐹𝐴), (𝐹𝐵)} ∪ {(𝐹𝐶)}))
11 df-tp 4579 . . . 4 {𝐴, 𝐵, 𝐶} = ({𝐴, 𝐵} ∪ {𝐶})
1211imaeq2i 6004 . . 3 (𝐹 “ {𝐴, 𝐵, 𝐶}) = (𝐹 “ ({𝐴, 𝐵} ∪ {𝐶}))
13 imaundi 6093 . . 3 (𝐹 “ ({𝐴, 𝐵} ∪ {𝐶})) = ((𝐹 “ {𝐴, 𝐵}) ∪ (𝐹 “ {𝐶}))
1412, 13eqtri 2753 . 2 (𝐹 “ {𝐴, 𝐵, 𝐶}) = ((𝐹 “ {𝐴, 𝐵}) ∪ (𝐹 “ {𝐶}))
15 df-tp 4579 . 2 {(𝐹𝐴), (𝐹𝐵), (𝐹𝐶)} = ({(𝐹𝐴), (𝐹𝐵)} ∪ {(𝐹𝐶)})
1610, 14, 153eqtr4g 2790 1 (𝜑 → (𝐹 “ {𝐴, 𝐵, 𝐶}) = {(𝐹𝐴), (𝐹𝐵), (𝐹𝐶)})
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1541  wcel 2110  cun 3898  {csn 4574  {cpr 4576  {ctp 4578  cima 5617   Fn wfn 6472  cfv 6477
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2112  ax-9 2120  ax-10 2143  ax-12 2179  ax-ext 2702  ax-sep 5232  ax-nul 5242  ax-pr 5368
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2067  df-mo 2534  df-eu 2563  df-clab 2709  df-cleq 2722  df-clel 2804  df-ne 2927  df-ral 3046  df-rex 3055  df-rab 3394  df-v 3436  df-dif 3903  df-un 3905  df-in 3907  df-ss 3917  df-nul 4282  df-if 4474  df-sn 4575  df-pr 4577  df-tp 4579  df-op 4581  df-uni 4858  df-br 5090  df-opab 5152  df-id 5509  df-xp 5620  df-rel 5621  df-cnv 5622  df-co 5623  df-dm 5624  df-rn 5625  df-res 5626  df-ima 5627  df-iota 6433  df-fun 6479  df-fn 6480  df-fv 6485
This theorem is referenced by:  s3rnOLD  32917  cycl3grtri  47957  grtrimap  47958
  Copyright terms: Public domain W3C validator