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

Theorem baspartn 21569
 Description: A disjoint system of sets is a basis for a topology. (Contributed by Stefan O'Rear, 22-Feb-2015.)
Assertion
Ref Expression
baspartn ((𝑃𝑉 ∧ ∀𝑥𝑃𝑦𝑃 (𝑥 = 𝑦 ∨ (𝑥𝑦) = ∅)) → 𝑃 ∈ TopBases)
Distinct variable group:   𝑥,𝑃,𝑦
Allowed substitution hints:   𝑉(𝑥,𝑦)

Proof of Theorem baspartn
StepHypRef Expression
1 id 22 . . . . . . . . 9 (𝑥𝑃𝑥𝑃)
2 pwidg 4519 . . . . . . . . 9 (𝑥𝑃𝑥 ∈ 𝒫 𝑥)
31, 2elind 4121 . . . . . . . 8 (𝑥𝑃𝑥 ∈ (𝑃 ∩ 𝒫 𝑥))
4 elssuni 4831 . . . . . . . 8 (𝑥 ∈ (𝑃 ∩ 𝒫 𝑥) → 𝑥 (𝑃 ∩ 𝒫 𝑥))
53, 4syl 17 . . . . . . 7 (𝑥𝑃𝑥 (𝑃 ∩ 𝒫 𝑥))
6 inidm 4145 . . . . . . . . 9 (𝑥𝑥) = 𝑥
7 ineq2 4133 . . . . . . . . 9 (𝑥 = 𝑦 → (𝑥𝑥) = (𝑥𝑦))
86, 7syl5eqr 2847 . . . . . . . 8 (𝑥 = 𝑦𝑥 = (𝑥𝑦))
98pweqd 4516 . . . . . . . . . 10 (𝑥 = 𝑦 → 𝒫 𝑥 = 𝒫 (𝑥𝑦))
109ineq2d 4139 . . . . . . . . 9 (𝑥 = 𝑦 → (𝑃 ∩ 𝒫 𝑥) = (𝑃 ∩ 𝒫 (𝑥𝑦)))
1110unieqd 4815 . . . . . . . 8 (𝑥 = 𝑦 (𝑃 ∩ 𝒫 𝑥) = (𝑃 ∩ 𝒫 (𝑥𝑦)))
128, 11sseq12d 3948 . . . . . . 7 (𝑥 = 𝑦 → (𝑥 (𝑃 ∩ 𝒫 𝑥) ↔ (𝑥𝑦) ⊆ (𝑃 ∩ 𝒫 (𝑥𝑦))))
135, 12syl5ibcom 248 . . . . . 6 (𝑥𝑃 → (𝑥 = 𝑦 → (𝑥𝑦) ⊆ (𝑃 ∩ 𝒫 (𝑥𝑦))))
14 0ss 4304 . . . . . . . 8 ∅ ⊆ (𝑃 ∩ 𝒫 (𝑥𝑦))
15 sseq1 3940 . . . . . . . 8 ((𝑥𝑦) = ∅ → ((𝑥𝑦) ⊆ (𝑃 ∩ 𝒫 (𝑥𝑦)) ↔ ∅ ⊆ (𝑃 ∩ 𝒫 (𝑥𝑦))))
1614, 15mpbiri 261 . . . . . . 7 ((𝑥𝑦) = ∅ → (𝑥𝑦) ⊆ (𝑃 ∩ 𝒫 (𝑥𝑦)))
1716a1i 11 . . . . . 6 (𝑥𝑃 → ((𝑥𝑦) = ∅ → (𝑥𝑦) ⊆ (𝑃 ∩ 𝒫 (𝑥𝑦))))
1813, 17jaod 856 . . . . 5 (𝑥𝑃 → ((𝑥 = 𝑦 ∨ (𝑥𝑦) = ∅) → (𝑥𝑦) ⊆ (𝑃 ∩ 𝒫 (𝑥𝑦))))
1918ralimdv 3145 . . . 4 (𝑥𝑃 → (∀𝑦𝑃 (𝑥 = 𝑦 ∨ (𝑥𝑦) = ∅) → ∀𝑦𝑃 (𝑥𝑦) ⊆ (𝑃 ∩ 𝒫 (𝑥𝑦))))
2019ralimia 3126 . . 3 (∀𝑥𝑃𝑦𝑃 (𝑥 = 𝑦 ∨ (𝑥𝑦) = ∅) → ∀𝑥𝑃𝑦𝑃 (𝑥𝑦) ⊆ (𝑃 ∩ 𝒫 (𝑥𝑦)))
2120adantl 485 . 2 ((𝑃𝑉 ∧ ∀𝑥𝑃𝑦𝑃 (𝑥 = 𝑦 ∨ (𝑥𝑦) = ∅)) → ∀𝑥𝑃𝑦𝑃 (𝑥𝑦) ⊆ (𝑃 ∩ 𝒫 (𝑥𝑦)))
22 isbasisg 21562 . . 3 (𝑃𝑉 → (𝑃 ∈ TopBases ↔ ∀𝑥𝑃𝑦𝑃 (𝑥𝑦) ⊆ (𝑃 ∩ 𝒫 (𝑥𝑦))))
2322adantr 484 . 2 ((𝑃𝑉 ∧ ∀𝑥𝑃𝑦𝑃 (𝑥 = 𝑦 ∨ (𝑥𝑦) = ∅)) → (𝑃 ∈ TopBases ↔ ∀𝑥𝑃𝑦𝑃 (𝑥𝑦) ⊆ (𝑃 ∩ 𝒫 (𝑥𝑦))))
2421, 23mpbird 260 1 ((𝑃𝑉 ∧ ∀𝑥𝑃𝑦𝑃 (𝑥 = 𝑦 ∨ (𝑥𝑦) = ∅)) → 𝑃 ∈ TopBases)
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 399   ∨ wo 844   = wceq 1538   ∈ wcel 2111  ∀wral 3106   ∩ cin 3880   ⊆ wss 3881  ∅c0 4243  𝒫 cpw 4497  ∪ cuni 4801  TopBasesctb 21560 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 This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ral 3111  df-rab 3115  df-v 3443  df-dif 3884  df-in 3888  df-ss 3898  df-nul 4244  df-pw 4499  df-uni 4802  df-bases 21561 This theorem is referenced by:  kelac2lem  40051
 Copyright terms: Public domain W3C validator