Theorem funpartlem 35906

Description: Lemma for funpartfun 35907. Show membership in the restriction. (Contributed by Scott Fenton, 4-Dec-2017.)

Assertion

Ref	Expression
funpartlem	⊢ (𝐴 ∈ dom ((Image𝐹 ∘ Singleton) ∩ (V × Singletons )) ↔ ∃𝑥(𝐹 “ {𝐴}) = {𝑥})

Distinct variable groups:   𝑥,𝐴   𝑥,𝐹

Proof of Theorem funpartlem

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

Step	Hyp	Ref	Expression
1		elex 3509	. 2 ⊢ (𝐴 ∈ dom ((Image𝐹 ∘ Singleton) ∩ (V × Singletons )) → 𝐴 ∈ V)
2		vsnid 4685	. . . . 5 ⊢ 𝑥 ∈ {𝑥}
3		eleq2 2833	. . . . 5 ⊢ ((𝐹 “ {𝐴}) = {𝑥} → (𝑥 ∈ (𝐹 “ {𝐴}) ↔ 𝑥 ∈ {𝑥}))
4	2, 3	mpbiri 258	. . . 4 ⊢ ((𝐹 “ {𝐴}) = {𝑥} → 𝑥 ∈ (𝐹 “ {𝐴}))
5		n0i 4363	. . . . 5 ⊢ (𝑥 ∈ (𝐹 “ {𝐴}) → ¬ (𝐹 “ {𝐴}) = ∅)
6		snprc 4742	. . . . . . . 8 ⊢ (¬ 𝐴 ∈ V ↔ {𝐴} = ∅)
7	6	biimpi 216	. . . . . . 7 ⊢ (¬ 𝐴 ∈ V → {𝐴} = ∅)
8	7	imaeq2d 6089	. . . . . 6 ⊢ (¬ 𝐴 ∈ V → (𝐹 “ {𝐴}) = (𝐹 “ ∅))
9		ima0 6106	. . . . . 6 ⊢ (𝐹 “ ∅) = ∅
10	8, 9	eqtrdi 2796	. . . . 5 ⊢ (¬ 𝐴 ∈ V → (𝐹 “ {𝐴}) = ∅)
11	5, 10	nsyl2 141	. . . 4 ⊢ (𝑥 ∈ (𝐹 “ {𝐴}) → 𝐴 ∈ V)
12	4, 11	syl 17	. . 3 ⊢ ((𝐹 “ {𝐴}) = {𝑥} → 𝐴 ∈ V)
13	12	exlimiv 1929	. 2 ⊢ (∃𝑥(𝐹 “ {𝐴}) = {𝑥} → 𝐴 ∈ V)
14		eleq1 2832	. . 3 ⊢ (𝑦 = 𝐴 → (𝑦 ∈ dom ((Image𝐹 ∘ Singleton) ∩ (V × Singletons )) ↔ 𝐴 ∈ dom ((Image𝐹 ∘ Singleton) ∩ (V × Singletons ))))
15		sneq 4658	. . . . . 6 ⊢ (𝑦 = 𝐴 → {𝑦} = {𝐴})
16	15	imaeq2d 6089	. . . . 5 ⊢ (𝑦 = 𝐴 → (𝐹 “ {𝑦}) = (𝐹 “ {𝐴}))
17	16	eqeq1d 2742	. . . 4 ⊢ (𝑦 = 𝐴 → ((𝐹 “ {𝑦}) = {𝑥} ↔ (𝐹 “ {𝐴}) = {𝑥}))
18	17	exbidv 1920	. . 3 ⊢ (𝑦 = 𝐴 → (∃𝑥(𝐹 “ {𝑦}) = {𝑥} ↔ ∃𝑥(𝐹 “ {𝐴}) = {𝑥}))
19		vex 3492	. . . . 5 ⊢ 𝑦 ∈ V
20	19	eldm 5925	. . . 4 ⊢ (𝑦 ∈ dom ((Image𝐹 ∘ Singleton) ∩ (V × Singletons )) ↔ ∃𝑧 𝑦((Image𝐹 ∘ Singleton) ∩ (V × Singletons ))𝑧)
21		brxp 5749	. . . . . . . . . 10 ⊢ (𝑦(V × Singletons )𝑧 ↔ (𝑦 ∈ V ∧ 𝑧 ∈ Singletons ))
22	19, 21	mpbiran 708	. . . . . . . . 9 ⊢ (𝑦(V × Singletons )𝑧 ↔ 𝑧 ∈ Singletons )
23		elsingles 35882	. . . . . . . . 9 ⊢ (𝑧 ∈ Singletons ↔ ∃𝑥 𝑧 = {𝑥})
24	22, 23	bitri 275	. . . . . . . 8 ⊢ (𝑦(V × Singletons )𝑧 ↔ ∃𝑥 𝑧 = {𝑥})
25	24	anbi2i 622	. . . . . . 7 ⊢ ((𝑦(Image𝐹 ∘ Singleton)𝑧 ∧ 𝑦(V × Singletons )𝑧) ↔ (𝑦(Image𝐹 ∘ Singleton)𝑧 ∧ ∃𝑥 𝑧 = {𝑥}))
26		brin 5218	. . . . . . 7 ⊢ (𝑦((Image𝐹 ∘ Singleton) ∩ (V × Singletons ))𝑧 ↔ (𝑦(Image𝐹 ∘ Singleton)𝑧 ∧ 𝑦(V × Singletons )𝑧))
27		19.42v 1953	. . . . . . 7 ⊢ (∃𝑥(𝑦(Image𝐹 ∘ Singleton)𝑧 ∧ 𝑧 = {𝑥}) ↔ (𝑦(Image𝐹 ∘ Singleton)𝑧 ∧ ∃𝑥 𝑧 = {𝑥}))
28	25, 26, 27	3bitr4i 303	. . . . . 6 ⊢ (𝑦((Image𝐹 ∘ Singleton) ∩ (V × Singletons ))𝑧 ↔ ∃𝑥(𝑦(Image𝐹 ∘ Singleton)𝑧 ∧ 𝑧 = {𝑥}))
29	28	exbii 1846	. . . . 5 ⊢ (∃𝑧 𝑦((Image𝐹 ∘ Singleton) ∩ (V × Singletons ))𝑧 ↔ ∃𝑧∃𝑥(𝑦(Image𝐹 ∘ Singleton)𝑧 ∧ 𝑧 = {𝑥}))
30		excom 2163	. . . . 5 ⊢ (∃𝑧∃𝑥(𝑦(Image𝐹 ∘ Singleton)𝑧 ∧ 𝑧 = {𝑥}) ↔ ∃𝑥∃𝑧(𝑦(Image𝐹 ∘ Singleton)𝑧 ∧ 𝑧 = {𝑥}))
31	29, 30	bitri 275	. . . 4 ⊢ (∃𝑧 𝑦((Image𝐹 ∘ Singleton) ∩ (V × Singletons ))𝑧 ↔ ∃𝑥∃𝑧(𝑦(Image𝐹 ∘ Singleton)𝑧 ∧ 𝑧 = {𝑥}))
32		exancom 1860	. . . . . 6 ⊢ (∃𝑧(𝑦(Image𝐹 ∘ Singleton)𝑧 ∧ 𝑧 = {𝑥}) ↔ ∃𝑧(𝑧 = {𝑥} ∧ 𝑦(Image𝐹 ∘ Singleton)𝑧))
33		vsnex 5449	. . . . . . 7 ⊢ {𝑥} ∈ V
34		breq2 5170	. . . . . . 7 ⊢ (𝑧 = {𝑥} → (𝑦(Image𝐹 ∘ Singleton)𝑧 ↔ 𝑦(Image𝐹 ∘ Singleton){𝑥}))
35	33, 34	ceqsexv 3542	. . . . . 6 ⊢ (∃𝑧(𝑧 = {𝑥} ∧ 𝑦(Image𝐹 ∘ Singleton)𝑧) ↔ 𝑦(Image𝐹 ∘ Singleton){𝑥})
36	19, 33	brco 5895	. . . . . . 7 ⊢ (𝑦(Image𝐹 ∘ Singleton){𝑥} ↔ ∃𝑧(𝑦Singleton𝑧 ∧ 𝑧Image𝐹{𝑥}))
37		vex 3492	. . . . . . . . . 10 ⊢ 𝑧 ∈ V
38	19, 37	brsingle 35881	. . . . . . . . 9 ⊢ (𝑦Singleton𝑧 ↔ 𝑧 = {𝑦})
39	38	anbi1i 623	. . . . . . . 8 ⊢ ((𝑦Singleton𝑧 ∧ 𝑧Image𝐹{𝑥}) ↔ (𝑧 = {𝑦} ∧ 𝑧Image𝐹{𝑥}))
40	39	exbii 1846	. . . . . . 7 ⊢ (∃𝑧(𝑦Singleton𝑧 ∧ 𝑧Image𝐹{𝑥}) ↔ ∃𝑧(𝑧 = {𝑦} ∧ 𝑧Image𝐹{𝑥}))
41		vsnex 5449	. . . . . . . . 9 ⊢ {𝑦} ∈ V
42		breq1 5169	. . . . . . . . 9 ⊢ (𝑧 = {𝑦} → (𝑧Image𝐹{𝑥} ↔ {𝑦}Image𝐹{𝑥}))
43	41, 42	ceqsexv 3542	. . . . . . . 8 ⊢ (∃𝑧(𝑧 = {𝑦} ∧ 𝑧Image𝐹{𝑥}) ↔ {𝑦}Image𝐹{𝑥})
44	41, 33	brimage 35890	. . . . . . . 8 ⊢ ({𝑦}Image𝐹{𝑥} ↔ {𝑥} = (𝐹 “ {𝑦}))
45		eqcom 2747	. . . . . . . 8 ⊢ ({𝑥} = (𝐹 “ {𝑦}) ↔ (𝐹 “ {𝑦}) = {𝑥})
46	43, 44, 45	3bitri 297	. . . . . . 7 ⊢ (∃𝑧(𝑧 = {𝑦} ∧ 𝑧Image𝐹{𝑥}) ↔ (𝐹 “ {𝑦}) = {𝑥})
47	36, 40, 46	3bitri 297	. . . . . 6 ⊢ (𝑦(Image𝐹 ∘ Singleton){𝑥} ↔ (𝐹 “ {𝑦}) = {𝑥})
48	32, 35, 47	3bitri 297	. . . . 5 ⊢ (∃𝑧(𝑦(Image𝐹 ∘ Singleton)𝑧 ∧ 𝑧 = {𝑥}) ↔ (𝐹 “ {𝑦}) = {𝑥})
49	48	exbii 1846	. . . 4 ⊢ (∃𝑥∃𝑧(𝑦(Image𝐹 ∘ Singleton)𝑧 ∧ 𝑧 = {𝑥}) ↔ ∃𝑥(𝐹 “ {𝑦}) = {𝑥})
50	20, 31, 49	3bitri 297	. . 3 ⊢ (𝑦 ∈ dom ((Image𝐹 ∘ Singleton) ∩ (V × Singletons )) ↔ ∃𝑥(𝐹 “ {𝑦}) = {𝑥})
51	14, 18, 50	vtoclbg 3569	. 2 ⊢ (𝐴 ∈ V → (𝐴 ∈ dom ((Image𝐹 ∘ Singleton) ∩ (V × Singletons )) ↔ ∃𝑥(𝐹 “ {𝐴}) = {𝑥}))
52	1, 13, 51	pm5.21nii 378	1 ⊢ (𝐴 ∈ dom ((Image𝐹 ∘ Singleton) ∩ (V × Singletons )) ↔ ∃𝑥(𝐹 “ {𝐴}) = {𝑥})

Syntax hints:  ¬ wn 3   ↔ wb 206   ∧ wa 395   = wceq 1537  ∃wex 1777   ∈ wcel 2108  Vcvv 3488   ∩ cin 3975  ∅c0 4352  {csn 4648   class class class wbr 5166   × cxp 5698  dom cdm 5700   “ cima 5703   ∘ ccom 5704  Singletoncsingle 35802   Singletons csingles 35803  Imagecimage 35804

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-sep 5317  ax-nul 5324  ax-pr 5447  ax-un 7770

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-ral 3068  df-rex 3077  df-rab 3444  df-v 3490  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-symdif 4272  df-nul 4353  df-if 4549  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-br 5167  df-opab 5229  df-mpt 5250  df-id 5593  df-eprel 5599  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-rn 5711  df-res 5712  df-ima 5713  df-iota 6525  df-fun 6575  df-fn 6576  df-f 6577  df-fo 6579  df-fv 6581  df-1st 8030  df-2nd 8031  df-txp 35818  df-singleton 35826  df-singles 35827  df-image 35828

This theorem is referenced by:  funpartfun  35907  funpartfv  35909