Theorem ustuqtoplem 24264

Description: Lemma for ustuqtop 24271. (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 482	. . . . . . . . . 10 ⊢ ((𝑝 = 𝑞 ∧ 𝑣 ∈ 𝑈) → 𝑝 = 𝑞)
3	2	sneqd 4643	. . . . . . . . 9 ⊢ ((𝑝 = 𝑞 ∧ 𝑣 ∈ 𝑈) → {𝑝} = {𝑞})
4	3	imaeq2d 6080	. . . . . . . 8 ⊢ ((𝑝 = 𝑞 ∧ 𝑣 ∈ 𝑈) → (𝑣 “ {𝑝}) = (𝑣 “ {𝑞}))
5	4	mpteq2dva 5248	. . . . . . 7 ⊢ (𝑝 = 𝑞 → (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑝})) = (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑞})))
6	5	rneqd 5952	. . . . . 6 ⊢ (𝑝 = 𝑞 → ran (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑝})) = ran (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑞})))
7	6	cbvmptv 5261	. . . . 5 ⊢ (𝑝 ∈ 𝑋 ↦ ran (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑝}))) = (𝑞 ∈ 𝑋 ↦ ran (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑞})))
8	1, 7	eqtri 2763	. . . 4 ⊢ 𝑁 = (𝑞 ∈ 𝑋 ↦ ran (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑞})))
9		simpr2 1194	. . . . . . . . 9 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑃 ∈ 𝑋 ∧ 𝑞 = 𝑃 ∧ 𝑣 ∈ 𝑈)) → 𝑞 = 𝑃)
10	9	sneqd 4643	. . . . . . . 8 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑃 ∈ 𝑋 ∧ 𝑞 = 𝑃 ∧ 𝑣 ∈ 𝑈)) → {𝑞} = {𝑃})
11	10	imaeq2d 6080	. . . . . . 7 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑃 ∈ 𝑋 ∧ 𝑞 = 𝑃 ∧ 𝑣 ∈ 𝑈)) → (𝑣 “ {𝑞}) = (𝑣 “ {𝑃}))
12	11	3anassrs 1359	. . . . . 6 ⊢ ((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ 𝑞 = 𝑃) ∧ 𝑣 ∈ 𝑈) → (𝑣 “ {𝑞}) = (𝑣 “ {𝑃}))
13	12	mpteq2dva 5248	. . . . 5 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ 𝑞 = 𝑃) → (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑞})) = (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑃})))
14	13	rneqd 5952	. . . 4 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ 𝑞 = 𝑃) → ran (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑞})) = ran (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑃})))
15		simpr 484	. . . 4 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑃 ∈ 𝑋) → 𝑃 ∈ 𝑋)
16		mptexg 7241	. . . . . 6 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑃})) ∈ V)
17		rnexg 7925	. . . . . 6 ⊢ ((𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑃})) ∈ V → ran (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑃})) ∈ V)
18	16, 17	syl 17	. . . . 5 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → ran (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑃})) ∈ V)
19	18	adantr 480	. . . 4 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑃 ∈ 𝑋) → ran (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑃})) ∈ V)
20	8, 14, 15, 19	fvmptd2 7024	. . 3 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑃 ∈ 𝑋) → (𝑁‘𝑃) = ran (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑃})))
21	20	eleq2d 2825	. 2 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑃 ∈ 𝑋) → (𝐴 ∈ (𝑁‘𝑃) ↔ 𝐴 ∈ ran (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑃}))))
22		imaeq1 6075	. . . 4 ⊢ (𝑣 = 𝑤 → (𝑣 “ {𝑃}) = (𝑤 “ {𝑃}))
23	22	cbvmptv 5261	. . 3 ⊢ (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑃})) = (𝑤 ∈ 𝑈 ↦ (𝑤 “ {𝑃}))
24	23	elrnmpt 5972	. 2 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∈ ran (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑃})) ↔ ∃𝑤 ∈ 𝑈 𝐴 = (𝑤 “ {𝑃})))
25	21, 24	sylan9bb 509	1 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ 𝐴 ∈ 𝑉) → (𝐴 ∈ (𝑁‘𝑃) ↔ ∃𝑤 ∈ 𝑈 𝐴 = (𝑤 “ {𝑃})))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1086   = wceq 1537   ∈ wcel 2106  ∃wrex 3068  Vcvv 3478  {csn 4631   ↦ cmpt 5231  ran crn 5690   “ cima 5692  ‘cfv 6563  UnifOncust 24224

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-ext 2706  ax-rep 5285  ax-sep 5302  ax-nul 5312  ax-pr 5438  ax-un 7754

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-nf 1781  df-sb 2063  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2727  df-clel 2814  df-nfc 2890  df-ne 2939  df-ral 3060  df-rex 3069  df-reu 3379  df-rab 3434  df-v 3480  df-sbc 3792  df-csb 3909  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-nul 4340  df-if 4532  df-sn 4632  df-pr 4634  df-op 4638  df-uni 4913  df-iun 4998  df-br 5149  df-opab 5211  df-mpt 5232  df-id 5583  df-xp 5695  df-rel 5696  df-cnv 5697  df-co 5698  df-dm 5699  df-rn 5700  df-res 5701  df-ima 5702  df-iota 6516  df-fun 6565  df-fn 6566  df-f 6567  df-f1 6568  df-fo 6569  df-f1o 6570  df-fv 6571

This theorem is referenced by:  ustuqtop1  24266  ustuqtop2  24267  ustuqtop3  24268  ustuqtop4  24269  ustuqtop5  24270  utopsnneiplem  24272