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

Theorem funcnvsn 6590
Description: The converse singleton of an ordered pair is a function. This is equivalent to funsn 6593 via cnvsn 6227, 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 6099 . 2 Rel ◡{⟨𝐴, 𝐵⟩}
2 moeq 3664 . . . 4 ∃*𝑦 𝑦 = 𝐴
3 vex 3454 . . . . . . . 8 𝑥 ∈ V
4 vex 3454 . . . . . . . 8 𝑦 ∈ V
53, 4brcnv 5859 . . . . . . 7 (𝑥◡{⟨𝐴, 𝐵⟩}𝑦 ↔ 𝑦{⟨𝐴, 𝐵⟩}𝑥)
6 df-br 5103 . . . . . . 7 (𝑦{⟨𝐴, 𝐵⟩}𝑥 ↔ ⟨𝑦, 𝑥⟩ ∈ {⟨𝐴, 𝐵⟩})
75, 6bitri 278 . . . . . 6 (𝑥◡{⟨𝐴, 𝐵⟩}𝑦 ↔ ⟨𝑦, 𝑥⟩ ∈ {⟨𝐴, 𝐵⟩})
8 elsni 4600 . . . . . . 7 (⟨𝑦, 𝑥⟩ ∈ {⟨𝐴, 𝐵⟩} → ⟨𝑦, 𝑥⟩ = ⟨𝐴, 𝐵⟩)
94, 3opth1 5443 . . . . . . 7 (⟨𝑦, 𝑥⟩ = ⟨𝐴, 𝐵⟩ → 𝑦 = 𝐴)
108, 9syl 18 . . . . . 6 (⟨𝑦, 𝑥⟩ ∈ {⟨𝐴, 𝐵⟩} → 𝑦 = 𝐴)
117, 10sylbi 220 . . . . 5 (𝑥◡{⟨𝐴, 𝐵⟩}𝑦 → 𝑦 = 𝐴)
1211moimi 2570 . . . 4 (∃*𝑦 𝑦 = 𝐴 → ∃*𝑦 𝑥◡{⟨𝐴, 𝐵⟩}𝑦)
132, 12ax-mp 5 . . 3 ∃*𝑦 𝑥◡{⟨𝐴, 𝐵⟩}𝑦
1413ax-gen 1827 . 2 ∀𝑥∃*𝑦 𝑥◡{⟨𝐴, 𝐵⟩}𝑦
15 dffun6 6549 . 2 (Fun ◡{⟨𝐴, 𝐵⟩} ↔ (Rel ◡{⟨𝐴, 𝐵⟩} ∧ ∀𝑥∃*𝑦 𝑥◡{⟨𝐴, 𝐵⟩}𝑦))
161, 14, 15mpbir2an 724 1 Fun ◡{⟨𝐴, 𝐵⟩}
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ∀wal 1567   = wceq 1569   ∈ wcel 2144  ∃*wmo 2562  {csn 4583  ⟨cop 4589   class class class wbr 5102  ◡ccnv 5649  Rel wrel 5655  Fun wfun 6532
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732  ax-sep 5248  ax-pr 5390
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2099  df-mo 2564  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4584  df-pr 4586  df-op 4590  df-br 5103  df-opab 5167  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-fun 6540
This theorem is used by:  funsng  6591  funcnvpr  6602  funcnvtp  6603  funen1cnv  9057  funcnvs1  15064  0spth  30718
  Copyright terms: Public domain W3C validator