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

Theorem funcnvsn 6575
Description: The converse singleton of an ordered pair is a function. This is equivalent to funsn 6578 via cnvsn 6217, but stating it this way allows to skip the sethood assumptions on 𝐴 and 𝐵. (Contributed by NM, 30-Apr-2015.)
Assertion
Ref Expression
funcnvsn Fun {⟨𝐴, 𝐵⟩}

Proof of Theorem funcnvsn
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 relcnv 6097 . 2 Rel {⟨𝐴, 𝐵⟩}
2 moeq 3673 . . . 4 ∃*𝑦 𝑦 = 𝐴
3 vex 3461 . . . . . . . 8 𝑥 ∈ V
4 vex 3461 . . . . . . . 8 𝑦 ∈ V
53, 4brcnv 5859 . . . . . . 7 (𝑥{⟨𝐴, 𝐵⟩}𝑦𝑦{⟨𝐴, 𝐵⟩}𝑥)
6 df-br 5106 . . . . . . 7 (𝑦{⟨𝐴, 𝐵⟩}𝑥 ↔ ⟨𝑦, 𝑥⟩ ∈ {⟨𝐴, 𝐵⟩})
75, 6bitri 278 . . . . . 6 (𝑥{⟨𝐴, 𝐵⟩}𝑦 ↔ ⟨𝑦, 𝑥⟩ ∈ {⟨𝐴, 𝐵⟩})
8 elsni 4602 . . . . . . 7 (⟨𝑦, 𝑥⟩ ∈ {⟨𝐴, 𝐵⟩} → ⟨𝑦, 𝑥⟩ = ⟨𝐴, 𝐵⟩)
94, 3opth1 5448 . . . . . . 7 (⟨𝑦, 𝑥⟩ = ⟨𝐴, 𝐵⟩ → 𝑦 = 𝐴)
108, 9syl 18 . . . . . 6 (⟨𝑦, 𝑥⟩ ∈ {⟨𝐴, 𝐵⟩} → 𝑦 = 𝐴)
117, 10sylbi 220 . . . . 5 (𝑥{⟨𝐴, 𝐵⟩}𝑦𝑦 = 𝐴)
1211moimi 2575 . . . 4 (∃*𝑦 𝑦 = 𝐴 → ∃*𝑦 𝑥{⟨𝐴, 𝐵⟩}𝑦)
132, 12ax-mp 5 . . 3 ∃*𝑦 𝑥{⟨𝐴, 𝐵⟩}𝑦
1413ax-gen 1818 . 2 𝑥∃*𝑦 𝑥{⟨𝐴, 𝐵⟩}𝑦
15 dffun6 6536 . 2 (Fun {⟨𝐴, 𝐵⟩} ↔ (Rel {⟨𝐴, 𝐵⟩} ∧ ∀𝑥∃*𝑦 𝑥{⟨𝐴, 𝐵⟩}𝑦))
161, 14, 15mpbir2an 723 1 Fun {⟨𝐴, 𝐵⟩}
Colors of variables: wff setvar class
Syntax hints:  wal 1561   = wceq 1563  wcel 2145  ∃*wmo 2567  {csn 4585  cop 4591   class class class wbr 5105  ccnv 5651  Rel wrel 5657  Fun wfun 6519
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155  ax-ext 2737  ax-sep 5251  ax-pr 5395
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1566  df-fal 1576  df-ex 1803  df-sb 2094  df-mo 2569  df-clab 2744  df-cleq 2757  df-clel 2840  df-ral 3080  df-rex 3090  df-rab 3418  df-v 3459  df-dif 3910  df-un 3912  df-in 3914  df-ss 3924  df-nul 4289  df-if 4484  df-sn 4586  df-pr 4588  df-op 4592  df-br 5106  df-opab 5168  df-id 5547  df-xp 5658  df-rel 5659  df-cnv 5660  df-co 5661  df-fun 6527
This theorem is referenced by:  funsng  6576  funcnvpr  6587  funcnvtp  6588  funcnvs1  14939  0spth  30386  funen1cnv  35392
  Copyright terms: Public domain W3C validator