Theorem ustuqtoplem 24226

Description: Lemma for ustuqtop 24233. (Contributed by Thierry Arnoux, 11-Jan-2018.)

Hypothesis

Ref	Expression
utopustuq.1	⊢ 𝑁 = (𝑝 ∈ 𝑋 ↦ ran (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑝})))

Assertion

Ref	Expression
ustuqtoplem	⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ 𝐴 ∈ 𝑉) → (𝐴 ∈ (𝑁‘𝑃) ↔ ∃𝑤 ∈ 𝑈 𝐴 = (𝑤 “ {𝑃})))

Distinct variable groups:   𝑤,𝐴   𝑤,𝑣,𝑃   𝑣,𝑝,𝑤,𝑈   𝑋,𝑝,𝑣

Allowed substitution hints:   𝐴(𝑣,𝑝)   𝑃(𝑝)   𝑁(𝑤,𝑣,𝑝)   𝑉(𝑤,𝑣,𝑝)   𝑋(𝑤)

Proof of Theorem ustuqtoplem

Dummy variable 𝑞 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		utopustuq.1	. . . . 5 ⊢ 𝑁 = (𝑝 ∈ 𝑋 ↦ ran (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑝})))
2		simpl 484	. . . . . . . . . 10 ⊢ ((𝑝 = 𝑞 ∧ 𝑣 ∈ 𝑈) → 𝑝 = 𝑞)
3	2	sneqd 4570	. . . . . . . . 9 ⊢ ((𝑝 = 𝑞 ∧ 𝑣 ∈ 𝑈) → {𝑝} = {𝑞})
4	3	imaeq2d 6019	. . . . . . . 8 ⊢ ((𝑝 = 𝑞 ∧ 𝑣 ∈ 𝑈) → (𝑣 “ {𝑝}) = (𝑣 “ {𝑞}))
5	4	mpteq2dva 5168	. . . . . . 7 ⊢ (𝑝 = 𝑞 → (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑝})) = (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑞})))
6	5	rneqd 5887	. . . . . 6 ⊢ (𝑝 = 𝑞 → ran (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑝})) = ran (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑞})))
7	6	cbvmptv 5179	. . . . 5 ⊢ (𝑝 ∈ 𝑋 ↦ ran (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑝}))) = (𝑞 ∈ 𝑋 ↦ ran (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑞})))
8	1, 7	eqtri 2764	. . . 4 ⊢ 𝑁 = (𝑞 ∈ 𝑋 ↦ ran (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑞})))
9		simpr2 1203	. . . . . . . . 9 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑃 ∈ 𝑋 ∧ 𝑞 = 𝑃 ∧ 𝑣 ∈ 𝑈)) → 𝑞 = 𝑃)
10	9	sneqd 4570	. . . . . . . 8 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑃 ∈ 𝑋 ∧ 𝑞 = 𝑃 ∧ 𝑣 ∈ 𝑈)) → {𝑞} = {𝑃})
11	10	imaeq2d 6019	. . . . . . 7 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑃 ∈ 𝑋 ∧ 𝑞 = 𝑃 ∧ 𝑣 ∈ 𝑈)) → (𝑣 “ {𝑞}) = (𝑣 “ {𝑃}))
12	11	3anassrs 1368	. . . . . 6 ⊢ ((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ 𝑞 = 𝑃) ∧ 𝑣 ∈ 𝑈) → (𝑣 “ {𝑞}) = (𝑣 “ {𝑃}))
13	12	mpteq2dva 5168	. . . . 5 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ 𝑞 = 𝑃) → (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑞})) = (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑃})))
14	13	rneqd 5887	. . . 4 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ 𝑞 = 𝑃) → ran (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑞})) = ran (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑃})))
15		simpr 486	. . . 4 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑃 ∈ 𝑋) → 𝑃 ∈ 𝑋)
16		mptexg 7169	. . . . . 6 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑃})) ∈ V)
17		rnexg 7846	. . . . . 6 ⊢ ((𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑃})) ∈ V → ran (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑃})) ∈ V)
18	16, 17	syl 17	. . . . 5 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → ran (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑃})) ∈ V)
19	18	adantr 482	. . . 4 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑃 ∈ 𝑋) → ran (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑃})) ∈ V)
20	8, 14, 15, 19	fvmptd2 6948	. . 3 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑃 ∈ 𝑋) → (𝑁‘𝑃) = ran (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑃})))
21	20	eleq2d 2827	. 2 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑃 ∈ 𝑋) → (𝐴 ∈ (𝑁‘𝑃) ↔ 𝐴 ∈ ran (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑃}))))
22		imaeq1 6014	. . . 4 ⊢ (𝑣 = 𝑤 → (𝑣 “ {𝑃}) = (𝑤 “ {𝑃}))
23	22	cbvmptv 5179	. . 3 ⊢ (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑃})) = (𝑤 ∈ 𝑈 ↦ (𝑤 “ {𝑃}))
24	23	elrnmpt 5907	. 2 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∈ ran (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑃})) ↔ ∃𝑤 ∈ 𝑈 𝐴 = (𝑤 “ {𝑃})))
25	21, 24	sylan9bb 515	1 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ 𝐴 ∈ 𝑉) → (𝐴 ∈ (𝑁‘𝑃) ↔ ∃𝑤 ∈ 𝑈 𝐴 = (𝑤 “ {𝑃})))

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 397   ∧ w3a 1093   = wceq 1548   ∈ wcel 2121  ∃wrex 3065  Vcvv 3433  {csn 4558   ↦ cmpt 5156  ran crn 5622   “ cima 5624  ‘cfv 6489  UnifOncust 24187

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1975  ax-7 2016  ax-8 2123  ax-9 2131  ax-10 2154  ax-11 2170  ax-12 2191  ax-ext 2713  ax-rep 5202  ax-sep 5221  ax-nul 5231  ax-pr 5365  ax-un 7682

This theorem depends on definitions:  df-bi 209  df-an 398  df-or 855  df-3an 1095  df-tru 1551  df-fal 1561  df-ex 1788  df-nf 1792  df-sb 2075  df-mo 2545  df-eu 2575  df-clab 2720  df-cleq 2733  df-clel 2816  df-nfc 2890  df-ne 2937  df-ral 3056  df-rex 3066  df-reu 3347  df-rab 3394  df-v 3435  df-sbc 3726  df-csb 3834  df-dif 3888  df-un 3890  df-in 3892  df-ss 3902  df-nul 4265  df-if 4458  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4842  df-iun 4926  df-br 5076  df-opab 5138  df-mpt 5157  df-id 5516  df-xp 5627  df-rel 5628  df-cnv 5629  df-co 5630  df-dm 5631  df-rn 5632  df-res 5633  df-ima 5634  df-iota 6445  df-fun 6491  df-fn 6492  df-f 6493  df-f1 6494  df-fo 6495  df-f1o 6496  df-fv 6497

This theorem is referenced by:  ustuqtop1  24228  ustuqtop2  24229  ustuqtop3  24230  ustuqtop4  24231  ustuqtop5  24232  utopsnneiplem  24234