Theorem alexsubb 23105

Description: Biconditional form of the Alexander Subbase Theorem alexsub 23104. (Contributed by Mario Carneiro, 27-Aug-2015.)

Assertion

Ref	Expression
alexsubb	⊢ ((𝑋 ∈ UFL ∧ 𝑋 = ∪ 𝐵) → ((topGen‘(fi‘𝐵)) ∈ Comp ↔ ∀𝑥 ∈ 𝒫 𝐵(𝑋 = ∪ 𝑥 → ∃𝑦 ∈ (𝒫 𝑥 ∩ Fin)𝑋 = ∪ 𝑦)))

Distinct variable groups:   𝑥,𝑦,𝐵   𝑥,𝑋,𝑦

Proof of Theorem alexsubb

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

Step	Hyp	Ref	Expression
1		eqid 2738	. . . . 5 ⊢ ∪ (topGen‘(fi‘𝐵)) = ∪ (topGen‘(fi‘𝐵))
2	1	iscmp 22447	. . . 4 ⊢ ((topGen‘(fi‘𝐵)) ∈ Comp ↔ ((topGen‘(fi‘𝐵)) ∈ Top ∧ ∀𝑥 ∈ 𝒫 (topGen‘(fi‘𝐵))(∪ (topGen‘(fi‘𝐵)) = ∪ 𝑥 → ∃𝑦 ∈ (𝒫 𝑥 ∩ Fin)∪ (topGen‘(fi‘𝐵)) = ∪ 𝑦)))
3	2	simprbi 496	. . 3 ⊢ ((topGen‘(fi‘𝐵)) ∈ Comp → ∀𝑥 ∈ 𝒫 (topGen‘(fi‘𝐵))(∪ (topGen‘(fi‘𝐵)) = ∪ 𝑥 → ∃𝑦 ∈ (𝒫 𝑥 ∩ Fin)∪ (topGen‘(fi‘𝐵)) = ∪ 𝑦))
4		simpr 484	. . . . . . . . . . 11 ⊢ ((𝑋 ∈ UFL ∧ 𝑋 = ∪ 𝐵) → 𝑋 = ∪ 𝐵)
5		elex 3440	. . . . . . . . . . . 12 ⊢ (𝑋 ∈ UFL → 𝑋 ∈ V)
6	5	adantr 480	. . . . . . . . . . 11 ⊢ ((𝑋 ∈ UFL ∧ 𝑋 = ∪ 𝐵) → 𝑋 ∈ V)
7	4, 6	eqeltrrd 2840	. . . . . . . . . 10 ⊢ ((𝑋 ∈ UFL ∧ 𝑋 = ∪ 𝐵) → ∪ 𝐵 ∈ V)
8		uniexb 7592	. . . . . . . . . 10 ⊢ (𝐵 ∈ V ↔ ∪ 𝐵 ∈ V)
9	7, 8	sylibr 233	. . . . . . . . 9 ⊢ ((𝑋 ∈ UFL ∧ 𝑋 = ∪ 𝐵) → 𝐵 ∈ V)
10		fiuni 9117	. . . . . . . . 9 ⊢ (𝐵 ∈ V → ∪ 𝐵 = ∪ (fi‘𝐵))
11	9, 10	syl 17	. . . . . . . 8 ⊢ ((𝑋 ∈ UFL ∧ 𝑋 = ∪ 𝐵) → ∪ 𝐵 = ∪ (fi‘𝐵))
12		fibas 22035	. . . . . . . . 9 ⊢ (fi‘𝐵) ∈ TopBases
13		unitg 22025	. . . . . . . . 9 ⊢ ((fi‘𝐵) ∈ TopBases → ∪ (topGen‘(fi‘𝐵)) = ∪ (fi‘𝐵))
14	12, 13	mp1i 13	. . . . . . . 8 ⊢ ((𝑋 ∈ UFL ∧ 𝑋 = ∪ 𝐵) → ∪ (topGen‘(fi‘𝐵)) = ∪ (fi‘𝐵))
15	11, 4, 14	3eqtr4d 2788	. . . . . . 7 ⊢ ((𝑋 ∈ UFL ∧ 𝑋 = ∪ 𝐵) → 𝑋 = ∪ (topGen‘(fi‘𝐵)))
16	15	eqeq1d 2740	. . . . . 6 ⊢ ((𝑋 ∈ UFL ∧ 𝑋 = ∪ 𝐵) → (𝑋 = ∪ 𝑥 ↔ ∪ (topGen‘(fi‘𝐵)) = ∪ 𝑥))
17	15	eqeq1d 2740	. . . . . . 7 ⊢ ((𝑋 ∈ UFL ∧ 𝑋 = ∪ 𝐵) → (𝑋 = ∪ 𝑦 ↔ ∪ (topGen‘(fi‘𝐵)) = ∪ 𝑦))
18	17	rexbidv 3225	. . . . . 6 ⊢ ((𝑋 ∈ UFL ∧ 𝑋 = ∪ 𝐵) → (∃𝑦 ∈ (𝒫 𝑥 ∩ Fin)𝑋 = ∪ 𝑦 ↔ ∃𝑦 ∈ (𝒫 𝑥 ∩ Fin)∪ (topGen‘(fi‘𝐵)) = ∪ 𝑦))
19	16, 18	imbi12d 344	. . . . 5 ⊢ ((𝑋 ∈ UFL ∧ 𝑋 = ∪ 𝐵) → ((𝑋 = ∪ 𝑥 → ∃𝑦 ∈ (𝒫 𝑥 ∩ Fin)𝑋 = ∪ 𝑦) ↔ (∪ (topGen‘(fi‘𝐵)) = ∪ 𝑥 → ∃𝑦 ∈ (𝒫 𝑥 ∩ Fin)∪ (topGen‘(fi‘𝐵)) = ∪ 𝑦)))
20	19	ralbidv 3120	. . . 4 ⊢ ((𝑋 ∈ UFL ∧ 𝑋 = ∪ 𝐵) → (∀𝑥 ∈ 𝒫 (topGen‘(fi‘𝐵))(𝑋 = ∪ 𝑥 → ∃𝑦 ∈ (𝒫 𝑥 ∩ Fin)𝑋 = ∪ 𝑦) ↔ ∀𝑥 ∈ 𝒫 (topGen‘(fi‘𝐵))(∪ (topGen‘(fi‘𝐵)) = ∪ 𝑥 → ∃𝑦 ∈ (𝒫 𝑥 ∩ Fin)∪ (topGen‘(fi‘𝐵)) = ∪ 𝑦)))
21		ssfii 9108	. . . . . . . 8 ⊢ (𝐵 ∈ V → 𝐵 ⊆ (fi‘𝐵))
22	9, 21	syl 17	. . . . . . 7 ⊢ ((𝑋 ∈ UFL ∧ 𝑋 = ∪ 𝐵) → 𝐵 ⊆ (fi‘𝐵))
23		bastg 22024	. . . . . . . 8 ⊢ ((fi‘𝐵) ∈ TopBases → (fi‘𝐵) ⊆ (topGen‘(fi‘𝐵)))
24	12, 23	ax-mp 5	. . . . . . 7 ⊢ (fi‘𝐵) ⊆ (topGen‘(fi‘𝐵))
25	22, 24	sstrdi 3929	. . . . . 6 ⊢ ((𝑋 ∈ UFL ∧ 𝑋 = ∪ 𝐵) → 𝐵 ⊆ (topGen‘(fi‘𝐵)))
26	25	sspwd 4545	. . . . 5 ⊢ ((𝑋 ∈ UFL ∧ 𝑋 = ∪ 𝐵) → 𝒫 𝐵 ⊆ 𝒫 (topGen‘(fi‘𝐵)))
27		ssralv 3983	. . . . 5 ⊢ (𝒫 𝐵 ⊆ 𝒫 (topGen‘(fi‘𝐵)) → (∀𝑥 ∈ 𝒫 (topGen‘(fi‘𝐵))(𝑋 = ∪ 𝑥 → ∃𝑦 ∈ (𝒫 𝑥 ∩ Fin)𝑋 = ∪ 𝑦) → ∀𝑥 ∈ 𝒫 𝐵(𝑋 = ∪ 𝑥 → ∃𝑦 ∈ (𝒫 𝑥 ∩ Fin)𝑋 = ∪ 𝑦)))
28	26, 27	syl 17	. . . 4 ⊢ ((𝑋 ∈ UFL ∧ 𝑋 = ∪ 𝐵) → (∀𝑥 ∈ 𝒫 (topGen‘(fi‘𝐵))(𝑋 = ∪ 𝑥 → ∃𝑦 ∈ (𝒫 𝑥 ∩ Fin)𝑋 = ∪ 𝑦) → ∀𝑥 ∈ 𝒫 𝐵(𝑋 = ∪ 𝑥 → ∃𝑦 ∈ (𝒫 𝑥 ∩ Fin)𝑋 = ∪ 𝑦)))
29	20, 28	sylbird 259	. . 3 ⊢ ((𝑋 ∈ UFL ∧ 𝑋 = ∪ 𝐵) → (∀𝑥 ∈ 𝒫 (topGen‘(fi‘𝐵))(∪ (topGen‘(fi‘𝐵)) = ∪ 𝑥 → ∃𝑦 ∈ (𝒫 𝑥 ∩ Fin)∪ (topGen‘(fi‘𝐵)) = ∪ 𝑦) → ∀𝑥 ∈ 𝒫 𝐵(𝑋 = ∪ 𝑥 → ∃𝑦 ∈ (𝒫 𝑥 ∩ Fin)𝑋 = ∪ 𝑦)))
30	3, 29	syl5 34	. 2 ⊢ ((𝑋 ∈ UFL ∧ 𝑋 = ∪ 𝐵) → ((topGen‘(fi‘𝐵)) ∈ Comp → ∀𝑥 ∈ 𝒫 𝐵(𝑋 = ∪ 𝑥 → ∃𝑦 ∈ (𝒫 𝑥 ∩ Fin)𝑋 = ∪ 𝑦)))
31		simpll 763	. . . 4 ⊢ (((𝑋 ∈ UFL ∧ 𝑋 = ∪ 𝐵) ∧ ∀𝑥 ∈ 𝒫 𝐵(𝑋 = ∪ 𝑥 → ∃𝑦 ∈ (𝒫 𝑥 ∩ Fin)𝑋 = ∪ 𝑦)) → 𝑋 ∈ UFL)
32		simplr 765	. . . 4 ⊢ (((𝑋 ∈ UFL ∧ 𝑋 = ∪ 𝐵) ∧ ∀𝑥 ∈ 𝒫 𝐵(𝑋 = ∪ 𝑥 → ∃𝑦 ∈ (𝒫 𝑥 ∩ Fin)𝑋 = ∪ 𝑦)) → 𝑋 = ∪ 𝐵)
33		eqidd 2739	. . . 4 ⊢ (((𝑋 ∈ UFL ∧ 𝑋 = ∪ 𝐵) ∧ ∀𝑥 ∈ 𝒫 𝐵(𝑋 = ∪ 𝑥 → ∃𝑦 ∈ (𝒫 𝑥 ∩ Fin)𝑋 = ∪ 𝑦)) → (topGen‘(fi‘𝐵)) = (topGen‘(fi‘𝐵)))
34		velpw 4535	. . . . . . 7 ⊢ (𝑧 ∈ 𝒫 𝐵 ↔ 𝑧 ⊆ 𝐵)
35		unieq 4847	. . . . . . . . . . 11 ⊢ (𝑥 = 𝑧 → ∪ 𝑥 = ∪ 𝑧)
36	35	eqeq2d 2749	. . . . . . . . . 10 ⊢ (𝑥 = 𝑧 → (𝑋 = ∪ 𝑥 ↔ 𝑋 = ∪ 𝑧))
37		pweq 4546	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝑧 → 𝒫 𝑥 = 𝒫 𝑧)
38	37	ineq1d 4142	. . . . . . . . . . 11 ⊢ (𝑥 = 𝑧 → (𝒫 𝑥 ∩ Fin) = (𝒫 𝑧 ∩ Fin))
39	38	rexeqdv 3340	. . . . . . . . . 10 ⊢ (𝑥 = 𝑧 → (∃𝑦 ∈ (𝒫 𝑥 ∩ Fin)𝑋 = ∪ 𝑦 ↔ ∃𝑦 ∈ (𝒫 𝑧 ∩ Fin)𝑋 = ∪ 𝑦))
40	36, 39	imbi12d 344	. . . . . . . . 9 ⊢ (𝑥 = 𝑧 → ((𝑋 = ∪ 𝑥 → ∃𝑦 ∈ (𝒫 𝑥 ∩ Fin)𝑋 = ∪ 𝑦) ↔ (𝑋 = ∪ 𝑧 → ∃𝑦 ∈ (𝒫 𝑧 ∩ Fin)𝑋 = ∪ 𝑦)))
41	40	rspccv 3549	. . . . . . . 8 ⊢ (∀𝑥 ∈ 𝒫 𝐵(𝑋 = ∪ 𝑥 → ∃𝑦 ∈ (𝒫 𝑥 ∩ Fin)𝑋 = ∪ 𝑦) → (𝑧 ∈ 𝒫 𝐵 → (𝑋 = ∪ 𝑧 → ∃𝑦 ∈ (𝒫 𝑧 ∩ Fin)𝑋 = ∪ 𝑦)))
42	41	adantl 481	. . . . . . 7 ⊢ (((𝑋 ∈ UFL ∧ 𝑋 = ∪ 𝐵) ∧ ∀𝑥 ∈ 𝒫 𝐵(𝑋 = ∪ 𝑥 → ∃𝑦 ∈ (𝒫 𝑥 ∩ Fin)𝑋 = ∪ 𝑦)) → (𝑧 ∈ 𝒫 𝐵 → (𝑋 = ∪ 𝑧 → ∃𝑦 ∈ (𝒫 𝑧 ∩ Fin)𝑋 = ∪ 𝑦)))
43	34, 42	syl5bir 242	. . . . . 6 ⊢ (((𝑋 ∈ UFL ∧ 𝑋 = ∪ 𝐵) ∧ ∀𝑥 ∈ 𝒫 𝐵(𝑋 = ∪ 𝑥 → ∃𝑦 ∈ (𝒫 𝑥 ∩ Fin)𝑋 = ∪ 𝑦)) → (𝑧 ⊆ 𝐵 → (𝑋 = ∪ 𝑧 → ∃𝑦 ∈ (𝒫 𝑧 ∩ Fin)𝑋 = ∪ 𝑦)))
44	43	imp32 418	. . . . 5 ⊢ ((((𝑋 ∈ UFL ∧ 𝑋 = ∪ 𝐵) ∧ ∀𝑥 ∈ 𝒫 𝐵(𝑋 = ∪ 𝑥 → ∃𝑦 ∈ (𝒫 𝑥 ∩ Fin)𝑋 = ∪ 𝑦)) ∧ (𝑧 ⊆ 𝐵 ∧ 𝑋 = ∪ 𝑧)) → ∃𝑦 ∈ (𝒫 𝑧 ∩ Fin)𝑋 = ∪ 𝑦)
45		unieq 4847	. . . . . . 7 ⊢ (𝑦 = 𝑤 → ∪ 𝑦 = ∪ 𝑤)
46	45	eqeq2d 2749	. . . . . 6 ⊢ (𝑦 = 𝑤 → (𝑋 = ∪ 𝑦 ↔ 𝑋 = ∪ 𝑤))
47	46	cbvrexvw 3373	. . . . 5 ⊢ (∃𝑦 ∈ (𝒫 𝑧 ∩ Fin)𝑋 = ∪ 𝑦 ↔ ∃𝑤 ∈ (𝒫 𝑧 ∩ Fin)𝑋 = ∪ 𝑤)
48	44, 47	sylib 217	. . . 4 ⊢ ((((𝑋 ∈ UFL ∧ 𝑋 = ∪ 𝐵) ∧ ∀𝑥 ∈ 𝒫 𝐵(𝑋 = ∪ 𝑥 → ∃𝑦 ∈ (𝒫 𝑥 ∩ Fin)𝑋 = ∪ 𝑦)) ∧ (𝑧 ⊆ 𝐵 ∧ 𝑋 = ∪ 𝑧)) → ∃𝑤 ∈ (𝒫 𝑧 ∩ Fin)𝑋 = ∪ 𝑤)
49	31, 32, 33, 48	alexsub 23104	. . 3 ⊢ (((𝑋 ∈ UFL ∧ 𝑋 = ∪ 𝐵) ∧ ∀𝑥 ∈ 𝒫 𝐵(𝑋 = ∪ 𝑥 → ∃𝑦 ∈ (𝒫 𝑥 ∩ Fin)𝑋 = ∪ 𝑦)) → (topGen‘(fi‘𝐵)) ∈ Comp)
50	49	ex 412	. 2 ⊢ ((𝑋 ∈ UFL ∧ 𝑋 = ∪ 𝐵) → (∀𝑥 ∈ 𝒫 𝐵(𝑋 = ∪ 𝑥 → ∃𝑦 ∈ (𝒫 𝑥 ∩ Fin)𝑋 = ∪ 𝑦) → (topGen‘(fi‘𝐵)) ∈ Comp))
51	30, 50	impbid 211	1 ⊢ ((𝑋 ∈ UFL ∧ 𝑋 = ∪ 𝐵) → ((topGen‘(fi‘𝐵)) ∈ Comp ↔ ∀𝑥 ∈ 𝒫 𝐵(𝑋 = ∪ 𝑥 → ∃𝑦 ∈ (𝒫 𝑥 ∩ Fin)𝑋 = ∪ 𝑦)))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 395   = wceq 1539   ∈ wcel 2108  ∀wral 3063  ∃wrex 3064  Vcvv 3422   ∩ cin 3882   ⊆ wss 3883  𝒫 cpw 4530  ∪ cuni 4836  ‘cfv 6418  Fincfn 8691  ficfi 9099  topGenctg 17065  Topctop 21950  TopBasesctb 22003  Compccmp 22445  UFLcufl 22959

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-rep 5205  ax-sep 5218  ax-nul 5225  ax-pow 5283  ax-pr 5347  ax-un 7566

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3or 1086  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-nel 3049  df-ral 3068  df-rex 3069  df-reu 3070  df-rab 3072  df-v 3424  df-sbc 3712  df-csb 3829  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-pss 3902  df-nul 4254  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-tp 4563  df-op 4565  df-uni 4837  df-int 4877  df-iun 4923  df-iin 4924  df-br 5071  df-opab 5133  df-mpt 5154  df-tr 5188  df-id 5480  df-eprel 5486  df-po 5494  df-so 5495  df-fr 5535  df-we 5537  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-res 5592  df-ima 5593  df-ord 6254  df-on 6255  df-lim 6256  df-suc 6257  df-iota 6376  df-fun 6420  df-fn 6421  df-f 6422  df-f1 6423  df-fo 6424  df-f1o 6425  df-fv 6426  df-ov 7258  df-oprab 7259  df-mpo 7260  df-om 7688  df-1st 7804  df-2nd 7805  df-1o 8267  df-er 8456  df-en 8692  df-dom 8693  df-fin 8695  df-fi 9100  df-topgen 17071  df-fbas 20507  df-fg 20508  df-top 21951  df-topon 21968  df-bases 22004  df-cld 22078  df-ntr 22079  df-cls 22080  df-nei 22157  df-cmp 22446  df-fil 22905  df-ufil 22960  df-ufl 22961  df-flim 22998  df-fcls 23000

This theorem is referenced by: (None)