Theorem funcnvsn 5176

Description: The converse singleton of an ordered pair is a function. This is equivalent to funsn 5179 via cnvsn 5029, but stating it this way allows us 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 4925	. 2 ⊢ Rel ◡{⟨𝐴, 𝐵⟩}
2		moeq 2863	. . . 4 ⊢ ∃*𝑦 𝑦 = 𝐴
3		vex 2692	. . . . . . . 8 ⊢ 𝑥 ∈ V
4		vex 2692	. . . . . . . 8 ⊢ 𝑦 ∈ V
5	3, 4	brcnv 4730	. . . . . . 7 ⊢ (𝑥◡{⟨𝐴, 𝐵⟩}𝑦 ↔ 𝑦{⟨𝐴, 𝐵⟩}𝑥)
6		df-br 3938	. . . . . . 7 ⊢ (𝑦{⟨𝐴, 𝐵⟩}𝑥 ↔ ⟨𝑦, 𝑥⟩ ∈ {⟨𝐴, 𝐵⟩})
7	5, 6	bitri 183	. . . . . 6 ⊢ (𝑥◡{⟨𝐴, 𝐵⟩}𝑦 ↔ ⟨𝑦, 𝑥⟩ ∈ {⟨𝐴, 𝐵⟩})
8		elsni 3550	. . . . . . 7 ⊢ (⟨𝑦, 𝑥⟩ ∈ {⟨𝐴, 𝐵⟩} → ⟨𝑦, 𝑥⟩ = ⟨𝐴, 𝐵⟩)
9	4, 3	opth1 4166	. . . . . . 7 ⊢ (⟨𝑦, 𝑥⟩ = ⟨𝐴, 𝐵⟩ → 𝑦 = 𝐴)
10	8, 9	syl 14	. . . . . 6 ⊢ (⟨𝑦, 𝑥⟩ ∈ {⟨𝐴, 𝐵⟩} → 𝑦 = 𝐴)
11	7, 10	sylbi 120	. . . . 5 ⊢ (𝑥◡{⟨𝐴, 𝐵⟩}𝑦 → 𝑦 = 𝐴)
12	11	moimi 2065	. . . 4 ⊢ (∃*𝑦 𝑦 = 𝐴 → ∃*𝑦 𝑥◡{⟨𝐴, 𝐵⟩}𝑦)
13	2, 12	ax-mp 5	. . 3 ⊢ ∃*𝑦 𝑥◡{⟨𝐴, 𝐵⟩}𝑦
14	13	ax-gen 1426	. 2 ⊢ ∀𝑥∃*𝑦 𝑥◡{⟨𝐴, 𝐵⟩}𝑦
15		dffun6 5145	. 2 ⊢ (Fun ◡{⟨𝐴, 𝐵⟩} ↔ (Rel ◡{⟨𝐴, 𝐵⟩} ∧ ∀𝑥∃*𝑦 𝑥◡{⟨𝐴, 𝐵⟩}𝑦))
16	1, 14, 15	mpbir2an 927	1 ⊢ Fun ◡{⟨𝐴, 𝐵⟩}

Syntax hints:  ∀wal 1330   = wceq 1332   ∈ wcel 1481  ∃*wmo 2001  {csn 3532  ⟨cop 3535   class class class wbr 3937  ^◡ccnv 4546  Rel wrel 4552  Fun wfun 5125

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 699  ax-5 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-10 1484  ax-11 1485  ax-i12 1486  ax-bndl 1487  ax-4 1488  ax-14 1493  ax-17 1507  ax-i9 1511  ax-ial 1515  ax-i5r 1516  ax-ext 2122  ax-sep 4054  ax-pow 4106  ax-pr 4139

This theorem depends on definitions:  df-bi 116  df-3an 965  df-tru 1335  df-nf 1438  df-sb 1737  df-eu 2003  df-mo 2004  df-clab 2127  df-cleq 2133  df-clel 2136  df-nfc 2271  df-ral 2422  df-rex 2423  df-v 2691  df-un 3080  df-in 3082  df-ss 3089  df-pw 3517  df-sn 3538  df-pr 3539  df-op 3541  df-br 3938  df-opab 3998  df-id 4223  df-xp 4553  df-rel 4554  df-cnv 4555  df-co 4556  df-fun 5133

This theorem is referenced by:  funsng  5177