MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  prdstopn Structured version   Visualization version   GIF version

Theorem prdstopn 22233
Description: Topology of a structure product. (Contributed by Mario Carneiro, 27-Aug-2015.)
Hypotheses
Ref Expression
prdstopn.y 𝑌 = (𝑆Xs𝑅)
prdstopn.s (𝜑𝑆𝑉)
prdstopn.i (𝜑𝐼𝑊)
prdstopn.r (𝜑𝑅 Fn 𝐼)
prdstopn.o 𝑂 = (TopOpen‘𝑌)
Assertion
Ref Expression
prdstopn (𝜑𝑂 = (∏t‘(TopOpen ∘ 𝑅)))

Proof of Theorem prdstopn
Dummy variables 𝑥 𝑔 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 prdstopn.y . . . . . 6 𝑌 = (𝑆Xs𝑅)
2 prdstopn.s . . . . . 6 (𝜑𝑆𝑉)
3 prdstopn.r . . . . . . 7 (𝜑𝑅 Fn 𝐼)
4 prdstopn.i . . . . . . 7 (𝜑𝐼𝑊)
5 fnex 6957 . . . . . . 7 ((𝑅 Fn 𝐼𝐼𝑊) → 𝑅 ∈ V)
63, 4, 5syl2anc 587 . . . . . 6 (𝜑𝑅 ∈ V)
7 eqid 2798 . . . . . 6 (Base‘𝑌) = (Base‘𝑌)
8 eqidd 2799 . . . . . 6 (𝜑 → dom 𝑅 = dom 𝑅)
9 eqid 2798 . . . . . 6 (TopSet‘𝑌) = (TopSet‘𝑌)
101, 2, 6, 7, 8, 9prdstset 16731 . . . . 5 (𝜑 → (TopSet‘𝑌) = (∏t‘(TopOpen ∘ 𝑅)))
11 topnfn 16691 . . . . . . . . . . 11 TopOpen Fn V
12 dffn2 6489 . . . . . . . . . . . 12 (𝑅 Fn 𝐼𝑅:𝐼⟶V)
133, 12sylib 221 . . . . . . . . . . 11 (𝜑𝑅:𝐼⟶V)
14 fnfco 6517 . . . . . . . . . . 11 ((TopOpen Fn V ∧ 𝑅:𝐼⟶V) → (TopOpen ∘ 𝑅) Fn 𝐼)
1511, 13, 14sylancr 590 . . . . . . . . . 10 (𝜑 → (TopOpen ∘ 𝑅) Fn 𝐼)
16 eqid 2798 . . . . . . . . . . 11 {𝑥 ∣ ∃𝑔((𝑔 Fn 𝐼 ∧ ∀𝑦𝐼 (𝑔𝑦) ∈ ((TopOpen ∘ 𝑅)‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐼𝑧)(𝑔𝑦) = ((TopOpen ∘ 𝑅)‘𝑦)) ∧ 𝑥 = X𝑦𝐼 (𝑔𝑦))} = {𝑥 ∣ ∃𝑔((𝑔 Fn 𝐼 ∧ ∀𝑦𝐼 (𝑔𝑦) ∈ ((TopOpen ∘ 𝑅)‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐼𝑧)(𝑔𝑦) = ((TopOpen ∘ 𝑅)‘𝑦)) ∧ 𝑥 = X𝑦𝐼 (𝑔𝑦))}
1716ptval 22175 . . . . . . . . . 10 ((𝐼𝑊 ∧ (TopOpen ∘ 𝑅) Fn 𝐼) → (∏t‘(TopOpen ∘ 𝑅)) = (topGen‘{𝑥 ∣ ∃𝑔((𝑔 Fn 𝐼 ∧ ∀𝑦𝐼 (𝑔𝑦) ∈ ((TopOpen ∘ 𝑅)‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐼𝑧)(𝑔𝑦) = ((TopOpen ∘ 𝑅)‘𝑦)) ∧ 𝑥 = X𝑦𝐼 (𝑔𝑦))}))
184, 15, 17syl2anc 587 . . . . . . . . 9 (𝜑 → (∏t‘(TopOpen ∘ 𝑅)) = (topGen‘{𝑥 ∣ ∃𝑔((𝑔 Fn 𝐼 ∧ ∀𝑦𝐼 (𝑔𝑦) ∈ ((TopOpen ∘ 𝑅)‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐼𝑧)(𝑔𝑦) = ((TopOpen ∘ 𝑅)‘𝑦)) ∧ 𝑥 = X𝑦𝐼 (𝑔𝑦))}))
1918unieqd 4814 . . . . . . . 8 (𝜑 (∏t‘(TopOpen ∘ 𝑅)) = (topGen‘{𝑥 ∣ ∃𝑔((𝑔 Fn 𝐼 ∧ ∀𝑦𝐼 (𝑔𝑦) ∈ ((TopOpen ∘ 𝑅)‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐼𝑧)(𝑔𝑦) = ((TopOpen ∘ 𝑅)‘𝑦)) ∧ 𝑥 = X𝑦𝐼 (𝑔𝑦))}))
20 fvco2 6735 . . . . . . . . . . . . . . . . . . . . 21 ((𝑅 Fn 𝐼𝑦𝐼) → ((TopOpen ∘ 𝑅)‘𝑦) = (TopOpen‘(𝑅𝑦)))
213, 20sylan 583 . . . . . . . . . . . . . . . . . . . 20 ((𝜑𝑦𝐼) → ((TopOpen ∘ 𝑅)‘𝑦) = (TopOpen‘(𝑅𝑦)))
22 eqid 2798 . . . . . . . . . . . . . . . . . . . . . 22 (Base‘(𝑅𝑦)) = (Base‘(𝑅𝑦))
23 eqid 2798 . . . . . . . . . . . . . . . . . . . . . 22 (TopSet‘(𝑅𝑦)) = (TopSet‘(𝑅𝑦))
2422, 23topnval 16700 . . . . . . . . . . . . . . . . . . . . 21 ((TopSet‘(𝑅𝑦)) ↾t (Base‘(𝑅𝑦))) = (TopOpen‘(𝑅𝑦))
25 restsspw 16697 . . . . . . . . . . . . . . . . . . . . 21 ((TopSet‘(𝑅𝑦)) ↾t (Base‘(𝑅𝑦))) ⊆ 𝒫 (Base‘(𝑅𝑦))
2624, 25eqsstrri 3950 . . . . . . . . . . . . . . . . . . . 20 (TopOpen‘(𝑅𝑦)) ⊆ 𝒫 (Base‘(𝑅𝑦))
2721, 26eqsstrdi 3969 . . . . . . . . . . . . . . . . . . 19 ((𝜑𝑦𝐼) → ((TopOpen ∘ 𝑅)‘𝑦) ⊆ 𝒫 (Base‘(𝑅𝑦)))
2827sseld 3914 . . . . . . . . . . . . . . . . . 18 ((𝜑𝑦𝐼) → ((𝑔𝑦) ∈ ((TopOpen ∘ 𝑅)‘𝑦) → (𝑔𝑦) ∈ 𝒫 (Base‘(𝑅𝑦))))
29 fvex 6658 . . . . . . . . . . . . . . . . . . 19 (𝑔𝑦) ∈ V
3029elpw 4501 . . . . . . . . . . . . . . . . . 18 ((𝑔𝑦) ∈ 𝒫 (Base‘(𝑅𝑦)) ↔ (𝑔𝑦) ⊆ (Base‘(𝑅𝑦)))
3128, 30syl6ib 254 . . . . . . . . . . . . . . . . 17 ((𝜑𝑦𝐼) → ((𝑔𝑦) ∈ ((TopOpen ∘ 𝑅)‘𝑦) → (𝑔𝑦) ⊆ (Base‘(𝑅𝑦))))
3231ralimdva 3144 . . . . . . . . . . . . . . . 16 (𝜑 → (∀𝑦𝐼 (𝑔𝑦) ∈ ((TopOpen ∘ 𝑅)‘𝑦) → ∀𝑦𝐼 (𝑔𝑦) ⊆ (Base‘(𝑅𝑦))))
33 simpl2 1189 . . . . . . . . . . . . . . . 16 (((𝑔 Fn 𝐼 ∧ ∀𝑦𝐼 (𝑔𝑦) ∈ ((TopOpen ∘ 𝑅)‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐼𝑧)(𝑔𝑦) = ((TopOpen ∘ 𝑅)‘𝑦)) ∧ 𝑥 = X𝑦𝐼 (𝑔𝑦)) → ∀𝑦𝐼 (𝑔𝑦) ∈ ((TopOpen ∘ 𝑅)‘𝑦))
3432, 33impel 509 . . . . . . . . . . . . . . 15 ((𝜑 ∧ ((𝑔 Fn 𝐼 ∧ ∀𝑦𝐼 (𝑔𝑦) ∈ ((TopOpen ∘ 𝑅)‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐼𝑧)(𝑔𝑦) = ((TopOpen ∘ 𝑅)‘𝑦)) ∧ 𝑥 = X𝑦𝐼 (𝑔𝑦))) → ∀𝑦𝐼 (𝑔𝑦) ⊆ (Base‘(𝑅𝑦)))
35 ss2ixp 8457 . . . . . . . . . . . . . . 15 (∀𝑦𝐼 (𝑔𝑦) ⊆ (Base‘(𝑅𝑦)) → X𝑦𝐼 (𝑔𝑦) ⊆ X𝑦𝐼 (Base‘(𝑅𝑦)))
3634, 35syl 17 . . . . . . . . . . . . . 14 ((𝜑 ∧ ((𝑔 Fn 𝐼 ∧ ∀𝑦𝐼 (𝑔𝑦) ∈ ((TopOpen ∘ 𝑅)‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐼𝑧)(𝑔𝑦) = ((TopOpen ∘ 𝑅)‘𝑦)) ∧ 𝑥 = X𝑦𝐼 (𝑔𝑦))) → X𝑦𝐼 (𝑔𝑦) ⊆ X𝑦𝐼 (Base‘(𝑅𝑦)))
37 simprr 772 . . . . . . . . . . . . . 14 ((𝜑 ∧ ((𝑔 Fn 𝐼 ∧ ∀𝑦𝐼 (𝑔𝑦) ∈ ((TopOpen ∘ 𝑅)‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐼𝑧)(𝑔𝑦) = ((TopOpen ∘ 𝑅)‘𝑦)) ∧ 𝑥 = X𝑦𝐼 (𝑔𝑦))) → 𝑥 = X𝑦𝐼 (𝑔𝑦))
381, 7, 2, 4, 3prdsbas2 16734 . . . . . . . . . . . . . . 15 (𝜑 → (Base‘𝑌) = X𝑦𝐼 (Base‘(𝑅𝑦)))
3938adantr 484 . . . . . . . . . . . . . 14 ((𝜑 ∧ ((𝑔 Fn 𝐼 ∧ ∀𝑦𝐼 (𝑔𝑦) ∈ ((TopOpen ∘ 𝑅)‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐼𝑧)(𝑔𝑦) = ((TopOpen ∘ 𝑅)‘𝑦)) ∧ 𝑥 = X𝑦𝐼 (𝑔𝑦))) → (Base‘𝑌) = X𝑦𝐼 (Base‘(𝑅𝑦)))
4036, 37, 393sstr4d 3962 . . . . . . . . . . . . 13 ((𝜑 ∧ ((𝑔 Fn 𝐼 ∧ ∀𝑦𝐼 (𝑔𝑦) ∈ ((TopOpen ∘ 𝑅)‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐼𝑧)(𝑔𝑦) = ((TopOpen ∘ 𝑅)‘𝑦)) ∧ 𝑥 = X𝑦𝐼 (𝑔𝑦))) → 𝑥 ⊆ (Base‘𝑌))
4140ex 416 . . . . . . . . . . . 12 (𝜑 → (((𝑔 Fn 𝐼 ∧ ∀𝑦𝐼 (𝑔𝑦) ∈ ((TopOpen ∘ 𝑅)‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐼𝑧)(𝑔𝑦) = ((TopOpen ∘ 𝑅)‘𝑦)) ∧ 𝑥 = X𝑦𝐼 (𝑔𝑦)) → 𝑥 ⊆ (Base‘𝑌)))
4241exlimdv 1934 . . . . . . . . . . 11 (𝜑 → (∃𝑔((𝑔 Fn 𝐼 ∧ ∀𝑦𝐼 (𝑔𝑦) ∈ ((TopOpen ∘ 𝑅)‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐼𝑧)(𝑔𝑦) = ((TopOpen ∘ 𝑅)‘𝑦)) ∧ 𝑥 = X𝑦𝐼 (𝑔𝑦)) → 𝑥 ⊆ (Base‘𝑌)))
43 velpw 4502 . . . . . . . . . . 11 (𝑥 ∈ 𝒫 (Base‘𝑌) ↔ 𝑥 ⊆ (Base‘𝑌))
4442, 43syl6ibr 255 . . . . . . . . . 10 (𝜑 → (∃𝑔((𝑔 Fn 𝐼 ∧ ∀𝑦𝐼 (𝑔𝑦) ∈ ((TopOpen ∘ 𝑅)‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐼𝑧)(𝑔𝑦) = ((TopOpen ∘ 𝑅)‘𝑦)) ∧ 𝑥 = X𝑦𝐼 (𝑔𝑦)) → 𝑥 ∈ 𝒫 (Base‘𝑌)))
4544abssdv 3996 . . . . . . . . 9 (𝜑 → {𝑥 ∣ ∃𝑔((𝑔 Fn 𝐼 ∧ ∀𝑦𝐼 (𝑔𝑦) ∈ ((TopOpen ∘ 𝑅)‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐼𝑧)(𝑔𝑦) = ((TopOpen ∘ 𝑅)‘𝑦)) ∧ 𝑥 = X𝑦𝐼 (𝑔𝑦))} ⊆ 𝒫 (Base‘𝑌))
46 fvex 6658 . . . . . . . . . . 11 (Base‘𝑌) ∈ V
4746pwex 5246 . . . . . . . . . 10 𝒫 (Base‘𝑌) ∈ V
4847ssex 5189 . . . . . . . . 9 ({𝑥 ∣ ∃𝑔((𝑔 Fn 𝐼 ∧ ∀𝑦𝐼 (𝑔𝑦) ∈ ((TopOpen ∘ 𝑅)‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐼𝑧)(𝑔𝑦) = ((TopOpen ∘ 𝑅)‘𝑦)) ∧ 𝑥 = X𝑦𝐼 (𝑔𝑦))} ⊆ 𝒫 (Base‘𝑌) → {𝑥 ∣ ∃𝑔((𝑔 Fn 𝐼 ∧ ∀𝑦𝐼 (𝑔𝑦) ∈ ((TopOpen ∘ 𝑅)‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐼𝑧)(𝑔𝑦) = ((TopOpen ∘ 𝑅)‘𝑦)) ∧ 𝑥 = X𝑦𝐼 (𝑔𝑦))} ∈ V)
49 unitg 21572 . . . . . . . . 9 ({𝑥 ∣ ∃𝑔((𝑔 Fn 𝐼 ∧ ∀𝑦𝐼 (𝑔𝑦) ∈ ((TopOpen ∘ 𝑅)‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐼𝑧)(𝑔𝑦) = ((TopOpen ∘ 𝑅)‘𝑦)) ∧ 𝑥 = X𝑦𝐼 (𝑔𝑦))} ∈ V → (topGen‘{𝑥 ∣ ∃𝑔((𝑔 Fn 𝐼 ∧ ∀𝑦𝐼 (𝑔𝑦) ∈ ((TopOpen ∘ 𝑅)‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐼𝑧)(𝑔𝑦) = ((TopOpen ∘ 𝑅)‘𝑦)) ∧ 𝑥 = X𝑦𝐼 (𝑔𝑦))}) = {𝑥 ∣ ∃𝑔((𝑔 Fn 𝐼 ∧ ∀𝑦𝐼 (𝑔𝑦) ∈ ((TopOpen ∘ 𝑅)‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐼𝑧)(𝑔𝑦) = ((TopOpen ∘ 𝑅)‘𝑦)) ∧ 𝑥 = X𝑦𝐼 (𝑔𝑦))})
5045, 48, 493syl 18 . . . . . . . 8 (𝜑 (topGen‘{𝑥 ∣ ∃𝑔((𝑔 Fn 𝐼 ∧ ∀𝑦𝐼 (𝑔𝑦) ∈ ((TopOpen ∘ 𝑅)‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐼𝑧)(𝑔𝑦) = ((TopOpen ∘ 𝑅)‘𝑦)) ∧ 𝑥 = X𝑦𝐼 (𝑔𝑦))}) = {𝑥 ∣ ∃𝑔((𝑔 Fn 𝐼 ∧ ∀𝑦𝐼 (𝑔𝑦) ∈ ((TopOpen ∘ 𝑅)‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐼𝑧)(𝑔𝑦) = ((TopOpen ∘ 𝑅)‘𝑦)) ∧ 𝑥 = X𝑦𝐼 (𝑔𝑦))})
5119, 50eqtrd 2833 . . . . . . 7 (𝜑 (∏t‘(TopOpen ∘ 𝑅)) = {𝑥 ∣ ∃𝑔((𝑔 Fn 𝐼 ∧ ∀𝑦𝐼 (𝑔𝑦) ∈ ((TopOpen ∘ 𝑅)‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐼𝑧)(𝑔𝑦) = ((TopOpen ∘ 𝑅)‘𝑦)) ∧ 𝑥 = X𝑦𝐼 (𝑔𝑦))})
52 sspwuni 4985 . . . . . . . 8 ({𝑥 ∣ ∃𝑔((𝑔 Fn 𝐼 ∧ ∀𝑦𝐼 (𝑔𝑦) ∈ ((TopOpen ∘ 𝑅)‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐼𝑧)(𝑔𝑦) = ((TopOpen ∘ 𝑅)‘𝑦)) ∧ 𝑥 = X𝑦𝐼 (𝑔𝑦))} ⊆ 𝒫 (Base‘𝑌) ↔ {𝑥 ∣ ∃𝑔((𝑔 Fn 𝐼 ∧ ∀𝑦𝐼 (𝑔𝑦) ∈ ((TopOpen ∘ 𝑅)‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐼𝑧)(𝑔𝑦) = ((TopOpen ∘ 𝑅)‘𝑦)) ∧ 𝑥 = X𝑦𝐼 (𝑔𝑦))} ⊆ (Base‘𝑌))
5345, 52sylib 221 . . . . . . 7 (𝜑 {𝑥 ∣ ∃𝑔((𝑔 Fn 𝐼 ∧ ∀𝑦𝐼 (𝑔𝑦) ∈ ((TopOpen ∘ 𝑅)‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐼𝑧)(𝑔𝑦) = ((TopOpen ∘ 𝑅)‘𝑦)) ∧ 𝑥 = X𝑦𝐼 (𝑔𝑦))} ⊆ (Base‘𝑌))
5451, 53eqsstrd 3953 . . . . . 6 (𝜑 (∏t‘(TopOpen ∘ 𝑅)) ⊆ (Base‘𝑌))
55 sspwuni 4985 . . . . . 6 ((∏t‘(TopOpen ∘ 𝑅)) ⊆ 𝒫 (Base‘𝑌) ↔ (∏t‘(TopOpen ∘ 𝑅)) ⊆ (Base‘𝑌))
5654, 55sylibr 237 . . . . 5 (𝜑 → (∏t‘(TopOpen ∘ 𝑅)) ⊆ 𝒫 (Base‘𝑌))
5710, 56eqsstrd 3953 . . . 4 (𝜑 → (TopSet‘𝑌) ⊆ 𝒫 (Base‘𝑌))
587, 9topnid 16701 . . . 4 ((TopSet‘𝑌) ⊆ 𝒫 (Base‘𝑌) → (TopSet‘𝑌) = (TopOpen‘𝑌))
5957, 58syl 17 . . 3 (𝜑 → (TopSet‘𝑌) = (TopOpen‘𝑌))
60 prdstopn.o . . 3 𝑂 = (TopOpen‘𝑌)
6159, 60eqtr4di 2851 . 2 (𝜑 → (TopSet‘𝑌) = 𝑂)
6261, 10eqtr3d 2835 1 (𝜑𝑂 = (∏t‘(TopOpen ∘ 𝑅)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 399  w3a 1084   = wceq 1538  wex 1781  wcel 2111  {cab 2776  wral 3106  wrex 3107  Vcvv 3441  cdif 3878  wss 3881  𝒫 cpw 4497   cuni 4800  dom cdm 5519  ccom 5523   Fn wfn 6319  wf 6320  cfv 6324  (class class class)co 7135  Xcixp 8444  Fincfn 8492  Basecbs 16475  TopSetcts 16563  t crest 16686  TopOpenctopn 16687  topGenctg 16703  tcpt 16704  Xscprds 16711
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-rep 5154  ax-sep 5167  ax-nul 5174  ax-pow 5231  ax-pr 5295  ax-un 7441  ax-cnex 10582  ax-resscn 10583  ax-1cn 10584  ax-icn 10585  ax-addcl 10586  ax-addrcl 10587  ax-mulcl 10588  ax-mulrcl 10589  ax-mulcom 10590  ax-addass 10591  ax-mulass 10592  ax-distr 10593  ax-i2m1 10594  ax-1ne0 10595  ax-1rid 10596  ax-rnegex 10597  ax-rrecex 10598  ax-cnre 10599  ax-pre-lttri 10600  ax-pre-lttrn 10601  ax-pre-ltadd 10602  ax-pre-mulgt0 10603
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3or 1085  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-nel 3092  df-ral 3111  df-rex 3112  df-reu 3113  df-rab 3115  df-v 3443  df-sbc 3721  df-csb 3829  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-pss 3900  df-nul 4244  df-if 4426  df-pw 4499  df-sn 4526  df-pr 4528  df-tp 4530  df-op 4532  df-uni 4801  df-int 4839  df-iun 4883  df-br 5031  df-opab 5093  df-mpt 5111  df-tr 5137  df-id 5425  df-eprel 5430  df-po 5438  df-so 5439  df-fr 5478  df-we 5480  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-rn 5530  df-res 5531  df-ima 5532  df-pred 6116  df-ord 6162  df-on 6163  df-lim 6164  df-suc 6165  df-iota 6283  df-fun 6326  df-fn 6327  df-f 6328  df-f1 6329  df-fo 6330  df-f1o 6331  df-fv 6332  df-riota 7093  df-ov 7138  df-oprab 7139  df-mpo 7140  df-om 7561  df-1st 7671  df-2nd 7672  df-wrecs 7930  df-recs 7991  df-rdg 8029  df-1o 8085  df-oadd 8089  df-er 8272  df-map 8391  df-ixp 8445  df-en 8493  df-dom 8494  df-sdom 8495  df-fin 8496  df-sup 8890  df-pnf 10666  df-mnf 10667  df-xr 10668  df-ltxr 10669  df-le 10670  df-sub 10861  df-neg 10862  df-nn 11626  df-2 11688  df-3 11689  df-4 11690  df-5 11691  df-6 11692  df-7 11693  df-8 11694  df-9 11695  df-n0 11886  df-z 11970  df-dec 12087  df-uz 12232  df-fz 12886  df-struct 16477  df-ndx 16478  df-slot 16479  df-base 16481  df-plusg 16570  df-mulr 16571  df-sca 16573  df-vsca 16574  df-ip 16575  df-tset 16576  df-ple 16577  df-ds 16579  df-hom 16581  df-cco 16582  df-rest 16688  df-topn 16689  df-topgen 16709  df-pt 16710  df-prds 16713
This theorem is referenced by:  xpstopnlem2  22416  prdstmdd  22729  prdstgpd  22730  prdsxmslem2  23136
  Copyright terms: Public domain W3C validator