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

Theorem fntpg 6613
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 6608 . 2 (((𝑋𝑈𝑌𝑉𝑍𝑊) ∧ (𝐴𝐹𝐵𝐺𝐶𝐻) ∧ (𝑋𝑌𝑋𝑍𝑌𝑍)) → Fun {⟨𝑋, 𝐴⟩, ⟨𝑌, 𝐵⟩, ⟨𝑍, 𝐶⟩})
2 dmsnopg 6217 . . . . . . . . . 10 (𝐴𝐹 → dom {⟨𝑋, 𝐴⟩} = {𝑋})
323ad2ant1 1131 . . . . . . . . 9 ((𝐴𝐹𝐵𝐺𝐶𝐻) → dom {⟨𝑋, 𝐴⟩} = {𝑋})
4 dmsnopg 6217 . . . . . . . . . 10 (𝐵𝐺 → dom {⟨𝑌, 𝐵⟩} = {𝑌})
543ad2ant2 1132 . . . . . . . . 9 ((𝐴𝐹𝐵𝐺𝐶𝐻) → dom {⟨𝑌, 𝐵⟩} = {𝑌})
63, 5jca 511 . . . . . . . 8 ((𝐴𝐹𝐵𝐺𝐶𝐻) → (dom {⟨𝑋, 𝐴⟩} = {𝑋} ∧ dom {⟨𝑌, 𝐵⟩} = {𝑌}))
763ad2ant2 1132 . . . . . . 7 (((𝑋𝑈𝑌𝑉𝑍𝑊) ∧ (𝐴𝐹𝐵𝐺𝐶𝐻) ∧ (𝑋𝑌𝑋𝑍𝑌𝑍)) → (dom {⟨𝑋, 𝐴⟩} = {𝑋} ∧ dom {⟨𝑌, 𝐵⟩} = {𝑌}))
8 uneq12 4157 . . . . . . 7 ((dom {⟨𝑋, 𝐴⟩} = {𝑋} ∧ dom {⟨𝑌, 𝐵⟩} = {𝑌}) → (dom {⟨𝑋, 𝐴⟩} ∪ dom {⟨𝑌, 𝐵⟩}) = ({𝑋} ∪ {𝑌}))
97, 8syl 17 . . . . . 6 (((𝑋𝑈𝑌𝑉𝑍𝑊) ∧ (𝐴𝐹𝐵𝐺𝐶𝐻) ∧ (𝑋𝑌𝑋𝑍𝑌𝑍)) → (dom {⟨𝑋, 𝐴⟩} ∪ dom {⟨𝑌, 𝐵⟩}) = ({𝑋} ∪ {𝑌}))
10 df-pr 4632 . . . . . 6 {𝑋, 𝑌} = ({𝑋} ∪ {𝑌})
119, 10eqtr4di 2786 . . . . 5 (((𝑋𝑈𝑌𝑉𝑍𝑊) ∧ (𝐴𝐹𝐵𝐺𝐶𝐻) ∧ (𝑋𝑌𝑋𝑍𝑌𝑍)) → (dom {⟨𝑋, 𝐴⟩} ∪ dom {⟨𝑌, 𝐵⟩}) = {𝑋, 𝑌})
12 df-pr 4632 . . . . . . . 8 {⟨𝑋, 𝐴⟩, ⟨𝑌, 𝐵⟩} = ({⟨𝑋, 𝐴⟩} ∪ {⟨𝑌, 𝐵⟩})
1312dmeqi 5907 . . . . . . 7 dom {⟨𝑋, 𝐴⟩, ⟨𝑌, 𝐵⟩} = dom ({⟨𝑋, 𝐴⟩} ∪ {⟨𝑌, 𝐵⟩})
1413eqeq1i 2733 . . . . . 6 (dom {⟨𝑋, 𝐴⟩, ⟨𝑌, 𝐵⟩} = {𝑋, 𝑌} ↔ dom ({⟨𝑋, 𝐴⟩} ∪ {⟨𝑌, 𝐵⟩}) = {𝑋, 𝑌})
15 dmun 5913 . . . . . . 7 dom ({⟨𝑋, 𝐴⟩} ∪ {⟨𝑌, 𝐵⟩}) = (dom {⟨𝑋, 𝐴⟩} ∪ dom {⟨𝑌, 𝐵⟩})
1615eqeq1i 2733 . . . . . 6 (dom ({⟨𝑋, 𝐴⟩} ∪ {⟨𝑌, 𝐵⟩}) = {𝑋, 𝑌} ↔ (dom {⟨𝑋, 𝐴⟩} ∪ dom {⟨𝑌, 𝐵⟩}) = {𝑋, 𝑌})
1714, 16bitri 275 . . . . 5 (dom {⟨𝑋, 𝐴⟩, ⟨𝑌, 𝐵⟩} = {𝑋, 𝑌} ↔ (dom {⟨𝑋, 𝐴⟩} ∪ dom {⟨𝑌, 𝐵⟩}) = {𝑋, 𝑌})
1811, 17sylibr 233 . . . 4 (((𝑋𝑈𝑌𝑉𝑍𝑊) ∧ (𝐴𝐹𝐵𝐺𝐶𝐻) ∧ (𝑋𝑌𝑋𝑍𝑌𝑍)) → dom {⟨𝑋, 𝐴⟩, ⟨𝑌, 𝐵⟩} = {𝑋, 𝑌})
19 dmsnopg 6217 . . . . . 6 (𝐶𝐻 → dom {⟨𝑍, 𝐶⟩} = {𝑍})
20193ad2ant3 1133 . . . . 5 ((𝐴𝐹𝐵𝐺𝐶𝐻) → dom {⟨𝑍, 𝐶⟩} = {𝑍})
21203ad2ant2 1132 . . . 4 (((𝑋𝑈𝑌𝑉𝑍𝑊) ∧ (𝐴𝐹𝐵𝐺𝐶𝐻) ∧ (𝑋𝑌𝑋𝑍𝑌𝑍)) → dom {⟨𝑍, 𝐶⟩} = {𝑍})
2218, 21uneq12d 4163 . . 3 (((𝑋𝑈𝑌𝑉𝑍𝑊) ∧ (𝐴𝐹𝐵𝐺𝐶𝐻) ∧ (𝑋𝑌𝑋𝑍𝑌𝑍)) → (dom {⟨𝑋, 𝐴⟩, ⟨𝑌, 𝐵⟩} ∪ dom {⟨𝑍, 𝐶⟩}) = ({𝑋, 𝑌} ∪ {𝑍}))
23 df-tp 4634 . . . . 5 {⟨𝑋, 𝐴⟩, ⟨𝑌, 𝐵⟩, ⟨𝑍, 𝐶⟩} = ({⟨𝑋, 𝐴⟩, ⟨𝑌, 𝐵⟩} ∪ {⟨𝑍, 𝐶⟩})
2423dmeqi 5907 . . . 4 dom {⟨𝑋, 𝐴⟩, ⟨𝑌, 𝐵⟩, ⟨𝑍, 𝐶⟩} = dom ({⟨𝑋, 𝐴⟩, ⟨𝑌, 𝐵⟩} ∪ {⟨𝑍, 𝐶⟩})
25 dmun 5913 . . . 4 dom ({⟨𝑋, 𝐴⟩, ⟨𝑌, 𝐵⟩} ∪ {⟨𝑍, 𝐶⟩}) = (dom {⟨𝑋, 𝐴⟩, ⟨𝑌, 𝐵⟩} ∪ dom {⟨𝑍, 𝐶⟩})
2624, 25eqtri 2756 . . 3 dom {⟨𝑋, 𝐴⟩, ⟨𝑌, 𝐵⟩, ⟨𝑍, 𝐶⟩} = (dom {⟨𝑋, 𝐴⟩, ⟨𝑌, 𝐵⟩} ∪ dom {⟨𝑍, 𝐶⟩})
27 df-tp 4634 . . 3 {𝑋, 𝑌, 𝑍} = ({𝑋, 𝑌} ∪ {𝑍})
2822, 26, 273eqtr4g 2793 . 2 (((𝑋𝑈𝑌𝑉𝑍𝑊) ∧ (𝐴𝐹𝐵𝐺𝐶𝐻) ∧ (𝑋𝑌𝑋𝑍𝑌𝑍)) → dom {⟨𝑋, 𝐴⟩, ⟨𝑌, 𝐵⟩, ⟨𝑍, 𝐶⟩} = {𝑋, 𝑌, 𝑍})
29 df-fn 6551 . 2 ({⟨𝑋, 𝐴⟩, ⟨𝑌, 𝐵⟩, ⟨𝑍, 𝐶⟩} Fn {𝑋, 𝑌, 𝑍} ↔ (Fun {⟨𝑋, 𝐴⟩, ⟨𝑌, 𝐵⟩, ⟨𝑍, 𝐶⟩} ∧ dom {⟨𝑋, 𝐴⟩, ⟨𝑌, 𝐵⟩, ⟨𝑍, 𝐶⟩} = {𝑋, 𝑌, 𝑍}))
301, 28, 29sylanbrc 582 1 (((𝑋𝑈𝑌𝑉𝑍𝑊) ∧ (𝐴𝐹𝐵𝐺𝐶𝐻) ∧ (𝑋𝑌𝑋𝑍𝑌𝑍)) → {⟨𝑋, 𝐴⟩, ⟨𝑌, 𝐵⟩, ⟨𝑍, 𝐶⟩} Fn {𝑋, 𝑌, 𝑍})
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  w3a 1085   = wceq 1534  wcel 2099  wne 2937  cun 3945  {csn 4629  {cpr 4631  {ctp 4633  cop 4635  dom cdm 5678  Fun wfun 6542   Fn wfn 6543
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1906  ax-6 1964  ax-7 2004  ax-8 2101  ax-9 2109  ax-10 2130  ax-12 2167  ax-ext 2699  ax-sep 5299  ax-nul 5306  ax-pr 5429
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 847  df-3an 1087  df-tru 1537  df-fal 1547  df-ex 1775  df-nf 1779  df-sb 2061  df-mo 2530  df-clab 2706  df-cleq 2720  df-clel 2806  df-ne 2938  df-ral 3059  df-rex 3068  df-rab 3430  df-v 3473  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-nul 4324  df-if 4530  df-sn 4630  df-pr 4632  df-tp 4634  df-op 4636  df-br 5149  df-opab 5211  df-id 5576  df-xp 5684  df-rel 5685  df-cnv 5686  df-co 5687  df-dm 5688  df-fun 6550  df-fn 6551
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator