Theorem elixpsn 8996

Description: Membership in a class of singleton functions. (Contributed by Stefan O'Rear, 24-Jan-2015.)

Assertion

Ref	Expression
elixpsn	⊢ (𝐴 ∈ 𝑉 → (𝐹 ∈ X𝑥 ∈ {𝐴}𝐵 ↔ ∃𝑦 ∈ 𝐵 𝐹 = {⟨𝐴, 𝑦⟩}))

Distinct variable groups:   𝑥,𝐵,𝑦   𝑥,𝐹,𝑦   𝑥,𝐴,𝑦   𝑥,𝑉,𝑦

Proof of Theorem elixpsn

Dummy variables 𝑧 𝑤 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		sneq 4594	. . . 4 ⊢ (𝑧 = 𝐴 → {𝑧} = {𝐴})
2	1	ixpeq1d 8968	. . 3 ⊢ (𝑧 = 𝐴 → X𝑥 ∈ {𝑧}𝐵 = X𝑥 ∈ {𝐴}𝐵)
3	2	eleq2d 2850	. 2 ⊢ (𝑧 = 𝐴 → (𝐹 ∈ X𝑥 ∈ {𝑧}𝐵 ↔ 𝐹 ∈ X𝑥 ∈ {𝐴}𝐵))
4		opeq1 4843	. . . . 5 ⊢ (𝑧 = 𝐴 → ⟨𝑧, 𝑦⟩ = ⟨𝐴, 𝑦⟩)
5	4	sneqd 4596	. . . 4 ⊢ (𝑧 = 𝐴 → {⟨𝑧, 𝑦⟩} = {⟨𝐴, 𝑦⟩})
6	5	eqeq2d 2774	. . 3 ⊢ (𝑧 = 𝐴 → (𝐹 = {⟨𝑧, 𝑦⟩} ↔ 𝐹 = {⟨𝐴, 𝑦⟩}))
7	6	rexbidv 3190	. 2 ⊢ (𝑧 = 𝐴 → (∃𝑦 ∈ 𝐵 𝐹 = {⟨𝑧, 𝑦⟩} ↔ ∃𝑦 ∈ 𝐵 𝐹 = {⟨𝐴, 𝑦⟩}))
8		elex 3475	. . 3 ⊢ (𝐹 ∈ X𝑥 ∈ {𝑧}𝐵 → 𝐹 ∈ V)
9		snex 5402	. . . . 5 ⊢ {⟨𝑧, 𝑦⟩} ∈ V
10		eleq1 2852	. . . . 5 ⊢ (𝐹 = {⟨𝑧, 𝑦⟩} → (𝐹 ∈ V ↔ {⟨𝑧, 𝑦⟩} ∈ V))
11	9, 10	mpbiri 261	. . . 4 ⊢ (𝐹 = {⟨𝑧, 𝑦⟩} → 𝐹 ∈ V)
12	11	rexlimivw 3163	. . 3 ⊢ (∃𝑦 ∈ 𝐵 𝐹 = {⟨𝑧, 𝑦⟩} → 𝐹 ∈ V)
13		eleq1 2852	. . . 4 ⊢ (𝑤 = 𝐹 → (𝑤 ∈ X𝑥 ∈ {𝑧}𝐵 ↔ 𝐹 ∈ X𝑥 ∈ {𝑧}𝐵))
14		eqeq1 2767	. . . . 5 ⊢ (𝑤 = 𝐹 → (𝑤 = {⟨𝑧, 𝑦⟩} ↔ 𝐹 = {⟨𝑧, 𝑦⟩}))
15	14	rexbidv 3190	. . . 4 ⊢ (𝑤 = 𝐹 → (∃𝑦 ∈ 𝐵 𝑤 = {⟨𝑧, 𝑦⟩} ↔ ∃𝑦 ∈ 𝐵 𝐹 = {⟨𝑧, 𝑦⟩}))
16		vex 3458	. . . . . 6 ⊢ 𝑤 ∈ V
17	16	elixp 8963	. . . . 5 ⊢ (𝑤 ∈ X𝑥 ∈ {𝑧}𝐵 ↔ (𝑤 Fn {𝑧} ∧ ∀𝑥 ∈ {𝑧} (𝑤‘𝑥) ∈ 𝐵))
18		vex 3458	. . . . . . 7 ⊢ 𝑧 ∈ V
19		fveq2 6911	. . . . . . . 8 ⊢ (𝑥 = 𝑧 → (𝑤‘𝑥) = (𝑤‘𝑧))
20	19	eleq1d 2849	. . . . . . 7 ⊢ (𝑥 = 𝑧 → ((𝑤‘𝑥) ∈ 𝐵 ↔ (𝑤‘𝑧) ∈ 𝐵))
21	18, 20	ralsn 4642	. . . . . 6 ⊢ (∀𝑥 ∈ {𝑧} (𝑤‘𝑥) ∈ 𝐵 ↔ (𝑤‘𝑧) ∈ 𝐵)
22	21	anbi2i 635	. . . . 5 ⊢ ((𝑤 Fn {𝑧} ∧ ∀𝑥 ∈ {𝑧} (𝑤‘𝑥) ∈ 𝐵) ↔ (𝑤 Fn {𝑧} ∧ (𝑤‘𝑧) ∈ 𝐵))
23		simpl 488	. . . . . . . . 9 ⊢ ((𝑤 Fn {𝑧} ∧ (𝑤‘𝑧) ∈ 𝐵) → 𝑤 Fn {𝑧})
24		fveq2 6911	. . . . . . . . . . . 12 ⊢ (𝑦 = 𝑧 → (𝑤‘𝑦) = (𝑤‘𝑧))
25	24	eleq1d 2849	. . . . . . . . . . 11 ⊢ (𝑦 = 𝑧 → ((𝑤‘𝑦) ∈ 𝐵 ↔ (𝑤‘𝑧) ∈ 𝐵))
26	18, 25	ralsn 4642	. . . . . . . . . 10 ⊢ (∀𝑦 ∈ {𝑧} (𝑤‘𝑦) ∈ 𝐵 ↔ (𝑤‘𝑧) ∈ 𝐵)
27	26	bilanri 512	. . . . . . . . 9 ⊢ ((𝑤 Fn {𝑧} ∧ (𝑤‘𝑧) ∈ 𝐵) → ∀𝑦 ∈ {𝑧} (𝑤‘𝑦) ∈ 𝐵)
28		ffnfv 7146	. . . . . . . . 9 ⊢ (𝑤:{𝑧}⟶𝐵 ↔ (𝑤 Fn {𝑧} ∧ ∀𝑦 ∈ {𝑧} (𝑤‘𝑦) ∈ 𝐵))
29	23, 27, 28	sylanbrc 595	. . . . . . . 8 ⊢ ((𝑤 Fn {𝑧} ∧ (𝑤‘𝑧) ∈ 𝐵) → 𝑤:{𝑧}⟶𝐵)
30	18	fsn2 7164	. . . . . . . 8 ⊢ (𝑤:{𝑧}⟶𝐵 ↔ ((𝑤‘𝑧) ∈ 𝐵 ∧ 𝑤 = {⟨𝑧, (𝑤‘𝑧)⟩}))
31	29, 30	sylib 221	. . . . . . 7 ⊢ ((𝑤 Fn {𝑧} ∧ (𝑤‘𝑧) ∈ 𝐵) → ((𝑤‘𝑧) ∈ 𝐵 ∧ 𝑤 = {⟨𝑧, (𝑤‘𝑧)⟩}))
32		opeq2 4844	. . . . . . . . 9 ⊢ (𝑦 = (𝑤‘𝑧) → ⟨𝑧, 𝑦⟩ = ⟨𝑧, (𝑤‘𝑧)⟩)
33	32	sneqd 4596	. . . . . . . 8 ⊢ (𝑦 = (𝑤‘𝑧) → {⟨𝑧, 𝑦⟩} = {⟨𝑧, (𝑤‘𝑧)⟩})
34	33	rspceeqv 3602	. . . . . . 7 ⊢ (((𝑤‘𝑧) ∈ 𝐵 ∧ 𝑤 = {⟨𝑧, (𝑤‘𝑧)⟩}) → ∃𝑦 ∈ 𝐵 𝑤 = {⟨𝑧, 𝑦⟩})
35	31, 34	syl 18	. . . . . 6 ⊢ ((𝑤 Fn {𝑧} ∧ (𝑤‘𝑧) ∈ 𝐵) → ∃𝑦 ∈ 𝐵 𝑤 = {⟨𝑧, 𝑦⟩})
36		vex 3458	. . . . . . . . . . 11 ⊢ 𝑦 ∈ V
37	18, 36	fvsn 7212	. . . . . . . . . 10 ⊢ ({⟨𝑧, 𝑦⟩}‘𝑧) = 𝑦
38		id 23	. . . . . . . . . 10 ⊢ (𝑦 ∈ 𝐵 → 𝑦 ∈ 𝐵)
39	37, 38	eqeltrid 2868	. . . . . . . . 9 ⊢ (𝑦 ∈ 𝐵 → ({⟨𝑧, 𝑦⟩}‘𝑧) ∈ 𝐵)
40	18, 36	fnsn 6623	. . . . . . . . 9 ⊢ {⟨𝑧, 𝑦⟩} Fn {𝑧}
41	39, 40	jctil 529	. . . . . . . 8 ⊢ (𝑦 ∈ 𝐵 → ({⟨𝑧, 𝑦⟩} Fn {𝑧} ∧ ({⟨𝑧, 𝑦⟩}‘𝑧) ∈ 𝐵))
42		fneq1 6655	. . . . . . . . 9 ⊢ (𝑤 = {⟨𝑧, 𝑦⟩} → (𝑤 Fn {𝑧} ↔ {⟨𝑧, 𝑦⟩} Fn {𝑧}))
43		fveq1 6910	. . . . . . . . . 10 ⊢ (𝑤 = {⟨𝑧, 𝑦⟩} → (𝑤‘𝑧) = ({⟨𝑧, 𝑦⟩}‘𝑧))
44	43	eleq1d 2849	. . . . . . . . 9 ⊢ (𝑤 = {⟨𝑧, 𝑦⟩} → ((𝑤‘𝑧) ∈ 𝐵 ↔ ({⟨𝑧, 𝑦⟩}‘𝑧) ∈ 𝐵))
45	42, 44	anbi12d 644	. . . . . . . 8 ⊢ (𝑤 = {⟨𝑧, 𝑦⟩} → ((𝑤 Fn {𝑧} ∧ (𝑤‘𝑧) ∈ 𝐵) ↔ ({⟨𝑧, 𝑦⟩} Fn {𝑧} ∧ ({⟨𝑧, 𝑦⟩}‘𝑧) ∈ 𝐵)))
46	41, 45	syl5ibrcom 250	. . . . . . 7 ⊢ (𝑦 ∈ 𝐵 → (𝑤 = {⟨𝑧, 𝑦⟩} → (𝑤 Fn {𝑧} ∧ (𝑤‘𝑧) ∈ 𝐵)))
47	46	rexlimiv 3160	. . . . . 6 ⊢ (∃𝑦 ∈ 𝐵 𝑤 = {⟨𝑧, 𝑦⟩} → (𝑤 Fn {𝑧} ∧ (𝑤‘𝑧) ∈ 𝐵))
48	35, 47	impbii 212	. . . . 5 ⊢ ((𝑤 Fn {𝑧} ∧ (𝑤‘𝑧) ∈ 𝐵) ↔ ∃𝑦 ∈ 𝐵 𝑤 = {⟨𝑧, 𝑦⟩})
49	17, 22, 48	3bitri 300	. . . 4 ⊢ (𝑤 ∈ X𝑥 ∈ {𝑧}𝐵 ↔ ∃𝑦 ∈ 𝐵 𝑤 = {⟨𝑧, 𝑦⟩})
50	13, 15, 49	vtoclbg 3523	. . 3 ⊢ (𝐹 ∈ V → (𝐹 ∈ X𝑥 ∈ {𝑧}𝐵 ↔ ∃𝑦 ∈ 𝐵 𝐹 = {⟨𝑧, 𝑦⟩}))
51	8, 12, 50	pm5.21nii 381	. 2 ⊢ (𝐹 ∈ X𝑥 ∈ {𝑧}𝐵 ↔ ∃𝑦 ∈ 𝐵 𝐹 = {⟨𝑧, 𝑦⟩})
52	3, 7, 51	vtoclbg 3523	1 ⊢ (𝐴 ∈ 𝑉 → (𝐹 ∈ X𝑥 ∈ {𝐴}𝐵 ↔ ∃𝑦 ∈ 𝐵 𝐹 = {⟨𝐴, 𝑦⟩}))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∀wral 3080  ∃wrex 3090  Vcvv 3454  {csn 4588  ⟨cop 4838   Fn wfn 6556  ⟶wf 6557  ‘cfv 6561  Xcixp 8956

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-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5253  ax-nul 5264  ax-pr 5396

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-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  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-uni 4871  df-br 5107  df-opab 5172  df-mpt 5191  df-id 5551  df-xp 5662  df-rel 5663  df-cnv 5664  df-co 5665  df-dm 5666  df-rn 5667  df-res 5668  df-ima 5669  df-iota 6515  df-fun 6563  df-fn 6564  df-f 6565  df-f1 6566  df-fo 6567  df-f1o 6568  df-fv 6569  df-ixp 8957

This theorem is used by:  ixpsnf1o  8997  hoidmv1le  47819