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

Theorem fpr 6461
Description: A function with a domain of two elements. (Contributed by Jeff Madsen, 20-Jun-2010.) (Proof shortened by Andrew Salmon, 22-Oct-2011.)
Hypotheses
Ref Expression
fpr.1 𝐴 ∈ V
fpr.2 𝐵 ∈ V
fpr.3 𝐶 ∈ V
fpr.4 𝐷 ∈ V
Assertion
Ref Expression
fpr (𝐴𝐵 → {⟨𝐴, 𝐶⟩, ⟨𝐵, 𝐷⟩}:{𝐴, 𝐵}⟶{𝐶, 𝐷})

Proof of Theorem fpr
StepHypRef Expression
1 fpr.1 . . . . . 6 𝐴 ∈ V
2 fpr.2 . . . . . 6 𝐵 ∈ V
3 fpr.3 . . . . . 6 𝐶 ∈ V
4 fpr.4 . . . . . 6 𝐷 ∈ V
51, 2, 3, 4funpr 5982 . . . . 5 (𝐴𝐵 → Fun {⟨𝐴, 𝐶⟩, ⟨𝐵, 𝐷⟩})
63, 4dmprop 5646 . . . . 5 dom {⟨𝐴, 𝐶⟩, ⟨𝐵, 𝐷⟩} = {𝐴, 𝐵}
75, 6jctir 560 . . . 4 (𝐴𝐵 → (Fun {⟨𝐴, 𝐶⟩, ⟨𝐵, 𝐷⟩} ∧ dom {⟨𝐴, 𝐶⟩, ⟨𝐵, 𝐷⟩} = {𝐴, 𝐵}))
8 df-fn 5929 . . . 4 ({⟨𝐴, 𝐶⟩, ⟨𝐵, 𝐷⟩} Fn {𝐴, 𝐵} ↔ (Fun {⟨𝐴, 𝐶⟩, ⟨𝐵, 𝐷⟩} ∧ dom {⟨𝐴, 𝐶⟩, ⟨𝐵, 𝐷⟩} = {𝐴, 𝐵}))
97, 8sylibr 224 . . 3 (𝐴𝐵 → {⟨𝐴, 𝐶⟩, ⟨𝐵, 𝐷⟩} Fn {𝐴, 𝐵})
10 df-pr 4213 . . . . . 6 {⟨𝐴, 𝐶⟩, ⟨𝐵, 𝐷⟩} = ({⟨𝐴, 𝐶⟩} ∪ {⟨𝐵, 𝐷⟩})
1110rneqi 5384 . . . . 5 ran {⟨𝐴, 𝐶⟩, ⟨𝐵, 𝐷⟩} = ran ({⟨𝐴, 𝐶⟩} ∪ {⟨𝐵, 𝐷⟩})
12 rnun 5576 . . . . 5 ran ({⟨𝐴, 𝐶⟩} ∪ {⟨𝐵, 𝐷⟩}) = (ran {⟨𝐴, 𝐶⟩} ∪ ran {⟨𝐵, 𝐷⟩})
131rnsnop 5653 . . . . . . 7 ran {⟨𝐴, 𝐶⟩} = {𝐶}
142rnsnop 5653 . . . . . . 7 ran {⟨𝐵, 𝐷⟩} = {𝐷}
1513, 14uneq12i 3798 . . . . . 6 (ran {⟨𝐴, 𝐶⟩} ∪ ran {⟨𝐵, 𝐷⟩}) = ({𝐶} ∪ {𝐷})
16 df-pr 4213 . . . . . 6 {𝐶, 𝐷} = ({𝐶} ∪ {𝐷})
1715, 16eqtr4i 2676 . . . . 5 (ran {⟨𝐴, 𝐶⟩} ∪ ran {⟨𝐵, 𝐷⟩}) = {𝐶, 𝐷}
1811, 12, 173eqtri 2677 . . . 4 ran {⟨𝐴, 𝐶⟩, ⟨𝐵, 𝐷⟩} = {𝐶, 𝐷}
1918eqimssi 3692 . . 3 ran {⟨𝐴, 𝐶⟩, ⟨𝐵, 𝐷⟩} ⊆ {𝐶, 𝐷}
209, 19jctir 560 . 2 (𝐴𝐵 → ({⟨𝐴, 𝐶⟩, ⟨𝐵, 𝐷⟩} Fn {𝐴, 𝐵} ∧ ran {⟨𝐴, 𝐶⟩, ⟨𝐵, 𝐷⟩} ⊆ {𝐶, 𝐷}))
21 df-f 5930 . 2 ({⟨𝐴, 𝐶⟩, ⟨𝐵, 𝐷⟩}:{𝐴, 𝐵}⟶{𝐶, 𝐷} ↔ ({⟨𝐴, 𝐶⟩, ⟨𝐵, 𝐷⟩} Fn {𝐴, 𝐵} ∧ ran {⟨𝐴, 𝐶⟩, ⟨𝐵, 𝐷⟩} ⊆ {𝐶, 𝐷}))
2220, 21sylibr 224 1 (𝐴𝐵 → {⟨𝐴, 𝐶⟩, ⟨𝐵, 𝐷⟩}:{𝐴, 𝐵}⟶{𝐶, 𝐷})
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 383   = wceq 1523  wcel 2030  wne 2823  Vcvv 3231  cun 3605  wss 3607  {csn 4210  {cpr 4212  cop 4216  dom cdm 5143  ran crn 5144  Fun wfun 5920   Fn wfn 5921  wf 5922
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-rex 2947  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  df-fn 5929  df-f 5930
This theorem is referenced by:  fprg  6462  1sdom  8204  axlowdimlem4  25870  coinfliprv  30672  fprb  31795  poimirlem22  33561  nnsum3primes4  42001  nnsum3primesgbe  42005
  Copyright terms: Public domain W3C validator