Theorem basdif0 22303

Description: A basis is not affected by the addition or removal of the empty set. (Contributed by Mario Carneiro, 28-Aug-2015.)

Assertion

Ref	Expression
basdif0	⊢ ((𝐵 ∖ {∅}) ∈ TopBases ↔ 𝐵 ∈ TopBases)

Proof of Theorem basdif0

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ssun1 4132	. . . 4 ⊢ 𝐵 ⊆ (𝐵 ∪ {∅})
2		undif1 4435	. . . 4 ⊢ ((𝐵 ∖ {∅}) ∪ {∅}) = (𝐵 ∪ {∅})
3	1, 2	sseqtrri 3981	. . 3 ⊢ 𝐵 ⊆ ((𝐵 ∖ {∅}) ∪ {∅})
4		snex 5388	. . . 4 ⊢ {∅} ∈ V
5		unexg 7683	. . . 4 ⊢ (((𝐵 ∖ {∅}) ∈ TopBases ∧ {∅} ∈ V) → ((𝐵 ∖ {∅}) ∪ {∅}) ∈ V)
6	4, 5	mpan2 689	. . 3 ⊢ ((𝐵 ∖ {∅}) ∈ TopBases → ((𝐵 ∖ {∅}) ∪ {∅}) ∈ V)
7		ssexg 5280	. . 3 ⊢ ((𝐵 ⊆ ((𝐵 ∖ {∅}) ∪ {∅}) ∧ ((𝐵 ∖ {∅}) ∪ {∅}) ∈ V) → 𝐵 ∈ V)
8	3, 6, 7	sylancr 587	. 2 ⊢ ((𝐵 ∖ {∅}) ∈ TopBases → 𝐵 ∈ V)
9		elex 3463	. 2 ⊢ (𝐵 ∈ TopBases → 𝐵 ∈ V)
10		indif1 4231	. . . . . . . . . . 11 ⊢ ((𝐵 ∖ {∅}) ∩ 𝒫 (𝑥 ∩ 𝑦)) = ((𝐵 ∩ 𝒫 (𝑥 ∩ 𝑦)) ∖ {∅})
11	10	unieqi 4878	. . . . . . . . . 10 ⊢ ∪ ((𝐵 ∖ {∅}) ∩ 𝒫 (𝑥 ∩ 𝑦)) = ∪ ((𝐵 ∩ 𝒫 (𝑥 ∩ 𝑦)) ∖ {∅})
12		unidif0 5315	. . . . . . . . . 10 ⊢ ∪ ((𝐵 ∩ 𝒫 (𝑥 ∩ 𝑦)) ∖ {∅}) = ∪ (𝐵 ∩ 𝒫 (𝑥 ∩ 𝑦))
13	11, 12	eqtri 2764	. . . . . . . . 9 ⊢ ∪ ((𝐵 ∖ {∅}) ∩ 𝒫 (𝑥 ∩ 𝑦)) = ∪ (𝐵 ∩ 𝒫 (𝑥 ∩ 𝑦))
14	13	sseq2i 3973	. . . . . . . 8 ⊢ ((𝑥 ∩ 𝑦) ⊆ ∪ ((𝐵 ∖ {∅}) ∩ 𝒫 (𝑥 ∩ 𝑦)) ↔ (𝑥 ∩ 𝑦) ⊆ ∪ (𝐵 ∩ 𝒫 (𝑥 ∩ 𝑦)))
15	14	ralbii 3096	. . . . . . 7 ⊢ (∀𝑦 ∈ (𝐵 ∖ {∅})(𝑥 ∩ 𝑦) ⊆ ∪ ((𝐵 ∖ {∅}) ∩ 𝒫 (𝑥 ∩ 𝑦)) ↔ ∀𝑦 ∈ (𝐵 ∖ {∅})(𝑥 ∩ 𝑦) ⊆ ∪ (𝐵 ∩ 𝒫 (𝑥 ∩ 𝑦)))
16		inss2 4189	. . . . . . . . . 10 ⊢ (𝑥 ∩ 𝑦) ⊆ 𝑦
17		elinel2 4156	. . . . . . . . . . . 12 ⊢ (𝑦 ∈ (𝐵 ∩ {∅}) → 𝑦 ∈ {∅})
18		elsni 4603	. . . . . . . . . . . 12 ⊢ (𝑦 ∈ {∅} → 𝑦 = ∅)
19	17, 18	syl 17	. . . . . . . . . . 11 ⊢ (𝑦 ∈ (𝐵 ∩ {∅}) → 𝑦 = ∅)
20		0ss 4356	. . . . . . . . . . 11 ⊢ ∅ ⊆ ∪ (𝐵 ∩ 𝒫 (𝑥 ∩ 𝑦))
21	19, 20	eqsstrdi 3998	. . . . . . . . . 10 ⊢ (𝑦 ∈ (𝐵 ∩ {∅}) → 𝑦 ⊆ ∪ (𝐵 ∩ 𝒫 (𝑥 ∩ 𝑦)))
22	16, 21	sstrid 3955	. . . . . . . . 9 ⊢ (𝑦 ∈ (𝐵 ∩ {∅}) → (𝑥 ∩ 𝑦) ⊆ ∪ (𝐵 ∩ 𝒫 (𝑥 ∩ 𝑦)))
23	22	rgen 3066	. . . . . . . 8 ⊢ ∀𝑦 ∈ (𝐵 ∩ {∅})(𝑥 ∩ 𝑦) ⊆ ∪ (𝐵 ∩ 𝒫 (𝑥 ∩ 𝑦))
24		ralunb 4151	. . . . . . . 8 ⊢ (∀𝑦 ∈ ((𝐵 ∩ {∅}) ∪ (𝐵 ∖ {∅}))(𝑥 ∩ 𝑦) ⊆ ∪ (𝐵 ∩ 𝒫 (𝑥 ∩ 𝑦)) ↔ (∀𝑦 ∈ (𝐵 ∩ {∅})(𝑥 ∩ 𝑦) ⊆ ∪ (𝐵 ∩ 𝒫 (𝑥 ∩ 𝑦)) ∧ ∀𝑦 ∈ (𝐵 ∖ {∅})(𝑥 ∩ 𝑦) ⊆ ∪ (𝐵 ∩ 𝒫 (𝑥 ∩ 𝑦))))
25	23, 24	mpbiran 707	. . . . . . 7 ⊢ (∀𝑦 ∈ ((𝐵 ∩ {∅}) ∪ (𝐵 ∖ {∅}))(𝑥 ∩ 𝑦) ⊆ ∪ (𝐵 ∩ 𝒫 (𝑥 ∩ 𝑦)) ↔ ∀𝑦 ∈ (𝐵 ∖ {∅})(𝑥 ∩ 𝑦) ⊆ ∪ (𝐵 ∩ 𝒫 (𝑥 ∩ 𝑦)))
26		inundif 4438	. . . . . . . 8 ⊢ ((𝐵 ∩ {∅}) ∪ (𝐵 ∖ {∅})) = 𝐵
27	26	raleqi 3311	. . . . . . 7 ⊢ (∀𝑦 ∈ ((𝐵 ∩ {∅}) ∪ (𝐵 ∖ {∅}))(𝑥 ∩ 𝑦) ⊆ ∪ (𝐵 ∩ 𝒫 (𝑥 ∩ 𝑦)) ↔ ∀𝑦 ∈ 𝐵 (𝑥 ∩ 𝑦) ⊆ ∪ (𝐵 ∩ 𝒫 (𝑥 ∩ 𝑦)))
28	15, 25, 27	3bitr2i 298	. . . . . 6 ⊢ (∀𝑦 ∈ (𝐵 ∖ {∅})(𝑥 ∩ 𝑦) ⊆ ∪ ((𝐵 ∖ {∅}) ∩ 𝒫 (𝑥 ∩ 𝑦)) ↔ ∀𝑦 ∈ 𝐵 (𝑥 ∩ 𝑦) ⊆ ∪ (𝐵 ∩ 𝒫 (𝑥 ∩ 𝑦)))
29	28	ralbii 3096	. . . . 5 ⊢ (∀𝑥 ∈ (𝐵 ∖ {∅})∀𝑦 ∈ (𝐵 ∖ {∅})(𝑥 ∩ 𝑦) ⊆ ∪ ((𝐵 ∖ {∅}) ∩ 𝒫 (𝑥 ∩ 𝑦)) ↔ ∀𝑥 ∈ (𝐵 ∖ {∅})∀𝑦 ∈ 𝐵 (𝑥 ∩ 𝑦) ⊆ ∪ (𝐵 ∩ 𝒫 (𝑥 ∩ 𝑦)))
30		inss1 4188	. . . . . . . . 9 ⊢ (𝑥 ∩ 𝑦) ⊆ 𝑥
31		elinel2 4156	. . . . . . . . . . 11 ⊢ (𝑥 ∈ (𝐵 ∩ {∅}) → 𝑥 ∈ {∅})
32		elsni 4603	. . . . . . . . . . 11 ⊢ (𝑥 ∈ {∅} → 𝑥 = ∅)
33	31, 32	syl 17	. . . . . . . . . 10 ⊢ (𝑥 ∈ (𝐵 ∩ {∅}) → 𝑥 = ∅)
34	33, 20	eqsstrdi 3998	. . . . . . . . 9 ⊢ (𝑥 ∈ (𝐵 ∩ {∅}) → 𝑥 ⊆ ∪ (𝐵 ∩ 𝒫 (𝑥 ∩ 𝑦)))
35	30, 34	sstrid 3955	. . . . . . . 8 ⊢ (𝑥 ∈ (𝐵 ∩ {∅}) → (𝑥 ∩ 𝑦) ⊆ ∪ (𝐵 ∩ 𝒫 (𝑥 ∩ 𝑦)))
36	35	ralrimivw 3147	. . . . . . 7 ⊢ (𝑥 ∈ (𝐵 ∩ {∅}) → ∀𝑦 ∈ 𝐵 (𝑥 ∩ 𝑦) ⊆ ∪ (𝐵 ∩ 𝒫 (𝑥 ∩ 𝑦)))
37	36	rgen 3066	. . . . . 6 ⊢ ∀𝑥 ∈ (𝐵 ∩ {∅})∀𝑦 ∈ 𝐵 (𝑥 ∩ 𝑦) ⊆ ∪ (𝐵 ∩ 𝒫 (𝑥 ∩ 𝑦))
38		ralunb 4151	. . . . . 6 ⊢ (∀𝑥 ∈ ((𝐵 ∩ {∅}) ∪ (𝐵 ∖ {∅}))∀𝑦 ∈ 𝐵 (𝑥 ∩ 𝑦) ⊆ ∪ (𝐵 ∩ 𝒫 (𝑥 ∩ 𝑦)) ↔ (∀𝑥 ∈ (𝐵 ∩ {∅})∀𝑦 ∈ 𝐵 (𝑥 ∩ 𝑦) ⊆ ∪ (𝐵 ∩ 𝒫 (𝑥 ∩ 𝑦)) ∧ ∀𝑥 ∈ (𝐵 ∖ {∅})∀𝑦 ∈ 𝐵 (𝑥 ∩ 𝑦) ⊆ ∪ (𝐵 ∩ 𝒫 (𝑥 ∩ 𝑦))))
39	37, 38	mpbiran 707	. . . . 5 ⊢ (∀𝑥 ∈ ((𝐵 ∩ {∅}) ∪ (𝐵 ∖ {∅}))∀𝑦 ∈ 𝐵 (𝑥 ∩ 𝑦) ⊆ ∪ (𝐵 ∩ 𝒫 (𝑥 ∩ 𝑦)) ↔ ∀𝑥 ∈ (𝐵 ∖ {∅})∀𝑦 ∈ 𝐵 (𝑥 ∩ 𝑦) ⊆ ∪ (𝐵 ∩ 𝒫 (𝑥 ∩ 𝑦)))
40	26	raleqi 3311	. . . . 5 ⊢ (∀𝑥 ∈ ((𝐵 ∩ {∅}) ∪ (𝐵 ∖ {∅}))∀𝑦 ∈ 𝐵 (𝑥 ∩ 𝑦) ⊆ ∪ (𝐵 ∩ 𝒫 (𝑥 ∩ 𝑦)) ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥 ∩ 𝑦) ⊆ ∪ (𝐵 ∩ 𝒫 (𝑥 ∩ 𝑦)))
41	29, 39, 40	3bitr2i 298	. . . 4 ⊢ (∀𝑥 ∈ (𝐵 ∖ {∅})∀𝑦 ∈ (𝐵 ∖ {∅})(𝑥 ∩ 𝑦) ⊆ ∪ ((𝐵 ∖ {∅}) ∩ 𝒫 (𝑥 ∩ 𝑦)) ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥 ∩ 𝑦) ⊆ ∪ (𝐵 ∩ 𝒫 (𝑥 ∩ 𝑦)))
42	41	a1i 11	. . 3 ⊢ (𝐵 ∈ V → (∀𝑥 ∈ (𝐵 ∖ {∅})∀𝑦 ∈ (𝐵 ∖ {∅})(𝑥 ∩ 𝑦) ⊆ ∪ ((𝐵 ∖ {∅}) ∩ 𝒫 (𝑥 ∩ 𝑦)) ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥 ∩ 𝑦) ⊆ ∪ (𝐵 ∩ 𝒫 (𝑥 ∩ 𝑦))))
43		difexg 5284	. . . 4 ⊢ (𝐵 ∈ V → (𝐵 ∖ {∅}) ∈ V)
44		isbasisg 22297	. . . 4 ⊢ ((𝐵 ∖ {∅}) ∈ V → ((𝐵 ∖ {∅}) ∈ TopBases ↔ ∀𝑥 ∈ (𝐵 ∖ {∅})∀𝑦 ∈ (𝐵 ∖ {∅})(𝑥 ∩ 𝑦) ⊆ ∪ ((𝐵 ∖ {∅}) ∩ 𝒫 (𝑥 ∩ 𝑦))))
45	43, 44	syl 17	. . 3 ⊢ (𝐵 ∈ V → ((𝐵 ∖ {∅}) ∈ TopBases ↔ ∀𝑥 ∈ (𝐵 ∖ {∅})∀𝑦 ∈ (𝐵 ∖ {∅})(𝑥 ∩ 𝑦) ⊆ ∪ ((𝐵 ∖ {∅}) ∩ 𝒫 (𝑥 ∩ 𝑦))))
46		isbasisg 22297	. . 3 ⊢ (𝐵 ∈ V → (𝐵 ∈ TopBases ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥 ∩ 𝑦) ⊆ ∪ (𝐵 ∩ 𝒫 (𝑥 ∩ 𝑦))))
47	42, 45, 46	3bitr4d 310	. 2 ⊢ (𝐵 ∈ V → ((𝐵 ∖ {∅}) ∈ TopBases ↔ 𝐵 ∈ TopBases))
48	8, 9, 47	pm5.21nii 379	1 ⊢ ((𝐵 ∖ {∅}) ∈ TopBases ↔ 𝐵 ∈ TopBases)

Syntax hints:   ↔ wb 205   = wceq 1541   ∈ wcel 2106  ∀wral 3064  Vcvv 3445   ∖ cdif 3907   ∪ cun 3908   ∩ cin 3909   ⊆ wss 3910  ∅c0 4282  𝒫 cpw 4560  {csn 4586  ∪ cuni 4865  TopBasesctb 22295

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 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-ext 2707  ax-sep 5256  ax-nul 5263  ax-pr 5384  ax-un 7672

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-tru 1544  df-fal 1554  df-ex 1782  df-sb 2068  df-clab 2714  df-cleq 2728  df-clel 2814  df-ral 3065  df-rab 3408  df-v 3447  df-dif 3913  df-un 3915  df-in 3917  df-ss 3927  df-nul 4283  df-sn 4587  df-pr 4589  df-uni 4866  df-bases 22296

This theorem is referenced by: (None)