Theorem ustuqtop2 24229

Description: Lemma for ustuqtop 24233. (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 793	. . . . . . . 8 ⊢ ((((((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝 ∈ 𝑋) ∧ 𝑎 ∈ (𝑁‘𝑝)) ∧ 𝑏 ∈ (𝑁‘𝑝)) ∧ 𝑤 ∈ 𝑈) ∧ 𝑎 = (𝑤 “ {𝑝})) ∧ 𝑢 ∈ 𝑈) ∧ 𝑏 = (𝑢 “ {𝑝})) → (𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝 ∈ 𝑋))
2		simp-7l 795	. . . . . . . . . 10 ⊢ ((((((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝 ∈ 𝑋) ∧ 𝑎 ∈ (𝑁‘𝑝)) ∧ 𝑏 ∈ (𝑁‘𝑝)) ∧ 𝑤 ∈ 𝑈) ∧ 𝑎 = (𝑤 “ {𝑝})) ∧ 𝑢 ∈ 𝑈) ∧ 𝑏 = (𝑢 “ {𝑝})) → 𝑈 ∈ (UnifOn‘𝑋))
3		simp-4r 790	. . . . . . . . . 10 ⊢ ((((((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝 ∈ 𝑋) ∧ 𝑎 ∈ (𝑁‘𝑝)) ∧ 𝑏 ∈ (𝑁‘𝑝)) ∧ 𝑤 ∈ 𝑈) ∧ 𝑎 = (𝑤 “ {𝑝})) ∧ 𝑢 ∈ 𝑈) ∧ 𝑏 = (𝑢 “ {𝑝})) → 𝑤 ∈ 𝑈)
4		simplr 775	. . . . . . . . . 10 ⊢ ((((((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝 ∈ 𝑋) ∧ 𝑎 ∈ (𝑁‘𝑝)) ∧ 𝑏 ∈ (𝑁‘𝑝)) ∧ 𝑤 ∈ 𝑈) ∧ 𝑎 = (𝑤 “ {𝑝})) ∧ 𝑢 ∈ 𝑈) ∧ 𝑏 = (𝑢 “ {𝑝})) → 𝑢 ∈ 𝑈)
5		ustincl 24195	. . . . . . . . . 10 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑤 ∈ 𝑈 ∧ 𝑢 ∈ 𝑈) → (𝑤 ∩ 𝑢) ∈ 𝑈)
6	2, 3, 4, 5	syl3anc 1380	. . . . . . . . 9 ⊢ ((((((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝 ∈ 𝑋) ∧ 𝑎 ∈ (𝑁‘𝑝)) ∧ 𝑏 ∈ (𝑁‘𝑝)) ∧ 𝑤 ∈ 𝑈) ∧ 𝑎 = (𝑤 “ {𝑝})) ∧ 𝑢 ∈ 𝑈) ∧ 𝑏 = (𝑢 “ {𝑝})) → (𝑤 ∩ 𝑢) ∈ 𝑈)
7		ineq12 4147	. . . . . . . . . . 11 ⊢ ((𝑎 = (𝑤 “ {𝑝}) ∧ 𝑏 = (𝑢 “ {𝑝})) → (𝑎 ∩ 𝑏) = ((𝑤 “ {𝑝}) ∩ (𝑢 “ {𝑝})))
8		inimasn 6111	. . . . . . . . . . . 12 ⊢ (𝑝 ∈ V → ((𝑤 ∩ 𝑢) “ {𝑝}) = ((𝑤 “ {𝑝}) ∩ (𝑢 “ {𝑝})))
9	8	elv 3438	. . . . . . . . . . 11 ⊢ ((𝑤 ∩ 𝑢) “ {𝑝}) = ((𝑤 “ {𝑝}) ∩ (𝑢 “ {𝑝}))
10	7, 9	eqtr4di 2794	. . . . . . . . . 10 ⊢ ((𝑎 = (𝑤 “ {𝑝}) ∧ 𝑏 = (𝑢 “ {𝑝})) → (𝑎 ∩ 𝑏) = ((𝑤 ∩ 𝑢) “ {𝑝}))
11	10	ad4ant24 761	. . . . . . . . 9 ⊢ ((((((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝 ∈ 𝑋) ∧ 𝑎 ∈ (𝑁‘𝑝)) ∧ 𝑏 ∈ (𝑁‘𝑝)) ∧ 𝑤 ∈ 𝑈) ∧ 𝑎 = (𝑤 “ {𝑝})) ∧ 𝑢 ∈ 𝑈) ∧ 𝑏 = (𝑢 “ {𝑝})) → (𝑎 ∩ 𝑏) = ((𝑤 ∩ 𝑢) “ {𝑝}))
12		imaeq1 6014	. . . . . . . . . 10 ⊢ (𝑥 = (𝑤 ∩ 𝑢) → (𝑥 “ {𝑝}) = ((𝑤 ∩ 𝑢) “ {𝑝}))
13	12	rspceeqv 3585	. . . . . . . . 9 ⊢ (((𝑤 ∩ 𝑢) ∈ 𝑈 ∧ (𝑎 ∩ 𝑏) = ((𝑤 ∩ 𝑢) “ {𝑝})) → ∃𝑥 ∈ 𝑈 (𝑎 ∩ 𝑏) = (𝑥 “ {𝑝}))
14	6, 11, 13	syl2anc 591	. . . . . . . 8 ⊢ ((((((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝 ∈ 𝑋) ∧ 𝑎 ∈ (𝑁‘𝑝)) ∧ 𝑏 ∈ (𝑁‘𝑝)) ∧ 𝑤 ∈ 𝑈) ∧ 𝑎 = (𝑤 “ {𝑝})) ∧ 𝑢 ∈ 𝑈) ∧ 𝑏 = (𝑢 “ {𝑝})) → ∃𝑥 ∈ 𝑈 (𝑎 ∩ 𝑏) = (𝑥 “ {𝑝}))
15		vex 3437	. . . . . . . . . . 11 ⊢ 𝑎 ∈ V
16	15	inex1 5248	. . . . . . . . . 10 ⊢ (𝑎 ∩ 𝑏) ∈ V
17		utopustuq.1	. . . . . . . . . . 11 ⊢ 𝑁 = (𝑝 ∈ 𝑋 ↦ ran (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑝})))
18	17	ustuqtoplem 24226	. . . . . . . . . 10 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝 ∈ 𝑋) ∧ (𝑎 ∩ 𝑏) ∈ V) → ((𝑎 ∩ 𝑏) ∈ (𝑁‘𝑝) ↔ ∃𝑥 ∈ 𝑈 (𝑎 ∩ 𝑏) = (𝑥 “ {𝑝})))
19	16, 18	mpan2 698	. . . . . . . . 9 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝 ∈ 𝑋) → ((𝑎 ∩ 𝑏) ∈ (𝑁‘𝑝) ↔ ∃𝑥 ∈ 𝑈 (𝑎 ∩ 𝑏) = (𝑥 “ {𝑝})))
20	19	biimpar 479	. . . . . . . 8 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝 ∈ 𝑋) ∧ ∃𝑥 ∈ 𝑈 (𝑎 ∩ 𝑏) = (𝑥 “ {𝑝})) → (𝑎 ∩ 𝑏) ∈ (𝑁‘𝑝))
21	1, 14, 20	syl2anc 591	. . . . . . 7 ⊢ ((((((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝 ∈ 𝑋) ∧ 𝑎 ∈ (𝑁‘𝑝)) ∧ 𝑏 ∈ (𝑁‘𝑝)) ∧ 𝑤 ∈ 𝑈) ∧ 𝑎 = (𝑤 “ {𝑝})) ∧ 𝑢 ∈ 𝑈) ∧ 𝑏 = (𝑢 “ {𝑝})) → (𝑎 ∩ 𝑏) ∈ (𝑁‘𝑝))
22	17	ustuqtoplem 24226	. . . . . . . . . 10 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝 ∈ 𝑋) ∧ 𝑏 ∈ V) → (𝑏 ∈ (𝑁‘𝑝) ↔ ∃𝑢 ∈ 𝑈 𝑏 = (𝑢 “ {𝑝})))
23	22	elvd 3439	. . . . . . . . 9 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝 ∈ 𝑋) → (𝑏 ∈ (𝑁‘𝑝) ↔ ∃𝑢 ∈ 𝑈 𝑏 = (𝑢 “ {𝑝})))
24	23	biimpa 478	. . . . . . . 8 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝 ∈ 𝑋) ∧ 𝑏 ∈ (𝑁‘𝑝)) → ∃𝑢 ∈ 𝑈 𝑏 = (𝑢 “ {𝑝}))
25	24	ad5ant13 763	. . . . . . 7 ⊢ ((((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝 ∈ 𝑋) ∧ 𝑎 ∈ (𝑁‘𝑝)) ∧ 𝑏 ∈ (𝑁‘𝑝)) ∧ 𝑤 ∈ 𝑈) ∧ 𝑎 = (𝑤 “ {𝑝})) → ∃𝑢 ∈ 𝑈 𝑏 = (𝑢 “ {𝑝}))
26	21, 25	r19.29a 3149	. . . . . 6 ⊢ ((((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝 ∈ 𝑋) ∧ 𝑎 ∈ (𝑁‘𝑝)) ∧ 𝑏 ∈ (𝑁‘𝑝)) ∧ 𝑤 ∈ 𝑈) ∧ 𝑎 = (𝑤 “ {𝑝})) → (𝑎 ∩ 𝑏) ∈ (𝑁‘𝑝))
27	17	ustuqtoplem 24226	. . . . . . . . 9 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝 ∈ 𝑋) ∧ 𝑎 ∈ V) → (𝑎 ∈ (𝑁‘𝑝) ↔ ∃𝑤 ∈ 𝑈 𝑎 = (𝑤 “ {𝑝})))
28	27	elvd 3439	. . . . . . . 8 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝 ∈ 𝑋) → (𝑎 ∈ (𝑁‘𝑝) ↔ ∃𝑤 ∈ 𝑈 𝑎 = (𝑤 “ {𝑝})))
29	28	biimpa 478	. . . . . . 7 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝 ∈ 𝑋) ∧ 𝑎 ∈ (𝑁‘𝑝)) → ∃𝑤 ∈ 𝑈 𝑎 = (𝑤 “ {𝑝}))
30	29	adantr 482	. . . . . 6 ⊢ ((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝 ∈ 𝑋) ∧ 𝑎 ∈ (𝑁‘𝑝)) ∧ 𝑏 ∈ (𝑁‘𝑝)) → ∃𝑤 ∈ 𝑈 𝑎 = (𝑤 “ {𝑝}))
31	26, 30	r19.29a 3149	. . . . 5 ⊢ ((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝 ∈ 𝑋) ∧ 𝑎 ∈ (𝑁‘𝑝)) ∧ 𝑏 ∈ (𝑁‘𝑝)) → (𝑎 ∩ 𝑏) ∈ (𝑁‘𝑝))
32	31	ralrimiva 3133	. . . 4 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝 ∈ 𝑋) ∧ 𝑎 ∈ (𝑁‘𝑝)) → ∀𝑏 ∈ (𝑁‘𝑝)(𝑎 ∩ 𝑏) ∈ (𝑁‘𝑝))
33	32	ralrimiva 3133	. . 3 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝 ∈ 𝑋) → ∀𝑎 ∈ (𝑁‘𝑝)∀𝑏 ∈ (𝑁‘𝑝)(𝑎 ∩ 𝑏) ∈ (𝑁‘𝑝))
34		fvex 6844	. . . 4 ⊢ (𝑁‘𝑝) ∈ V
35		inficl 9332	. . . 4 ⊢ ((𝑁‘𝑝) ∈ V → (∀𝑎 ∈ (𝑁‘𝑝)∀𝑏 ∈ (𝑁‘𝑝)(𝑎 ∩ 𝑏) ∈ (𝑁‘𝑝) ↔ (fi‘(𝑁‘𝑝)) = (𝑁‘𝑝)))
36	34, 35	ax-mp 5	. . 3 ⊢ (∀𝑎 ∈ (𝑁‘𝑝)∀𝑏 ∈ (𝑁‘𝑝)(𝑎 ∩ 𝑏) ∈ (𝑁‘𝑝) ↔ (fi‘(𝑁‘𝑝)) = (𝑁‘𝑝))
37	33, 36	sylib 220	. 2 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝 ∈ 𝑋) → (fi‘(𝑁‘𝑝)) = (𝑁‘𝑝))
38		eqimss 3975	. 2 ⊢ ((fi‘(𝑁‘𝑝)) = (𝑁‘𝑝) → (fi‘(𝑁‘𝑝)) ⊆ (𝑁‘𝑝))
39	37, 38	syl 17	1 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝 ∈ 𝑋) → (fi‘(𝑁‘𝑝)) ⊆ (𝑁‘𝑝))

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 397   = wceq 1548   ∈ wcel 2121  ∀wral 3055  ∃wrex 3065  Vcvv 3433   ∩ cin 3884   ⊆ wss 3885  {csn 4558   ↦ cmpt 5156  ran crn 5622   “ cima 5624  ‘cfv 6489  ficfi 9317  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-pow 5297  ax-pr 5365  ax-un 7682

This theorem depends on definitions:  df-bi 209  df-an 398  df-or 855  df-3or 1094  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-pss 3905  df-nul 4265  df-if 4458  df-pw 4534  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4842  df-int 4881  df-iun 4926  df-br 5076  df-opab 5138  df-mpt 5157  df-tr 5183  df-id 5516  df-eprel 5521  df-po 5529  df-so 5530  df-fr 5574  df-we 5576  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-ord 6317  df-on 6318  df-lim 6319  df-suc 6320  df-iota 6445  df-fun 6491  df-fn 6492  df-f 6493  df-f1 6494  df-fo 6495  df-f1o 6496  df-fv 6497  df-om 7811  df-1o 8399  df-2o 8400  df-en 8888  df-fin 8891  df-fi 9318  df-ust 24188

This theorem is referenced by:  ustuqtop  24233  utopsnneiplem  24234