Theorem ustuqtop2 24304

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

Hypothesis

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

Assertion

Ref	Expression
ustuqtop2	⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝 ∈ 𝑋) → (fi‘(𝑁‘𝑝)) ⊆ (𝑁‘𝑝))

Distinct variable groups:   𝑣,𝑝,𝑈   𝑋,𝑝,𝑣   𝑁,𝑝

Allowed substitution hint:   𝑁(𝑣)

Proof of Theorem ustuqtop2

Dummy variables 𝑤 𝑎 𝑏 𝑢 𝑥 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		simp-6l 796	. . . . . . . 8 ⊢ ((((((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝 ∈ 𝑋) ∧ 𝑎 ∈ (𝑁‘𝑝)) ∧ 𝑏 ∈ (𝑁‘𝑝)) ∧ 𝑤 ∈ 𝑈) ∧ 𝑎 = (𝑤 “ {𝑝})) ∧ 𝑢 ∈ 𝑈) ∧ 𝑏 = (𝑢 “ {𝑝})) → (𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝 ∈ 𝑋))
2		simp-7l 798	. . . . . . . . . 10 ⊢ ((((((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝 ∈ 𝑋) ∧ 𝑎 ∈ (𝑁‘𝑝)) ∧ 𝑏 ∈ (𝑁‘𝑝)) ∧ 𝑤 ∈ 𝑈) ∧ 𝑎 = (𝑤 “ {𝑝})) ∧ 𝑢 ∈ 𝑈) ∧ 𝑏 = (𝑢 “ {𝑝})) → 𝑈 ∈ (UnifOn‘𝑋))
3		simp-4r 793	. . . . . . . . . 10 ⊢ ((((((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝 ∈ 𝑋) ∧ 𝑎 ∈ (𝑁‘𝑝)) ∧ 𝑏 ∈ (𝑁‘𝑝)) ∧ 𝑤 ∈ 𝑈) ∧ 𝑎 = (𝑤 “ {𝑝})) ∧ 𝑢 ∈ 𝑈) ∧ 𝑏 = (𝑢 “ {𝑝})) → 𝑤 ∈ 𝑈)
4		simplr 778	. . . . . . . . . 10 ⊢ ((((((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝 ∈ 𝑋) ∧ 𝑎 ∈ (𝑁‘𝑝)) ∧ 𝑏 ∈ (𝑁‘𝑝)) ∧ 𝑤 ∈ 𝑈) ∧ 𝑎 = (𝑤 “ {𝑝})) ∧ 𝑢 ∈ 𝑈) ∧ 𝑏 = (𝑢 “ {𝑝})) → 𝑢 ∈ 𝑈)
5		ustincl 24270	. . . . . . . . . 10 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑤 ∈ 𝑈 ∧ 𝑢 ∈ 𝑈) → (𝑤 ∩ 𝑢) ∈ 𝑈)
6	2, 3, 4, 5	syl3anc 1392	. . . . . . . . 9 ⊢ ((((((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝 ∈ 𝑋) ∧ 𝑎 ∈ (𝑁‘𝑝)) ∧ 𝑏 ∈ (𝑁‘𝑝)) ∧ 𝑤 ∈ 𝑈) ∧ 𝑎 = (𝑤 “ {𝑝})) ∧ 𝑢 ∈ 𝑈) ∧ 𝑏 = (𝑢 “ {𝑝})) → (𝑤 ∩ 𝑢) ∈ 𝑈)
7		ineq12 4169	. . . . . . . . . . 11 ⊢ ((𝑎 = (𝑤 “ {𝑝}) ∧ 𝑏 = (𝑢 “ {𝑝})) → (𝑎 ∩ 𝑏) = ((𝑤 “ {𝑝}) ∩ (𝑢 “ {𝑝})))
8		inimasn 6143	. . . . . . . . . . . 12 ⊢ (𝑝 ∈ V → ((𝑤 ∩ 𝑢) “ {𝑝}) = ((𝑤 “ {𝑝}) ∩ (𝑢 “ {𝑝})))
9	8	elv 3461	. . . . . . . . . . 11 ⊢ ((𝑤 ∩ 𝑢) “ {𝑝}) = ((𝑤 “ {𝑝}) ∩ (𝑢 “ {𝑝}))
10	7, 9	eqtr4di 2817	. . . . . . . . . 10 ⊢ ((𝑎 = (𝑤 “ {𝑝}) ∧ 𝑏 = (𝑢 “ {𝑝})) → (𝑎 ∩ 𝑏) = ((𝑤 ∩ 𝑢) “ {𝑝}))
11	10	ad4ant24 764	. . . . . . . . 9 ⊢ ((((((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝 ∈ 𝑋) ∧ 𝑎 ∈ (𝑁‘𝑝)) ∧ 𝑏 ∈ (𝑁‘𝑝)) ∧ 𝑤 ∈ 𝑈) ∧ 𝑎 = (𝑤 “ {𝑝})) ∧ 𝑢 ∈ 𝑈) ∧ 𝑏 = (𝑢 “ {𝑝})) → (𝑎 ∩ 𝑏) = ((𝑤 ∩ 𝑢) “ {𝑝}))
12		imaeq1 6046	. . . . . . . . . 10 ⊢ (𝑥 = (𝑤 ∩ 𝑢) → (𝑥 “ {𝑝}) = ((𝑤 ∩ 𝑢) “ {𝑝}))
13	12	rspceeqv 3606	. . . . . . . . 9 ⊢ (((𝑤 ∩ 𝑢) ∈ 𝑈 ∧ (𝑎 ∩ 𝑏) = ((𝑤 ∩ 𝑢) “ {𝑝})) → ∃𝑥 ∈ 𝑈 (𝑎 ∩ 𝑏) = (𝑥 “ {𝑝}))
14	6, 11, 13	syl2anc 593	. . . . . . . 8 ⊢ ((((((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝 ∈ 𝑋) ∧ 𝑎 ∈ (𝑁‘𝑝)) ∧ 𝑏 ∈ (𝑁‘𝑝)) ∧ 𝑤 ∈ 𝑈) ∧ 𝑎 = (𝑤 “ {𝑝})) ∧ 𝑢 ∈ 𝑈) ∧ 𝑏 = (𝑢 “ {𝑝})) → ∃𝑥 ∈ 𝑈 (𝑎 ∩ 𝑏) = (𝑥 “ {𝑝}))
15		vex 3460	. . . . . . . . . . 11 ⊢ 𝑎 ∈ V
16	15	inex1 5275	. . . . . . . . . 10 ⊢ (𝑎 ∩ 𝑏) ∈ V
17		utopustuq.1	. . . . . . . . . . 11 ⊢ 𝑁 = (𝑝 ∈ 𝑋 ↦ ran (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑝})))
18	17	ustuqtoplem 24301	. . . . . . . . . 10 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝 ∈ 𝑋) ∧ (𝑎 ∩ 𝑏) ∈ V) → ((𝑎 ∩ 𝑏) ∈ (𝑁‘𝑝) ↔ ∃𝑥 ∈ 𝑈 (𝑎 ∩ 𝑏) = (𝑥 “ {𝑝})))
19	16, 18	mpan2 701	. . . . . . . . 9 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝 ∈ 𝑋) → ((𝑎 ∩ 𝑏) ∈ (𝑁‘𝑝) ↔ ∃𝑥 ∈ 𝑈 (𝑎 ∩ 𝑏) = (𝑥 “ {𝑝})))
20	19	biimpar 481	. . . . . . . 8 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝 ∈ 𝑋) ∧ ∃𝑥 ∈ 𝑈 (𝑎 ∩ 𝑏) = (𝑥 “ {𝑝})) → (𝑎 ∩ 𝑏) ∈ (𝑁‘𝑝))
21	1, 14, 20	syl2anc 593	. . . . . . 7 ⊢ ((((((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝 ∈ 𝑋) ∧ 𝑎 ∈ (𝑁‘𝑝)) ∧ 𝑏 ∈ (𝑁‘𝑝)) ∧ 𝑤 ∈ 𝑈) ∧ 𝑎 = (𝑤 “ {𝑝})) ∧ 𝑢 ∈ 𝑈) ∧ 𝑏 = (𝑢 “ {𝑝})) → (𝑎 ∩ 𝑏) ∈ (𝑁‘𝑝))
22	17	ustuqtoplem 24301	. . . . . . . . . 10 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝 ∈ 𝑋) ∧ 𝑏 ∈ V) → (𝑏 ∈ (𝑁‘𝑝) ↔ ∃𝑢 ∈ 𝑈 𝑏 = (𝑢 “ {𝑝})))
23	22	elvd 3462	. . . . . . . . 9 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝 ∈ 𝑋) → (𝑏 ∈ (𝑁‘𝑝) ↔ ∃𝑢 ∈ 𝑈 𝑏 = (𝑢 “ {𝑝})))
24	23	biimpa 480	. . . . . . . 8 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝 ∈ 𝑋) ∧ 𝑏 ∈ (𝑁‘𝑝)) → ∃𝑢 ∈ 𝑈 𝑏 = (𝑢 “ {𝑝}))
25	24	ad5ant13 766	. . . . . . 7 ⊢ ((((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝 ∈ 𝑋) ∧ 𝑎 ∈ (𝑁‘𝑝)) ∧ 𝑏 ∈ (𝑁‘𝑝)) ∧ 𝑤 ∈ 𝑈) ∧ 𝑎 = (𝑤 “ {𝑝})) → ∃𝑢 ∈ 𝑈 𝑏 = (𝑢 “ {𝑝}))
26	21, 25	r19.29a 3172	. . . . . 6 ⊢ ((((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝 ∈ 𝑋) ∧ 𝑎 ∈ (𝑁‘𝑝)) ∧ 𝑏 ∈ (𝑁‘𝑝)) ∧ 𝑤 ∈ 𝑈) ∧ 𝑎 = (𝑤 “ {𝑝})) → (𝑎 ∩ 𝑏) ∈ (𝑁‘𝑝))
27	17	ustuqtoplem 24301	. . . . . . . . 9 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝 ∈ 𝑋) ∧ 𝑎 ∈ V) → (𝑎 ∈ (𝑁‘𝑝) ↔ ∃𝑤 ∈ 𝑈 𝑎 = (𝑤 “ {𝑝})))
28	27	elvd 3462	. . . . . . . 8 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝 ∈ 𝑋) → (𝑎 ∈ (𝑁‘𝑝) ↔ ∃𝑤 ∈ 𝑈 𝑎 = (𝑤 “ {𝑝})))
29	28	biimpa 480	. . . . . . 7 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝 ∈ 𝑋) ∧ 𝑎 ∈ (𝑁‘𝑝)) → ∃𝑤 ∈ 𝑈 𝑎 = (𝑤 “ {𝑝}))
30	29	adantr 484	. . . . . 6 ⊢ ((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝 ∈ 𝑋) ∧ 𝑎 ∈ (𝑁‘𝑝)) ∧ 𝑏 ∈ (𝑁‘𝑝)) → ∃𝑤 ∈ 𝑈 𝑎 = (𝑤 “ {𝑝}))
31	26, 30	r19.29a 3172	. . . . 5 ⊢ ((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝 ∈ 𝑋) ∧ 𝑎 ∈ (𝑁‘𝑝)) ∧ 𝑏 ∈ (𝑁‘𝑝)) → (𝑎 ∩ 𝑏) ∈ (𝑁‘𝑝))
32	31	ralrimiva 3156	. . . 4 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝 ∈ 𝑋) ∧ 𝑎 ∈ (𝑁‘𝑝)) → ∀𝑏 ∈ (𝑁‘𝑝)(𝑎 ∩ 𝑏) ∈ (𝑁‘𝑝))
33	32	ralrimiva 3156	. . 3 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝 ∈ 𝑋) → ∀𝑎 ∈ (𝑁‘𝑝)∀𝑏 ∈ (𝑁‘𝑝)(𝑎 ∩ 𝑏) ∈ (𝑁‘𝑝))
34		fvex 6882	. . . 4 ⊢ (𝑁‘𝑝) ∈ V
35		inficl 9373	. . . 4 ⊢ ((𝑁‘𝑝) ∈ V → (∀𝑎 ∈ (𝑁‘𝑝)∀𝑏 ∈ (𝑁‘𝑝)(𝑎 ∩ 𝑏) ∈ (𝑁‘𝑝) ↔ (fi‘(𝑁‘𝑝)) = (𝑁‘𝑝)))
36	34, 35	ax-mp 5	. . 3 ⊢ (∀𝑎 ∈ (𝑁‘𝑝)∀𝑏 ∈ (𝑁‘𝑝)(𝑎 ∩ 𝑏) ∈ (𝑁‘𝑝) ↔ (fi‘(𝑁‘𝑝)) = (𝑁‘𝑝))
37	33, 36	sylib 220	. 2 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝 ∈ 𝑋) → (fi‘(𝑁‘𝑝)) = (𝑁‘𝑝))
38		eqimss 3996	. 2 ⊢ ((fi‘(𝑁‘𝑝)) = (𝑁‘𝑝) → (fi‘(𝑁‘𝑝)) ⊆ (𝑁‘𝑝))
39	37, 38	syl 17	1 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝 ∈ 𝑋) → (fi‘(𝑁‘𝑝)) ⊆ (𝑁‘𝑝))

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 399   = wceq 1562   ∈ wcel 2144  ∀wral 3078  ∃wrex 3088  Vcvv 3456   ∩ cin 3905   ⊆ wss 3906  {csn 4584   ↦ cmpt 5183  ran crn 5650   “ cima 5652  ‘cfv 6523  ficfi 9358  UnifOncust 24262

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1817  ax-4 1831  ax-5 1932  ax-6 1989  ax-7 2030  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2214  ax-ext 2736  ax-rep 5229  ax-sep 5248  ax-nul 5258  ax-pow 5324  ax-pr 5392  ax-un 7720

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3or 1100  df-3an 1101  df-tru 1565  df-fal 1575  df-ex 1802  df-nf 1806  df-sb 2093  df-mo 2568  df-eu 2598  df-clab 2743  df-cleq 2756  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3079  df-rex 3089  df-reu 3370  df-rab 3417  df-v 3458  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-pss 3926  df-nul 4288  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-int 4908  df-iun 4953  df-br 5103  df-opab 5165  df-mpt 5184  df-tr 5210  df-id 5544  df-eprel 5549  df-po 5557  df-so 5558  df-fr 5602  df-we 5604  df-xp 5655  df-rel 5656  df-cnv 5657  df-co 5658  df-dm 5659  df-rn 5660  df-res 5661  df-ima 5662  df-ord 6351  df-on 6352  df-lim 6353  df-suc 6354  df-iota 6479  df-fun 6525  df-fn 6526  df-f 6527  df-f1 6528  df-fo 6529  df-f1o 6530  df-fv 6531  df-om 7849  df-1o 8439  df-2o 8440  df-en 8930  df-fin 8933  df-fi 9359  df-ust 24263

This theorem is referenced by:  ustuqtop  24308  utopsnneiplem  24309