Users' Mathboxes Mathbox for Thierry Arnoux < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  fnimatp Structured version   Visualization version   GIF version

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

Proof of Theorem fnimatp
StepHypRef Expression
1 fnimatp.1 . . . 4 (𝜑𝐹 Fn 𝐷)
2 fnimatp.2 . . . 4 (𝜑𝐴𝐷)
3 fnimatp.3 . . . 4 (𝜑𝐵𝐷)
4 fnimapr 6920 . . . 4 ((𝐹 Fn 𝐷𝐴𝐷𝐵𝐷) → (𝐹 “ {𝐴, 𝐵}) = {(𝐹𝐴), (𝐹𝐵)})
51, 2, 3, 4syl3anc 1371 . . 3 (𝜑 → (𝐹 “ {𝐴, 𝐵}) = {(𝐹𝐴), (𝐹𝐵)})
6 fnimatp.4 . . . . 5 (𝜑𝐶𝐷)
7 fnsnfv 6915 . . . . 5 ((𝐹 Fn 𝐷𝐶𝐷) → {(𝐹𝐶)} = (𝐹 “ {𝐶}))
81, 6, 7syl2anc 585 . . . 4 (𝜑 → {(𝐹𝐶)} = (𝐹 “ {𝐶}))
98eqcomd 2743 . . 3 (𝜑 → (𝐹 “ {𝐶}) = {(𝐹𝐶)})
105, 9uneq12d 4122 . 2 (𝜑 → ((𝐹 “ {𝐴, 𝐵}) ∪ (𝐹 “ {𝐶})) = ({(𝐹𝐴), (𝐹𝐵)} ∪ {(𝐹𝐶)}))
11 df-tp 4589 . . . 4 {𝐴, 𝐵, 𝐶} = ({𝐴, 𝐵} ∪ {𝐶})
1211imaeq2i 6007 . . 3 (𝐹 “ {𝐴, 𝐵, 𝐶}) = (𝐹 “ ({𝐴, 𝐵} ∪ {𝐶}))
13 imaundi 6098 . . 3 (𝐹 “ ({𝐴, 𝐵} ∪ {𝐶})) = ((𝐹 “ {𝐴, 𝐵}) ∪ (𝐹 “ {𝐶}))
1412, 13eqtri 2765 . 2 (𝐹 “ {𝐴, 𝐵, 𝐶}) = ((𝐹 “ {𝐴, 𝐵}) ∪ (𝐹 “ {𝐶}))
15 df-tp 4589 . 2 {(𝐹𝐴), (𝐹𝐵), (𝐹𝐶)} = ({(𝐹𝐴), (𝐹𝐵)} ∪ {(𝐹𝐶)})
1610, 14, 153eqtr4g 2802 1 (𝜑 → (𝐹 “ {𝐴, 𝐵, 𝐶}) = {(𝐹𝐴), (𝐹𝐵), (𝐹𝐶)})
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1541  wcel 2106  cun 3906  {csn 4584  {cpr 4586  {ctp 4588  cima 5633   Fn wfn 6486  cfv 6491
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-12 2171  ax-ext 2708  ax-sep 5254  ax-nul 5261  ax-pr 5382
This theorem depends on definitions:  df-bi 206  df-an 398  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2539  df-eu 2568  df-clab 2715  df-cleq 2729  df-clel 2815  df-ne 2942  df-ral 3063  df-rex 3072  df-rab 3406  df-v 3445  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4281  df-if 4485  df-sn 4585  df-pr 4587  df-tp 4589  df-op 4591  df-uni 4864  df-br 5104  df-opab 5166  df-id 5528  df-xp 5636  df-rel 5637  df-cnv 5638  df-co 5639  df-dm 5640  df-rn 5641  df-res 5642  df-ima 5643  df-iota 6443  df-fun 6493  df-fn 6494  df-fv 6499
This theorem is referenced by:  s3rn  31574
  Copyright terms: Public domain W3C validator