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

Theorem funcnvpr 5988
Description: The converse pair of ordered pairs is a function if the second members are different. Note that the second members need not be sets. (Contributed by AV, 23-Jan-2021.)
Assertion
Ref Expression
funcnvpr ((𝐴𝑈𝐶𝑉𝐵𝐷) → Fun {⟨𝐴, 𝐵⟩, ⟨𝐶, 𝐷⟩})

Proof of Theorem funcnvpr
StepHypRef Expression
1 funcnvsn 5974 . . . 4 Fun {⟨𝐴, 𝐵⟩}
2 funcnvsn 5974 . . . 4 Fun {⟨𝐶, 𝐷⟩}
31, 2pm3.2i 470 . . 3 (Fun {⟨𝐴, 𝐵⟩} ∧ Fun {⟨𝐶, 𝐷⟩})
4 df-rn 5154 . . . . . . 7 ran {⟨𝐴, 𝐵⟩} = dom {⟨𝐴, 𝐵⟩}
5 rnsnopg 5650 . . . . . . 7 (𝐴𝑈 → ran {⟨𝐴, 𝐵⟩} = {𝐵})
64, 5syl5eqr 2699 . . . . . 6 (𝐴𝑈 → dom {⟨𝐴, 𝐵⟩} = {𝐵})
7 df-rn 5154 . . . . . . 7 ran {⟨𝐶, 𝐷⟩} = dom {⟨𝐶, 𝐷⟩}
8 rnsnopg 5650 . . . . . . 7 (𝐶𝑉 → ran {⟨𝐶, 𝐷⟩} = {𝐷})
97, 8syl5eqr 2699 . . . . . 6 (𝐶𝑉 → dom {⟨𝐶, 𝐷⟩} = {𝐷})
106, 9ineqan12d 3849 . . . . 5 ((𝐴𝑈𝐶𝑉) → (dom {⟨𝐴, 𝐵⟩} ∩ dom {⟨𝐶, 𝐷⟩}) = ({𝐵} ∩ {𝐷}))
11103adant3 1101 . . . 4 ((𝐴𝑈𝐶𝑉𝐵𝐷) → (dom {⟨𝐴, 𝐵⟩} ∩ dom {⟨𝐶, 𝐷⟩}) = ({𝐵} ∩ {𝐷}))
12 disjsn2 4279 . . . . 5 (𝐵𝐷 → ({𝐵} ∩ {𝐷}) = ∅)
13123ad2ant3 1104 . . . 4 ((𝐴𝑈𝐶𝑉𝐵𝐷) → ({𝐵} ∩ {𝐷}) = ∅)
1411, 13eqtrd 2685 . . 3 ((𝐴𝑈𝐶𝑉𝐵𝐷) → (dom {⟨𝐴, 𝐵⟩} ∩ dom {⟨𝐶, 𝐷⟩}) = ∅)
15 funun 5970 . . 3 (((Fun {⟨𝐴, 𝐵⟩} ∧ Fun {⟨𝐶, 𝐷⟩}) ∧ (dom {⟨𝐴, 𝐵⟩} ∩ dom {⟨𝐶, 𝐷⟩}) = ∅) → Fun ({⟨𝐴, 𝐵⟩} ∪ {⟨𝐶, 𝐷⟩}))
163, 14, 15sylancr 696 . 2 ((𝐴𝑈𝐶𝑉𝐵𝐷) → Fun ({⟨𝐴, 𝐵⟩} ∪ {⟨𝐶, 𝐷⟩}))
17 df-pr 4213 . . . . 5 {⟨𝐴, 𝐵⟩, ⟨𝐶, 𝐷⟩} = ({⟨𝐴, 𝐵⟩} ∪ {⟨𝐶, 𝐷⟩})
1817cnveqi 5329 . . . 4 {⟨𝐴, 𝐵⟩, ⟨𝐶, 𝐷⟩} = ({⟨𝐴, 𝐵⟩} ∪ {⟨𝐶, 𝐷⟩})
19 cnvun 5573 . . . 4 ({⟨𝐴, 𝐵⟩} ∪ {⟨𝐶, 𝐷⟩}) = ({⟨𝐴, 𝐵⟩} ∪ {⟨𝐶, 𝐷⟩})
2018, 19eqtri 2673 . . 3 {⟨𝐴, 𝐵⟩, ⟨𝐶, 𝐷⟩} = ({⟨𝐴, 𝐵⟩} ∪ {⟨𝐶, 𝐷⟩})
2120funeqi 5947 . 2 (Fun {⟨𝐴, 𝐵⟩, ⟨𝐶, 𝐷⟩} ↔ Fun ({⟨𝐴, 𝐵⟩} ∪ {⟨𝐶, 𝐷⟩}))
2216, 21sylibr 224 1 ((𝐴𝑈𝐶𝑉𝐵𝐷) → Fun {⟨𝐴, 𝐵⟩, ⟨𝐶, 𝐷⟩})
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 383  w3a 1054   = wceq 1523  wcel 2030  wne 2823  cun 3605  cin 3606  c0 3948  {csn 4210  {cpr 4212  cop 4216  ccnv 5142  dom cdm 5143  ran crn 5144  Fun wfun 5920
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1762  ax-4 1777  ax-5 1879  ax-6 1945  ax-7 1981  ax-9 2039  ax-10 2059  ax-11 2074  ax-12 2087  ax-13 2282  ax-ext 2631  ax-sep 4814  ax-nul 4822  ax-pr 4936
This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3an 1056  df-tru 1526  df-ex 1745  df-nf 1750  df-sb 1938  df-eu 2502  df-mo 2503  df-clab 2638  df-cleq 2644  df-clel 2647  df-nfc 2782  df-ne 2824  df-ral 2946  df-rab 2950  df-v 3233  df-dif 3610  df-un 3612  df-in 3614  df-ss 3621  df-nul 3949  df-if 4120  df-sn 4211  df-pr 4213  df-op 4217  df-br 4686  df-opab 4746  df-id 5053  df-xp 5149  df-rel 5150  df-cnv 5151  df-co 5152  df-dm 5153  df-rn 5154  df-fun 5928
This theorem is referenced by:  funcnvtp  5989  funcnvqp  5990  funcnvqpOLD  5991  funcnvs2  13704
  Copyright terms: Public domain W3C validator