Theorem funinsn 5261

Description: A function based on the singleton of an ordered pair. Unlike funsng 5258, this holds even if 𝐴 or 𝐵 is a proper class. (Contributed by Jim Kingdon, 17-Apr-2022.)

Assertion

Ref	Expression
funinsn	⊢ Fun ({⟨𝐴, 𝐵⟩} ∩ (𝑉 × 𝑊))

Proof of Theorem funinsn

Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		inss2 3356	. . . 4 ⊢ ({⟨𝐴, 𝐵⟩} ∩ (𝑉 × 𝑊)) ⊆ (𝑉 × 𝑊)
2		xpss 4731	. . . 4 ⊢ (𝑉 × 𝑊) ⊆ (V × V)
3	1, 2	sstri 3164	. . 3 ⊢ ({⟨𝐴, 𝐵⟩} ∩ (𝑉 × 𝑊)) ⊆ (V × V)
4		df-rel 4630	. . 3 ⊢ (Rel ({⟨𝐴, 𝐵⟩} ∩ (𝑉 × 𝑊)) ↔ ({⟨𝐴, 𝐵⟩} ∩ (𝑉 × 𝑊)) ⊆ (V × V))
5	3, 4	mpbir 146	. 2 ⊢ Rel ({⟨𝐴, 𝐵⟩} ∩ (𝑉 × 𝑊))
6		elin 3318	. . . . . . . . 9 ⊢ (⟨𝑥, 𝑦⟩ ∈ ({⟨𝐴, 𝐵⟩} ∩ (𝑉 × 𝑊)) ↔ (⟨𝑥, 𝑦⟩ ∈ {⟨𝐴, 𝐵⟩} ∧ ⟨𝑥, 𝑦⟩ ∈ (𝑉 × 𝑊)))
7	6	simplbi 274	. . . . . . . 8 ⊢ (⟨𝑥, 𝑦⟩ ∈ ({⟨𝐴, 𝐵⟩} ∩ (𝑉 × 𝑊)) → ⟨𝑥, 𝑦⟩ ∈ {⟨𝐴, 𝐵⟩})
8		elsni 3609	. . . . . . . 8 ⊢ (⟨𝑥, 𝑦⟩ ∈ {⟨𝐴, 𝐵⟩} → ⟨𝑥, 𝑦⟩ = ⟨𝐴, 𝐵⟩)
9	7, 8	syl 14	. . . . . . 7 ⊢ (⟨𝑥, 𝑦⟩ ∈ ({⟨𝐴, 𝐵⟩} ∩ (𝑉 × 𝑊)) → ⟨𝑥, 𝑦⟩ = ⟨𝐴, 𝐵⟩)
10		vex 2740	. . . . . . . 8 ⊢ 𝑥 ∈ V
11		vex 2740	. . . . . . . 8 ⊢ 𝑦 ∈ V
12	10, 11	opth 4234	. . . . . . 7 ⊢ (⟨𝑥, 𝑦⟩ = ⟨𝐴, 𝐵⟩ ↔ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵))
13	9, 12	sylib 122	. . . . . 6 ⊢ (⟨𝑥, 𝑦⟩ ∈ ({⟨𝐴, 𝐵⟩} ∩ (𝑉 × 𝑊)) → (𝑥 = 𝐴 ∧ 𝑦 = 𝐵))
14	13	simprd 114	. . . . 5 ⊢ (⟨𝑥, 𝑦⟩ ∈ ({⟨𝐴, 𝐵⟩} ∩ (𝑉 × 𝑊)) → 𝑦 = 𝐵)
15		elin 3318	. . . . . . . . 9 ⊢ (⟨𝑥, 𝑧⟩ ∈ ({⟨𝐴, 𝐵⟩} ∩ (𝑉 × 𝑊)) ↔ (⟨𝑥, 𝑧⟩ ∈ {⟨𝐴, 𝐵⟩} ∧ ⟨𝑥, 𝑧⟩ ∈ (𝑉 × 𝑊)))
16	15	simplbi 274	. . . . . . . 8 ⊢ (⟨𝑥, 𝑧⟩ ∈ ({⟨𝐴, 𝐵⟩} ∩ (𝑉 × 𝑊)) → ⟨𝑥, 𝑧⟩ ∈ {⟨𝐴, 𝐵⟩})
17		elsni 3609	. . . . . . . 8 ⊢ (⟨𝑥, 𝑧⟩ ∈ {⟨𝐴, 𝐵⟩} → ⟨𝑥, 𝑧⟩ = ⟨𝐴, 𝐵⟩)
18	16, 17	syl 14	. . . . . . 7 ⊢ (⟨𝑥, 𝑧⟩ ∈ ({⟨𝐴, 𝐵⟩} ∩ (𝑉 × 𝑊)) → ⟨𝑥, 𝑧⟩ = ⟨𝐴, 𝐵⟩)
19		vex 2740	. . . . . . . 8 ⊢ 𝑧 ∈ V
20	10, 19	opth 4234	. . . . . . 7 ⊢ (⟨𝑥, 𝑧⟩ = ⟨𝐴, 𝐵⟩ ↔ (𝑥 = 𝐴 ∧ 𝑧 = 𝐵))
21	18, 20	sylib 122	. . . . . 6 ⊢ (⟨𝑥, 𝑧⟩ ∈ ({⟨𝐴, 𝐵⟩} ∩ (𝑉 × 𝑊)) → (𝑥 = 𝐴 ∧ 𝑧 = 𝐵))
22	21	simprd 114	. . . . 5 ⊢ (⟨𝑥, 𝑧⟩ ∈ ({⟨𝐴, 𝐵⟩} ∩ (𝑉 × 𝑊)) → 𝑧 = 𝐵)
23		eqtr3 2197	. . . . 5 ⊢ ((𝑦 = 𝐵 ∧ 𝑧 = 𝐵) → 𝑦 = 𝑧)
24	14, 22, 23	syl2an 289	. . . 4 ⊢ ((⟨𝑥, 𝑦⟩ ∈ ({⟨𝐴, 𝐵⟩} ∩ (𝑉 × 𝑊)) ∧ ⟨𝑥, 𝑧⟩ ∈ ({⟨𝐴, 𝐵⟩} ∩ (𝑉 × 𝑊))) → 𝑦 = 𝑧)
25	24	gen2 1450	. . 3 ⊢ ∀𝑦∀𝑧((⟨𝑥, 𝑦⟩ ∈ ({⟨𝐴, 𝐵⟩} ∩ (𝑉 × 𝑊)) ∧ ⟨𝑥, 𝑧⟩ ∈ ({⟨𝐴, 𝐵⟩} ∩ (𝑉 × 𝑊))) → 𝑦 = 𝑧)
26	25	ax-gen 1449	. 2 ⊢ ∀𝑥∀𝑦∀𝑧((⟨𝑥, 𝑦⟩ ∈ ({⟨𝐴, 𝐵⟩} ∩ (𝑉 × 𝑊)) ∧ ⟨𝑥, 𝑧⟩ ∈ ({⟨𝐴, 𝐵⟩} ∩ (𝑉 × 𝑊))) → 𝑦 = 𝑧)
27		dffun4 5223	. 2 ⊢ (Fun ({⟨𝐴, 𝐵⟩} ∩ (𝑉 × 𝑊)) ↔ (Rel ({⟨𝐴, 𝐵⟩} ∩ (𝑉 × 𝑊)) ∧ ∀𝑥∀𝑦∀𝑧((⟨𝑥, 𝑦⟩ ∈ ({⟨𝐴, 𝐵⟩} ∩ (𝑉 × 𝑊)) ∧ ⟨𝑥, 𝑧⟩ ∈ ({⟨𝐴, 𝐵⟩} ∩ (𝑉 × 𝑊))) → 𝑦 = 𝑧)))
28	5, 26, 27	mpbir2an 942	1 ⊢ Fun ({⟨𝐴, 𝐵⟩} ∩ (𝑉 × 𝑊))

Syntax hints:   → wi 4   ∧ wa 104  ∀wal 1351   = wceq 1353   ∈ wcel 2148  Vcvv 2737   ∩ cin 3128   ⊆ wss 3129  {csn 3591  ⟨cop 3594   × cxp 4621  Rel wrel 4628  Fun wfun 5206

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-14 2151  ax-ext 2159  ax-sep 4118  ax-pow 4171  ax-pr 4206

This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ral 2460  df-v 2739  df-un 3133  df-in 3135  df-ss 3142  df-pw 3576  df-sn 3597  df-pr 3598  df-op 3600  df-br 4001  df-opab 4062  df-id 4290  df-xp 4629  df-rel 4630  df-cnv 4631  df-co 4632  df-fun 5214

This theorem is referenced by: (None)