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

Theorem fntpg 6560
Description: Function with a domain of three different values. (Contributed by Alexander van der Vekens, 5-Dec-2017.)
Assertion
Ref Expression
fntpg (((𝑋𝑈𝑌𝑉𝑍𝑊) ∧ (𝐴𝐹𝐵𝐺𝐶𝐻) ∧ (𝑋𝑌𝑋𝑍𝑌𝑍)) → {⟨𝑋, 𝐴⟩, ⟨𝑌, 𝐵⟩, ⟨𝑍, 𝐶⟩} Fn {𝑋, 𝑌, 𝑍})

Proof of Theorem fntpg
StepHypRef Expression
1 funtpg 6555 . 2 (((𝑋𝑈𝑌𝑉𝑍𝑊) ∧ (𝐴𝐹𝐵𝐺𝐶𝐻) ∧ (𝑋𝑌𝑋𝑍𝑌𝑍)) → Fun {⟨𝑋, 𝐴⟩, ⟨𝑌, 𝐵⟩, ⟨𝑍, 𝐶⟩})
2 dmsnopg 6179 . . . . . . . . . 10 (𝐴𝐹 → dom {⟨𝑋, 𝐴⟩} = {𝑋})
323ad2ant1 1134 . . . . . . . . 9 ((𝐴𝐹𝐵𝐺𝐶𝐻) → dom {⟨𝑋, 𝐴⟩} = {𝑋})
4 dmsnopg 6179 . . . . . . . . . 10 (𝐵𝐺 → dom {⟨𝑌, 𝐵⟩} = {𝑌})
543ad2ant2 1135 . . . . . . . . 9 ((𝐴𝐹𝐵𝐺𝐶𝐻) → dom {⟨𝑌, 𝐵⟩} = {𝑌})
63, 5jca 511 . . . . . . . 8 ((𝐴𝐹𝐵𝐺𝐶𝐻) → (dom {⟨𝑋, 𝐴⟩} = {𝑋} ∧ dom {⟨𝑌, 𝐵⟩} = {𝑌}))
763ad2ant2 1135 . . . . . . 7 (((𝑋𝑈𝑌𝑉𝑍𝑊) ∧ (𝐴𝐹𝐵𝐺𝐶𝐻) ∧ (𝑋𝑌𝑋𝑍𝑌𝑍)) → (dom {⟨𝑋, 𝐴⟩} = {𝑋} ∧ dom {⟨𝑌, 𝐵⟩} = {𝑌}))
8 uneq12 4117 . . . . . . 7 ((dom {⟨𝑋, 𝐴⟩} = {𝑋} ∧ dom {⟨𝑌, 𝐵⟩} = {𝑌}) → (dom {⟨𝑋, 𝐴⟩} ∪ dom {⟨𝑌, 𝐵⟩}) = ({𝑋} ∪ {𝑌}))
97, 8syl 17 . . . . . 6 (((𝑋𝑈𝑌𝑉𝑍𝑊) ∧ (𝐴𝐹𝐵𝐺𝐶𝐻) ∧ (𝑋𝑌𝑋𝑍𝑌𝑍)) → (dom {⟨𝑋, 𝐴⟩} ∪ dom {⟨𝑌, 𝐵⟩}) = ({𝑋} ∪ {𝑌}))
10 df-pr 4585 . . . . . 6 {𝑋, 𝑌} = ({𝑋} ∪ {𝑌})
119, 10eqtr4di 2790 . . . . 5 (((𝑋𝑈𝑌𝑉𝑍𝑊) ∧ (𝐴𝐹𝐵𝐺𝐶𝐻) ∧ (𝑋𝑌𝑋𝑍𝑌𝑍)) → (dom {⟨𝑋, 𝐴⟩} ∪ dom {⟨𝑌, 𝐵⟩}) = {𝑋, 𝑌})
12 df-pr 4585 . . . . . . . 8 {⟨𝑋, 𝐴⟩, ⟨𝑌, 𝐵⟩} = ({⟨𝑋, 𝐴⟩} ∪ {⟨𝑌, 𝐵⟩})
1312dmeqi 5861 . . . . . . 7 dom {⟨𝑋, 𝐴⟩, ⟨𝑌, 𝐵⟩} = dom ({⟨𝑋, 𝐴⟩} ∪ {⟨𝑌, 𝐵⟩})
1413eqeq1i 2742 . . . . . 6 (dom {⟨𝑋, 𝐴⟩, ⟨𝑌, 𝐵⟩} = {𝑋, 𝑌} ↔ dom ({⟨𝑋, 𝐴⟩} ∪ {⟨𝑌, 𝐵⟩}) = {𝑋, 𝑌})
15 dmun 5867 . . . . . . 7 dom ({⟨𝑋, 𝐴⟩} ∪ {⟨𝑌, 𝐵⟩}) = (dom {⟨𝑋, 𝐴⟩} ∪ dom {⟨𝑌, 𝐵⟩})
1615eqeq1i 2742 . . . . . 6 (dom ({⟨𝑋, 𝐴⟩} ∪ {⟨𝑌, 𝐵⟩}) = {𝑋, 𝑌} ↔ (dom {⟨𝑋, 𝐴⟩} ∪ dom {⟨𝑌, 𝐵⟩}) = {𝑋, 𝑌})
1714, 16bitri 275 . . . . 5 (dom {⟨𝑋, 𝐴⟩, ⟨𝑌, 𝐵⟩} = {𝑋, 𝑌} ↔ (dom {⟨𝑋, 𝐴⟩} ∪ dom {⟨𝑌, 𝐵⟩}) = {𝑋, 𝑌})
1811, 17sylibr 234 . . . 4 (((𝑋𝑈𝑌𝑉𝑍𝑊) ∧ (𝐴𝐹𝐵𝐺𝐶𝐻) ∧ (𝑋𝑌𝑋𝑍𝑌𝑍)) → dom {⟨𝑋, 𝐴⟩, ⟨𝑌, 𝐵⟩} = {𝑋, 𝑌})
19 dmsnopg 6179 . . . . . 6 (𝐶𝐻 → dom {⟨𝑍, 𝐶⟩} = {𝑍})
20193ad2ant3 1136 . . . . 5 ((𝐴𝐹𝐵𝐺𝐶𝐻) → dom {⟨𝑍, 𝐶⟩} = {𝑍})
21203ad2ant2 1135 . . . 4 (((𝑋𝑈𝑌𝑉𝑍𝑊) ∧ (𝐴𝐹𝐵𝐺𝐶𝐻) ∧ (𝑋𝑌𝑋𝑍𝑌𝑍)) → dom {⟨𝑍, 𝐶⟩} = {𝑍})
2218, 21uneq12d 4123 . . 3 (((𝑋𝑈𝑌𝑉𝑍𝑊) ∧ (𝐴𝐹𝐵𝐺𝐶𝐻) ∧ (𝑋𝑌𝑋𝑍𝑌𝑍)) → (dom {⟨𝑋, 𝐴⟩, ⟨𝑌, 𝐵⟩} ∪ dom {⟨𝑍, 𝐶⟩}) = ({𝑋, 𝑌} ∪ {𝑍}))
23 df-tp 4587 . . . . 5 {⟨𝑋, 𝐴⟩, ⟨𝑌, 𝐵⟩, ⟨𝑍, 𝐶⟩} = ({⟨𝑋, 𝐴⟩, ⟨𝑌, 𝐵⟩} ∪ {⟨𝑍, 𝐶⟩})
2423dmeqi 5861 . . . 4 dom {⟨𝑋, 𝐴⟩, ⟨𝑌, 𝐵⟩, ⟨𝑍, 𝐶⟩} = dom ({⟨𝑋, 𝐴⟩, ⟨𝑌, 𝐵⟩} ∪ {⟨𝑍, 𝐶⟩})
25 dmun 5867 . . . 4 dom ({⟨𝑋, 𝐴⟩, ⟨𝑌, 𝐵⟩} ∪ {⟨𝑍, 𝐶⟩}) = (dom {⟨𝑋, 𝐴⟩, ⟨𝑌, 𝐵⟩} ∪ dom {⟨𝑍, 𝐶⟩})
2624, 25eqtri 2760 . . 3 dom {⟨𝑋, 𝐴⟩, ⟨𝑌, 𝐵⟩, ⟨𝑍, 𝐶⟩} = (dom {⟨𝑋, 𝐴⟩, ⟨𝑌, 𝐵⟩} ∪ dom {⟨𝑍, 𝐶⟩})
27 df-tp 4587 . . 3 {𝑋, 𝑌, 𝑍} = ({𝑋, 𝑌} ∪ {𝑍})
2822, 26, 273eqtr4g 2797 . 2 (((𝑋𝑈𝑌𝑉𝑍𝑊) ∧ (𝐴𝐹𝐵𝐺𝐶𝐻) ∧ (𝑋𝑌𝑋𝑍𝑌𝑍)) → dom {⟨𝑋, 𝐴⟩, ⟨𝑌, 𝐵⟩, ⟨𝑍, 𝐶⟩} = {𝑋, 𝑌, 𝑍})
29 df-fn 6503 . 2 ({⟨𝑋, 𝐴⟩, ⟨𝑌, 𝐵⟩, ⟨𝑍, 𝐶⟩} Fn {𝑋, 𝑌, 𝑍} ↔ (Fun {⟨𝑋, 𝐴⟩, ⟨𝑌, 𝐵⟩, ⟨𝑍, 𝐶⟩} ∧ dom {⟨𝑋, 𝐴⟩, ⟨𝑌, 𝐵⟩, ⟨𝑍, 𝐶⟩} = {𝑋, 𝑌, 𝑍}))
301, 28, 29sylanbrc 584 1 (((𝑋𝑈𝑌𝑉𝑍𝑊) ∧ (𝐴𝐹𝐵𝐺𝐶𝐻) ∧ (𝑋𝑌𝑋𝑍𝑌𝑍)) → {⟨𝑋, 𝐴⟩, ⟨𝑌, 𝐵⟩, ⟨𝑍, 𝐶⟩} Fn {𝑋, 𝑌, 𝑍})
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  w3a 1087   = wceq 1542  wcel 2114  wne 2933  cun 3901  {csn 4582  {cpr 4584  {ctp 4586  cop 4588  dom cdm 5632  Fun wfun 6494   Fn wfn 6495
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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-12 2185  ax-ext 2709  ax-sep 5243  ax-pr 5379
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-sb 2069  df-mo 2540  df-clab 2716  df-cleq 2729  df-clel 2812  df-ne 2934  df-ral 3053  df-rex 3063  df-rab 3402  df-v 3444  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-sn 4583  df-pr 4585  df-tp 4587  df-op 4589  df-br 5101  df-opab 5163  df-id 5527  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-fun 6502  df-fn 6503
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator