Theorem tgss2 13549

Description: A criterion for determining whether one topology is finer than another, based on a comparison of their bases. Lemma 2.2 of [Munkres] p. 80. (Contributed by NM, 20-Jul-2006.) (Proof shortened by Mario Carneiro, 2-Sep-2015.)

Assertion

Ref	Expression
tgss2	⊢ ((𝐵 ∈ 𝑉 ∧ ∪ 𝐵 = ∪ 𝐶) → ((topGen‘𝐵) ⊆ (topGen‘𝐶) ↔ ∀𝑥 ∈ ∪ 𝐵∀𝑦 ∈ 𝐵 (𝑥 ∈ 𝑦 → ∃𝑧 ∈ 𝐶 (𝑥 ∈ 𝑧 ∧ 𝑧 ⊆ 𝑦))))

Distinct variable groups:   𝑥,𝑦,𝑧,𝐵   𝑥,𝐶,𝑦,𝑧   𝑥,𝑉,𝑦

Allowed substitution hint:   𝑉(𝑧)

Proof of Theorem tgss2

Step	Hyp	Ref	Expression
1		simpr 110	. . . . 5 ⊢ ((𝐵 ∈ 𝑉 ∧ ∪ 𝐵 = ∪ 𝐶) → ∪ 𝐵 = ∪ 𝐶)
2		uniexg 4439	. . . . . 6 ⊢ (𝐵 ∈ 𝑉 → ∪ 𝐵 ∈ V)
3	2	adantr 276	. . . . 5 ⊢ ((𝐵 ∈ 𝑉 ∧ ∪ 𝐵 = ∪ 𝐶) → ∪ 𝐵 ∈ V)
4	1, 3	eqeltrrd 2255	. . . 4 ⊢ ((𝐵 ∈ 𝑉 ∧ ∪ 𝐵 = ∪ 𝐶) → ∪ 𝐶 ∈ V)
5		uniexb 4473	. . . 4 ⊢ (𝐶 ∈ V ↔ ∪ 𝐶 ∈ V)
6	4, 5	sylibr 134	. . 3 ⊢ ((𝐵 ∈ 𝑉 ∧ ∪ 𝐵 = ∪ 𝐶) → 𝐶 ∈ V)
7		tgss3 13548	. . 3 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐶 ∈ V) → ((topGen‘𝐵) ⊆ (topGen‘𝐶) ↔ 𝐵 ⊆ (topGen‘𝐶)))
8	6, 7	syldan 282	. 2 ⊢ ((𝐵 ∈ 𝑉 ∧ ∪ 𝐵 = ∪ 𝐶) → ((topGen‘𝐵) ⊆ (topGen‘𝐶) ↔ 𝐵 ⊆ (topGen‘𝐶)))
9		eltg2b 13524	. . . . . . 7 ⊢ (𝐶 ∈ V → (𝑦 ∈ (topGen‘𝐶) ↔ ∀𝑥 ∈ 𝑦 ∃𝑧 ∈ 𝐶 (𝑥 ∈ 𝑧 ∧ 𝑧 ⊆ 𝑦)))
10	6, 9	syl 14	. . . . . 6 ⊢ ((𝐵 ∈ 𝑉 ∧ ∪ 𝐵 = ∪ 𝐶) → (𝑦 ∈ (topGen‘𝐶) ↔ ∀𝑥 ∈ 𝑦 ∃𝑧 ∈ 𝐶 (𝑥 ∈ 𝑧 ∧ 𝑧 ⊆ 𝑦)))
11		elunii 3814	. . . . . . . . 9 ⊢ ((𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝐵) → 𝑥 ∈ ∪ 𝐵)
12	11	ancoms 268	. . . . . . . 8 ⊢ ((𝑦 ∈ 𝐵 ∧ 𝑥 ∈ 𝑦) → 𝑥 ∈ ∪ 𝐵)
13		biimt 241	. . . . . . . 8 ⊢ (𝑥 ∈ ∪ 𝐵 → (∃𝑧 ∈ 𝐶 (𝑥 ∈ 𝑧 ∧ 𝑧 ⊆ 𝑦) ↔ (𝑥 ∈ ∪ 𝐵 → ∃𝑧 ∈ 𝐶 (𝑥 ∈ 𝑧 ∧ 𝑧 ⊆ 𝑦))))
14	12, 13	syl 14	. . . . . . 7 ⊢ ((𝑦 ∈ 𝐵 ∧ 𝑥 ∈ 𝑦) → (∃𝑧 ∈ 𝐶 (𝑥 ∈ 𝑧 ∧ 𝑧 ⊆ 𝑦) ↔ (𝑥 ∈ ∪ 𝐵 → ∃𝑧 ∈ 𝐶 (𝑥 ∈ 𝑧 ∧ 𝑧 ⊆ 𝑦))))
15	14	ralbidva 2473	. . . . . 6 ⊢ (𝑦 ∈ 𝐵 → (∀𝑥 ∈ 𝑦 ∃𝑧 ∈ 𝐶 (𝑥 ∈ 𝑧 ∧ 𝑧 ⊆ 𝑦) ↔ ∀𝑥 ∈ 𝑦 (𝑥 ∈ ∪ 𝐵 → ∃𝑧 ∈ 𝐶 (𝑥 ∈ 𝑧 ∧ 𝑧 ⊆ 𝑦))))
16	10, 15	sylan9bb 462	. . . . 5 ⊢ (((𝐵 ∈ 𝑉 ∧ ∪ 𝐵 = ∪ 𝐶) ∧ 𝑦 ∈ 𝐵) → (𝑦 ∈ (topGen‘𝐶) ↔ ∀𝑥 ∈ 𝑦 (𝑥 ∈ ∪ 𝐵 → ∃𝑧 ∈ 𝐶 (𝑥 ∈ 𝑧 ∧ 𝑧 ⊆ 𝑦))))
17		ralcom3 2644	. . . . 5 ⊢ (∀𝑥 ∈ 𝑦 (𝑥 ∈ ∪ 𝐵 → ∃𝑧 ∈ 𝐶 (𝑥 ∈ 𝑧 ∧ 𝑧 ⊆ 𝑦)) ↔ ∀𝑥 ∈ ∪ 𝐵(𝑥 ∈ 𝑦 → ∃𝑧 ∈ 𝐶 (𝑥 ∈ 𝑧 ∧ 𝑧 ⊆ 𝑦)))
18	16, 17	bitrdi 196	. . . 4 ⊢ (((𝐵 ∈ 𝑉 ∧ ∪ 𝐵 = ∪ 𝐶) ∧ 𝑦 ∈ 𝐵) → (𝑦 ∈ (topGen‘𝐶) ↔ ∀𝑥 ∈ ∪ 𝐵(𝑥 ∈ 𝑦 → ∃𝑧 ∈ 𝐶 (𝑥 ∈ 𝑧 ∧ 𝑧 ⊆ 𝑦))))
19	18	ralbidva 2473	. . 3 ⊢ ((𝐵 ∈ 𝑉 ∧ ∪ 𝐵 = ∪ 𝐶) → (∀𝑦 ∈ 𝐵 𝑦 ∈ (topGen‘𝐶) ↔ ∀𝑦 ∈ 𝐵 ∀𝑥 ∈ ∪ 𝐵(𝑥 ∈ 𝑦 → ∃𝑧 ∈ 𝐶 (𝑥 ∈ 𝑧 ∧ 𝑧 ⊆ 𝑦))))
20		dfss3 3145	. . 3 ⊢ (𝐵 ⊆ (topGen‘𝐶) ↔ ∀𝑦 ∈ 𝐵 𝑦 ∈ (topGen‘𝐶))
21		ralcom 2640	. . 3 ⊢ (∀𝑥 ∈ ∪ 𝐵∀𝑦 ∈ 𝐵 (𝑥 ∈ 𝑦 → ∃𝑧 ∈ 𝐶 (𝑥 ∈ 𝑧 ∧ 𝑧 ⊆ 𝑦)) ↔ ∀𝑦 ∈ 𝐵 ∀𝑥 ∈ ∪ 𝐵(𝑥 ∈ 𝑦 → ∃𝑧 ∈ 𝐶 (𝑥 ∈ 𝑧 ∧ 𝑧 ⊆ 𝑦)))
22	19, 20, 21	3bitr4g 223	. 2 ⊢ ((𝐵 ∈ 𝑉 ∧ ∪ 𝐵 = ∪ 𝐶) → (𝐵 ⊆ (topGen‘𝐶) ↔ ∀𝑥 ∈ ∪ 𝐵∀𝑦 ∈ 𝐵 (𝑥 ∈ 𝑦 → ∃𝑧 ∈ 𝐶 (𝑥 ∈ 𝑧 ∧ 𝑧 ⊆ 𝑦))))
23	8, 22	bitrd 188	1 ⊢ ((𝐵 ∈ 𝑉 ∧ ∪ 𝐵 = ∪ 𝐶) → ((topGen‘𝐵) ⊆ (topGen‘𝐶) ↔ ∀𝑥 ∈ ∪ 𝐵∀𝑦 ∈ 𝐵 (𝑥 ∈ 𝑦 → ∃𝑧 ∈ 𝐶 (𝑥 ∈ 𝑧 ∧ 𝑧 ⊆ 𝑦))))

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1353   ∈ wcel 2148  ∀wral 2455  ∃wrex 2456  Vcvv 2737   ⊆ wss 3129  ∪ cuni 3809  ‘cfv 5216  topGenctg 12702

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 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-sep 4121  ax-pow 4174  ax-pr 4209  ax-un 4433

This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ral 2460  df-rex 2461  df-v 2739  df-sbc 2963  df-un 3133  df-in 3135  df-ss 3142  df-pw 3577  df-sn 3598  df-pr 3599  df-op 3601  df-uni 3810  df-iun 3888  df-br 4004  df-opab 4065  df-mpt 4066  df-id 4293  df-xp 4632  df-rel 4633  df-cnv 4634  df-co 4635  df-dm 4636  df-iota 5178  df-fun 5218  df-fv 5224  df-topgen 12708

This theorem is referenced by:  metss  13964