Theorem basis2 23089

Description: Property of a basis. (Contributed by NM, 17-Jul-2006.)

Assertion

Ref	Expression
basis2	⊢ (((𝐵 ∈ TopBases ∧ 𝐶 ∈ 𝐵) ∧ (𝐷 ∈ 𝐵 ∧ 𝐴 ∈ (𝐶 ∩ 𝐷))) → ∃𝑥 ∈ 𝐵 (𝐴 ∈ 𝑥 ∧ 𝑥 ⊆ (𝐶 ∩ 𝐷)))

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝑥,𝐶   𝑥,𝐷

Proof of Theorem basis2

Dummy variables 𝑤 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		isbasis2g 23086	. . . . 5 ⊢ (𝐵 ∈ TopBases → (𝐵 ∈ TopBases ↔ ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ∀𝑤 ∈ (𝑦 ∩ 𝑧)∃𝑥 ∈ 𝐵 (𝑤 ∈ 𝑥 ∧ 𝑥 ⊆ (𝑦 ∩ 𝑧))))
2	1	ibi 270	. . . 4 ⊢ (𝐵 ∈ TopBases → ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ∀𝑤 ∈ (𝑦 ∩ 𝑧)∃𝑥 ∈ 𝐵 (𝑤 ∈ 𝑥 ∧ 𝑥 ⊆ (𝑦 ∩ 𝑧)))
3		ineq1 4167	. . . . . . 7 ⊢ (𝑦 = 𝐶 → (𝑦 ∩ 𝑧) = (𝐶 ∩ 𝑧))
4		sseq2 3964	. . . . . . . . . 10 ⊢ ((𝑦 ∩ 𝑧) = (𝐶 ∩ 𝑧) → (𝑥 ⊆ (𝑦 ∩ 𝑧) ↔ 𝑥 ⊆ (𝐶 ∩ 𝑧)))
5	4	anbi2d 641	. . . . . . . . 9 ⊢ ((𝑦 ∩ 𝑧) = (𝐶 ∩ 𝑧) → ((𝑤 ∈ 𝑥 ∧ 𝑥 ⊆ (𝑦 ∩ 𝑧)) ↔ (𝑤 ∈ 𝑥 ∧ 𝑥 ⊆ (𝐶 ∩ 𝑧))))
6	5	rexbidv 3189	. . . . . . . 8 ⊢ ((𝑦 ∩ 𝑧) = (𝐶 ∩ 𝑧) → (∃𝑥 ∈ 𝐵 (𝑤 ∈ 𝑥 ∧ 𝑥 ⊆ (𝑦 ∩ 𝑧)) ↔ ∃𝑥 ∈ 𝐵 (𝑤 ∈ 𝑥 ∧ 𝑥 ⊆ (𝐶 ∩ 𝑧))))
7	6	raleqbi1dv 3333	. . . . . . 7 ⊢ ((𝑦 ∩ 𝑧) = (𝐶 ∩ 𝑧) → (∀𝑤 ∈ (𝑦 ∩ 𝑧)∃𝑥 ∈ 𝐵 (𝑤 ∈ 𝑥 ∧ 𝑥 ⊆ (𝑦 ∩ 𝑧)) ↔ ∀𝑤 ∈ (𝐶 ∩ 𝑧)∃𝑥 ∈ 𝐵 (𝑤 ∈ 𝑥 ∧ 𝑥 ⊆ (𝐶 ∩ 𝑧))))
8	3, 7	syl 18	. . . . . 6 ⊢ (𝑦 = 𝐶 → (∀𝑤 ∈ (𝑦 ∩ 𝑧)∃𝑥 ∈ 𝐵 (𝑤 ∈ 𝑥 ∧ 𝑥 ⊆ (𝑦 ∩ 𝑧)) ↔ ∀𝑤 ∈ (𝐶 ∩ 𝑧)∃𝑥 ∈ 𝐵 (𝑤 ∈ 𝑥 ∧ 𝑥 ⊆ (𝐶 ∩ 𝑧))))
9		ineq2 4168	. . . . . . 7 ⊢ (𝑧 = 𝐷 → (𝐶 ∩ 𝑧) = (𝐶 ∩ 𝐷))
10		sseq2 3964	. . . . . . . . . 10 ⊢ ((𝐶 ∩ 𝑧) = (𝐶 ∩ 𝐷) → (𝑥 ⊆ (𝐶 ∩ 𝑧) ↔ 𝑥 ⊆ (𝐶 ∩ 𝐷)))
11	10	anbi2d 641	. . . . . . . . 9 ⊢ ((𝐶 ∩ 𝑧) = (𝐶 ∩ 𝐷) → ((𝑤 ∈ 𝑥 ∧ 𝑥 ⊆ (𝐶 ∩ 𝑧)) ↔ (𝑤 ∈ 𝑥 ∧ 𝑥 ⊆ (𝐶 ∩ 𝐷))))
12	11	rexbidv 3189	. . . . . . . 8 ⊢ ((𝐶 ∩ 𝑧) = (𝐶 ∩ 𝐷) → (∃𝑥 ∈ 𝐵 (𝑤 ∈ 𝑥 ∧ 𝑥 ⊆ (𝐶 ∩ 𝑧)) ↔ ∃𝑥 ∈ 𝐵 (𝑤 ∈ 𝑥 ∧ 𝑥 ⊆ (𝐶 ∩ 𝐷))))
13	12	raleqbi1dv 3333	. . . . . . 7 ⊢ ((𝐶 ∩ 𝑧) = (𝐶 ∩ 𝐷) → (∀𝑤 ∈ (𝐶 ∩ 𝑧)∃𝑥 ∈ 𝐵 (𝑤 ∈ 𝑥 ∧ 𝑥 ⊆ (𝐶 ∩ 𝑧)) ↔ ∀𝑤 ∈ (𝐶 ∩ 𝐷)∃𝑥 ∈ 𝐵 (𝑤 ∈ 𝑥 ∧ 𝑥 ⊆ (𝐶 ∩ 𝐷))))
14	9, 13	syl 18	. . . . . 6 ⊢ (𝑧 = 𝐷 → (∀𝑤 ∈ (𝐶 ∩ 𝑧)∃𝑥 ∈ 𝐵 (𝑤 ∈ 𝑥 ∧ 𝑥 ⊆ (𝐶 ∩ 𝑧)) ↔ ∀𝑤 ∈ (𝐶 ∩ 𝐷)∃𝑥 ∈ 𝐵 (𝑤 ∈ 𝑥 ∧ 𝑥 ⊆ (𝐶 ∩ 𝐷))))
15	8, 14	rspc2v 3593	. . . . 5 ⊢ ((𝐶 ∈ 𝐵 ∧ 𝐷 ∈ 𝐵) → (∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ∀𝑤 ∈ (𝑦 ∩ 𝑧)∃𝑥 ∈ 𝐵 (𝑤 ∈ 𝑥 ∧ 𝑥 ⊆ (𝑦 ∩ 𝑧)) → ∀𝑤 ∈ (𝐶 ∩ 𝐷)∃𝑥 ∈ 𝐵 (𝑤 ∈ 𝑥 ∧ 𝑥 ⊆ (𝐶 ∩ 𝐷))))
16		eleq1 2851	. . . . . . . 8 ⊢ (𝑤 = 𝐴 → (𝑤 ∈ 𝑥 ↔ 𝐴 ∈ 𝑥))
17	16	anbi1d 642	. . . . . . 7 ⊢ (𝑤 = 𝐴 → ((𝑤 ∈ 𝑥 ∧ 𝑥 ⊆ (𝐶 ∩ 𝐷)) ↔ (𝐴 ∈ 𝑥 ∧ 𝑥 ⊆ (𝐶 ∩ 𝐷))))
18	17	rexbidv 3189	. . . . . 6 ⊢ (𝑤 = 𝐴 → (∃𝑥 ∈ 𝐵 (𝑤 ∈ 𝑥 ∧ 𝑥 ⊆ (𝐶 ∩ 𝐷)) ↔ ∃𝑥 ∈ 𝐵 (𝐴 ∈ 𝑥 ∧ 𝑥 ⊆ (𝐶 ∩ 𝐷))))
19	18	rspccv 3579	. . . . 5 ⊢ (∀𝑤 ∈ (𝐶 ∩ 𝐷)∃𝑥 ∈ 𝐵 (𝑤 ∈ 𝑥 ∧ 𝑥 ⊆ (𝐶 ∩ 𝐷)) → (𝐴 ∈ (𝐶 ∩ 𝐷) → ∃𝑥 ∈ 𝐵 (𝐴 ∈ 𝑥 ∧ 𝑥 ⊆ (𝐶 ∩ 𝐷))))
20	15, 19	syl6com 38	. . . 4 ⊢ (∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ∀𝑤 ∈ (𝑦 ∩ 𝑧)∃𝑥 ∈ 𝐵 (𝑤 ∈ 𝑥 ∧ 𝑥 ⊆ (𝑦 ∩ 𝑧)) → ((𝐶 ∈ 𝐵 ∧ 𝐷 ∈ 𝐵) → (𝐴 ∈ (𝐶 ∩ 𝐷) → ∃𝑥 ∈ 𝐵 (𝐴 ∈ 𝑥 ∧ 𝑥 ⊆ (𝐶 ∩ 𝐷)))))
21	2, 20	syl 18	. . 3 ⊢ (𝐵 ∈ TopBases → ((𝐶 ∈ 𝐵 ∧ 𝐷 ∈ 𝐵) → (𝐴 ∈ (𝐶 ∩ 𝐷) → ∃𝑥 ∈ 𝐵 (𝐴 ∈ 𝑥 ∧ 𝑥 ⊆ (𝐶 ∩ 𝐷)))))
22	21	expd 420	. 2 ⊢ (𝐵 ∈ TopBases → (𝐶 ∈ 𝐵 → (𝐷 ∈ 𝐵 → (𝐴 ∈ (𝐶 ∩ 𝐷) → ∃𝑥 ∈ 𝐵 (𝐴 ∈ 𝑥 ∧ 𝑥 ⊆ (𝐶 ∩ 𝐷))))))
23	22	imp43 432	1 ⊢ (((𝐵 ∈ TopBases ∧ 𝐶 ∈ 𝐵) ∧ (𝐷 ∈ 𝐵 ∧ 𝐴 ∈ (𝐶 ∩ 𝐷))) → ∃𝑥 ∈ 𝐵 (𝐴 ∈ 𝑥 ∧ 𝑥 ⊆ (𝐶 ∩ 𝐷)))

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 400   = wceq 1570   ∈ wcel 2143  ∀wral 3079  ∃wrex 3089   ∩ cin 3905   ⊆ wss 3906  TopBasesctb 23083

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-ext 2735

This theorem depends on definitions:  df-bi 210  df-an 401  df-tru 1573  df-ex 1810  df-sb 2097  df-clab 2742  df-cleq 2755  df-clel 2838  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-in 3913  df-ss 3923  df-pw 4565  df-uni 4874  df-bases 23084

This theorem is referenced by:  tgcl  23107  restbas  23296  txbas  23705  basqtop  23849  tgioo  24934