Theorem funcnvsn 6612

Description: The converse singleton of an ordered pair is a function. This is equivalent to funsn 6615 via cnvsn 6240, 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.

Step	Hyp	Ref	Expression
1		relcnv 6112	. 2 ⊢ Rel ◡{⟨𝐴, 𝐵⟩}
2		moeq 3668	. . . 4 ⊢ ∃*𝑦 𝑦 = 𝐴
3		vex 3458	. . . . . . . 8 ⊢ 𝑥 ∈ V
4		vex 3458	. . . . . . . 8 ⊢ 𝑦 ∈ V
5	3, 4	brcnv 5867	. . . . . . 7 ⊢ (𝑥◡{⟨𝐴, 𝐵⟩}𝑦 ↔ 𝑦{⟨𝐴, 𝐵⟩}𝑥)
6		df-br 5107	. . . . . . 7 ⊢ (𝑦{⟨𝐴, 𝐵⟩}𝑥 ↔ ⟨𝑦, 𝑥⟩ ∈ {⟨𝐴, 𝐵⟩})
7	5, 6	bitri 278	. . . . . 6 ⊢ (𝑥◡{⟨𝐴, 𝐵⟩}𝑦 ↔ ⟨𝑦, 𝑥⟩ ∈ {⟨𝐴, 𝐵⟩})
8		elsni 4601	. . . . . . 7 ⊢ (⟨𝑦, 𝑥⟩ ∈ {⟨𝐴, 𝐵⟩} → ⟨𝑦, 𝑥⟩ = ⟨𝐴, 𝐵⟩)
9	4, 3	opth1 5448	. . . . . . 7 ⊢ (⟨𝑦, 𝑥⟩ = ⟨𝐴, 𝐵⟩ → 𝑦 = 𝐴)
10	8, 9	syl 18	. . . . . 6 ⊢ (⟨𝑦, 𝑥⟩ ∈ {⟨𝐴, 𝐵⟩} → 𝑦 = 𝐴)
11	7, 10	sylbi 220	. . . . 5 ⊢ (𝑥◡{⟨𝐴, 𝐵⟩}𝑦 → 𝑦 = 𝐴)
12	11	moimi 2573	. . . 4 ⊢ (∃*𝑦 𝑦 = 𝐴 → ∃*𝑦 𝑥◡{⟨𝐴, 𝐵⟩}𝑦)
13	2, 12	ax-mp 5	. . 3 ⊢ ∃*𝑦 𝑥◡{⟨𝐴, 𝐵⟩}𝑦
14	13	ax-gen 1828	. 2 ⊢ ∀𝑥∃*𝑦 𝑥◡{⟨𝐴, 𝐵⟩}𝑦
15		dffun6 6569	. 2 ⊢ (Fun ◡{⟨𝐴, 𝐵⟩} ↔ (Rel ◡{⟨𝐴, 𝐵⟩} ∧ ∀𝑥∃*𝑦 𝑥◡{⟨𝐴, 𝐵⟩}𝑦))
16	1, 14, 15	mpbir2an 724	1 ⊢ Fun ◡{⟨𝐴, 𝐵⟩}

This proof depends on syntax axioms:  ∀wal 1568   = wceq 1570   ∈ wcel 2147  ∃*wmo 2565  {csn 4588  ⟨cop 4838   class class class wbr 5106  ^◡ccnv 5654  Rel wrel 5660  Fun wfun 6552

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735  ax-sep 5252  ax-pr 5395

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2102  df-mo 2567  df-clab 2742  df-cleq 2755  df-clel 2839  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-br 5107  df-opab 5171  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-fun 6560

This theorem is used by:  funsng  6613  funcnvpr  6624  funcnvtp  6625  funen1cnv  9084  funcnvs1  15092  0spth  30747