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

Theorem fpr 7189
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 . . . 4 𝐴 ∈ V
2 fpr.2 . . . 4 𝐵 ∈ V
3 fpr.3 . . . 4 𝐶 ∈ V
4 fpr.4 . . . 4 𝐷 ∈ V
51, 2, 3, 4funpr 6625 . . 3 (𝐴 ≠ 𝐵 → Fun {⟨𝐴, 𝐶⟩, ⟨𝐵, 𝐷⟩})
63, 4dmprop 6236 . . 3 dom {⟨𝐴, 𝐶⟩, ⟨𝐵, 𝐷⟩} = {𝐴, 𝐵}
7 df-fn 6568 . . 3 ({⟨𝐴, 𝐶⟩, ⟨𝐵, 𝐷⟩} Fn {𝐴, 𝐵} ↔ (Fun {⟨𝐴, 𝐶⟩, ⟨𝐵, 𝐷⟩} ∧ dom {⟨𝐴, 𝐶⟩, ⟨𝐵, 𝐷⟩} = {𝐴, 𝐵}))
85, 6, 7sylanblrc 602 . 2 (𝐴 ≠ 𝐵 → {⟨𝐴, 𝐶⟩, ⟨𝐵, 𝐷⟩} Fn {𝐴, 𝐵})
9 df-pr 4590 . . . . 5 {⟨𝐴, 𝐶⟩, ⟨𝐵, 𝐷⟩} = ({⟨𝐴, 𝐶⟩} ∪ {⟨𝐵, 𝐷⟩})
109rneqi 5930 . . . 4 ran {⟨𝐴, 𝐶⟩, ⟨𝐵, 𝐷⟩} = ran ({⟨𝐴, 𝐶⟩} ∪ {⟨𝐵, 𝐷⟩})
11 rnun 6153 . . . 4 ran ({⟨𝐴, 𝐶⟩} ∪ {⟨𝐵, 𝐷⟩}) = (ran {⟨𝐴, 𝐶⟩} ∪ ran {⟨𝐵, 𝐷⟩})
121rnsnop 6243 . . . . . 6 ran {⟨𝐴, 𝐶⟩} = {𝐶}
132rnsnop 6243 . . . . . 6 ran {⟨𝐵, 𝐷⟩} = {𝐷}
1412, 13uneq12i 4167 . . . . 5 (ran {⟨𝐴, 𝐶⟩} ∪ ran {⟨𝐵, 𝐷⟩}) = ({𝐶} ∪ {𝐷})
15 df-pr 4590 . . . . 5 {𝐶, 𝐷} = ({𝐶} ∪ {𝐷})
1614, 15eqtr4i 2792 . . . 4 (ran {⟨𝐴, 𝐶⟩} ∪ ran {⟨𝐵, 𝐷⟩}) = {𝐶, 𝐷}
1710, 11, 163eqtri 2793 . . 3 ran {⟨𝐴, 𝐶⟩, ⟨𝐵, 𝐷⟩} = {𝐶, 𝐷}
1817eqimssi 3972 . 2 ran {⟨𝐴, 𝐶⟩, ⟨𝐵, 𝐷⟩} ⊆ {𝐶, 𝐷}
19 df-f 6569 . 2 ({⟨𝐴, 𝐶⟩, ⟨𝐵, 𝐷⟩}:{𝐴, 𝐵}⟶{𝐶, 𝐷} ↔ ({⟨𝐴, 𝐶⟩, ⟨𝐵, 𝐷⟩} Fn {𝐴, 𝐵} ∧ ran {⟨𝐴, 𝐶⟩, ⟨𝐵, 𝐷⟩} ⊆ {𝐶, 𝐷}))
208, 18, 19sylanblrc 602 1 (𝐴 ≠ 𝐵 → {⟨𝐴, 𝐶⟩, ⟨𝐵, 𝐷⟩}:{𝐴, 𝐵}⟶{𝐶, 𝐷})
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1572   ∈ wcel 2150   ≠ wne 2962  Vcvv 3453   ⊆ wss 3899   ∪ cun 4151  {csn 4587  {cpr 4589  ⟨cop 4839  dom cdm 5657  ran crn 5658  Fun wfun 6559   Fn wfn 6560  ⟶wf 6561
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-12 2219  ax-ext 2738  ax-sep 5254  ax-pr 5397
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1106  df-tru 1575  df-fal 1585  df-ex 1815  df-sb 2104  df-mo 2570  df-clab 2745  df-cleq 2758  df-clel 2842  df-ne 2963  df-ral 3084  df-rex 3094  df-rab 3416  df-v 3455  df-ss 3900  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-sn 4588  df-pr 4590  df-op 4840  df-br 5108  df-opab 5173  df-id 5552  df-xp 5663  df-rel 5664  df-cnv 5665  df-co 5666  df-dm 5667  df-rn 5668  df-fun 6567  df-fn 6568  df-f 6569
This theorem is used by:  fprg  7190  fprb  7229  axlowdimlem4  29582  coinfliprv  35227  poimirlem22  38830  nnsum3primes4  49219  nnsum3primesgbe  49223
  Copyright terms: Public domain W3C validator