Theorem tgidm 14885

Description: The topology generator function is idempotent. (Contributed by NM, 18-Jul-2006.) (Revised by Mario Carneiro, 2-Sep-2015.)

Assertion

Ref	Expression
tgidm	⊢ (𝐵 ∈ 𝑉 → (topGen‘(topGen‘𝐵)) = (topGen‘𝐵))

Proof of Theorem tgidm

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

Step	Hyp	Ref	Expression
1		tgvalex 13426	. . . . 5 ⊢ (𝐵 ∈ 𝑉 → (topGen‘𝐵) ∈ V)
2		eltg3 14868	. . . . 5 ⊢ ((topGen‘𝐵) ∈ V → (𝑥 ∈ (topGen‘(topGen‘𝐵)) ↔ ∃𝑦(𝑦 ⊆ (topGen‘𝐵) ∧ 𝑥 = ∪ 𝑦)))
3	1, 2	syl 14	. . . 4 ⊢ (𝐵 ∈ 𝑉 → (𝑥 ∈ (topGen‘(topGen‘𝐵)) ↔ ∃𝑦(𝑦 ⊆ (topGen‘𝐵) ∧ 𝑥 = ∪ 𝑦)))
4		uniiun 4029	. . . . . . . . . 10 ⊢ ∪ 𝑦 = ∪ 𝑧 ∈ 𝑦 𝑧
5		simpr 110	. . . . . . . . . . . . 13 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝑦 ⊆ (topGen‘𝐵)) → 𝑦 ⊆ (topGen‘𝐵))
6	5	sselda 3228	. . . . . . . . . . . 12 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝑦 ⊆ (topGen‘𝐵)) ∧ 𝑧 ∈ 𝑦) → 𝑧 ∈ (topGen‘𝐵))
7		eltg4i 14866	. . . . . . . . . . . 12 ⊢ (𝑧 ∈ (topGen‘𝐵) → 𝑧 = ∪ (𝐵 ∩ 𝒫 𝑧))
8	6, 7	syl 14	. . . . . . . . . . 11 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝑦 ⊆ (topGen‘𝐵)) ∧ 𝑧 ∈ 𝑦) → 𝑧 = ∪ (𝐵 ∩ 𝒫 𝑧))
9	8	iuneq2dv 3996	. . . . . . . . . 10 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝑦 ⊆ (topGen‘𝐵)) → ∪ 𝑧 ∈ 𝑦 𝑧 = ∪ 𝑧 ∈ 𝑦 ∪ (𝐵 ∩ 𝒫 𝑧))
10	4, 9	eqtrid 2276	. . . . . . . . 9 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝑦 ⊆ (topGen‘𝐵)) → ∪ 𝑦 = ∪ 𝑧 ∈ 𝑦 ∪ (𝐵 ∩ 𝒫 𝑧))
11		iuncom4 3982	. . . . . . . . 9 ⊢ ∪ 𝑧 ∈ 𝑦 ∪ (𝐵 ∩ 𝒫 𝑧) = ∪ ∪ 𝑧 ∈ 𝑦 (𝐵 ∩ 𝒫 𝑧)
12	10, 11	eqtrdi 2280	. . . . . . . 8 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝑦 ⊆ (topGen‘𝐵)) → ∪ 𝑦 = ∪ ∪ 𝑧 ∈ 𝑦 (𝐵 ∩ 𝒫 𝑧))
13		inss1 3429	. . . . . . . . . . . 12 ⊢ (𝐵 ∩ 𝒫 𝑧) ⊆ 𝐵
14	13	rgenw 2588	. . . . . . . . . . 11 ⊢ ∀𝑧 ∈ 𝑦 (𝐵 ∩ 𝒫 𝑧) ⊆ 𝐵
15		iunss 4016	. . . . . . . . . . 11 ⊢ (∪ 𝑧 ∈ 𝑦 (𝐵 ∩ 𝒫 𝑧) ⊆ 𝐵 ↔ ∀𝑧 ∈ 𝑦 (𝐵 ∩ 𝒫 𝑧) ⊆ 𝐵)
16	14, 15	mpbir 146	. . . . . . . . . 10 ⊢ ∪ 𝑧 ∈ 𝑦 (𝐵 ∩ 𝒫 𝑧) ⊆ 𝐵
17	16	a1i 9	. . . . . . . . 9 ⊢ (𝑦 ⊆ (topGen‘𝐵) → ∪ 𝑧 ∈ 𝑦 (𝐵 ∩ 𝒫 𝑧) ⊆ 𝐵)
18		eltg3i 14867	. . . . . . . . 9 ⊢ ((𝐵 ∈ 𝑉 ∧ ∪ 𝑧 ∈ 𝑦 (𝐵 ∩ 𝒫 𝑧) ⊆ 𝐵) → ∪ ∪ 𝑧 ∈ 𝑦 (𝐵 ∩ 𝒫 𝑧) ∈ (topGen‘𝐵))
19	17, 18	sylan2 286	. . . . . . . 8 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝑦 ⊆ (topGen‘𝐵)) → ∪ ∪ 𝑧 ∈ 𝑦 (𝐵 ∩ 𝒫 𝑧) ∈ (topGen‘𝐵))
20	12, 19	eqeltrd 2308	. . . . . . 7 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝑦 ⊆ (topGen‘𝐵)) → ∪ 𝑦 ∈ (topGen‘𝐵))
21		eleq1 2294	. . . . . . 7 ⊢ (𝑥 = ∪ 𝑦 → (𝑥 ∈ (topGen‘𝐵) ↔ ∪ 𝑦 ∈ (topGen‘𝐵)))
22	20, 21	syl5ibrcom 157	. . . . . 6 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝑦 ⊆ (topGen‘𝐵)) → (𝑥 = ∪ 𝑦 → 𝑥 ∈ (topGen‘𝐵)))
23	22	expimpd 363	. . . . 5 ⊢ (𝐵 ∈ 𝑉 → ((𝑦 ⊆ (topGen‘𝐵) ∧ 𝑥 = ∪ 𝑦) → 𝑥 ∈ (topGen‘𝐵)))
24	23	exlimdv 1867	. . . 4 ⊢ (𝐵 ∈ 𝑉 → (∃𝑦(𝑦 ⊆ (topGen‘𝐵) ∧ 𝑥 = ∪ 𝑦) → 𝑥 ∈ (topGen‘𝐵)))
25	3, 24	sylbid 150	. . 3 ⊢ (𝐵 ∈ 𝑉 → (𝑥 ∈ (topGen‘(topGen‘𝐵)) → 𝑥 ∈ (topGen‘𝐵)))
26	25	ssrdv 3234	. 2 ⊢ (𝐵 ∈ 𝑉 → (topGen‘(topGen‘𝐵)) ⊆ (topGen‘𝐵))
27		bastg 14872	. . 3 ⊢ (𝐵 ∈ 𝑉 → 𝐵 ⊆ (topGen‘𝐵))
28		tgss 14874	. . 3 ⊢ (((topGen‘𝐵) ∈ V ∧ 𝐵 ⊆ (topGen‘𝐵)) → (topGen‘𝐵) ⊆ (topGen‘(topGen‘𝐵)))
29	1, 27, 28	syl2anc 411	. 2 ⊢ (𝐵 ∈ 𝑉 → (topGen‘𝐵) ⊆ (topGen‘(topGen‘𝐵)))
30	26, 29	eqssd 3245	1 ⊢ (𝐵 ∈ 𝑉 → (topGen‘(topGen‘𝐵)) = (topGen‘𝐵))

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1398  ∃wex 1541   ∈ wcel 2202  ∀wral 2511  Vcvv 2803   ∩ cin 3200   ⊆ wss 3201  𝒫 cpw 3656  ∪ cuni 3898  ∪ ciun 3975  ‘cfv 5333  topGenctg 13417

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4212  ax-pow 4270  ax-pr 4305  ax-un 4536

This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ral 2516  df-rex 2517  df-v 2805  df-sbc 3033  df-un 3205  df-in 3207  df-ss 3214  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-iun 3977  df-br 4094  df-opab 4156  df-mpt 4157  df-id 4396  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-iota 5293  df-fun 5335  df-fv 5341  df-topgen 13423

This theorem is referenced by:  tgss3  14889  txbasval  15078