Theorem topfneec 36925

Description: A cover is equivalent to a topology iff it is a base for that topology. (Contributed by Jeff Hankins, 8-Oct-2009.) (Proof shortened by Mario Carneiro, 11-Sep-2015.)

Hypothesis

Ref	Expression
topfneec.1	⊢ ∼ = (Fne ∩ ◡Fne)

Assertion

Ref	Expression
topfneec	⊢ (𝐽 ∈ Top → (𝐴 ∈ [𝐽] ∼ ↔ (topGen‘𝐴) = 𝐽))

Proof of Theorem topfneec

Step	Hyp	Ref	Expression
1		topfneec.1	. . . . 5 ⊢ ∼ = (Fne ∩ ◡Fne)
2	1	fneer 36923	. . . 4 ⊢ ∼ Er V
3		errel 8710	. . . 4 ⊢ ( ∼ Er V → Rel ∼ )
4	2, 3	ax-mp 5	. . 3 ⊢ Rel ∼
5		relelec 8748	. . 3 ⊢ (Rel ∼ → (𝐴 ∈ [𝐽] ∼ ↔ 𝐽 ∼ 𝐴))
6	4, 5	ax-mp 5	. 2 ⊢ (𝐴 ∈ [𝐽] ∼ ↔ 𝐽 ∼ 𝐴)
7	4	brrelex2i 5720	. . . 4 ⊢ (𝐽 ∼ 𝐴 → 𝐴 ∈ V)
8	7	a1i 11	. . 3 ⊢ (𝐽 ∈ Top → (𝐽 ∼ 𝐴 → 𝐴 ∈ V))
9		eleq1 2853	. . . . . . 7 ⊢ ((topGen‘𝐴) = 𝐽 → ((topGen‘𝐴) ∈ Top ↔ 𝐽 ∈ Top))
10	9	biimparc 485	. . . . . 6 ⊢ ((𝐽 ∈ Top ∧ (topGen‘𝐴) = 𝐽) → (topGen‘𝐴) ∈ Top)
11		tgclb 23179	. . . . . 6 ⊢ (𝐴 ∈ TopBases ↔ (topGen‘𝐴) ∈ Top)
12	10, 11	sylibr 237	. . . . 5 ⊢ ((𝐽 ∈ Top ∧ (topGen‘𝐴) = 𝐽) → 𝐴 ∈ TopBases)
13		elex 3478	. . . . 5 ⊢ (𝐴 ∈ TopBases → 𝐴 ∈ V)
14	12, 13	syl 18	. . . 4 ⊢ ((𝐽 ∈ Top ∧ (topGen‘𝐴) = 𝐽) → 𝐴 ∈ V)
15	14	ex 418	. . 3 ⊢ (𝐽 ∈ Top → ((topGen‘𝐴) = 𝐽 → 𝐴 ∈ V))
16	1	fneval 36922	. . . . 5 ⊢ ((𝐽 ∈ Top ∧ 𝐴 ∈ V) → (𝐽 ∼ 𝐴 ↔ (topGen‘𝐽) = (topGen‘𝐴)))
17		tgtop 23182	. . . . . . . 8 ⊢ (𝐽 ∈ Top → (topGen‘𝐽) = 𝐽)
18	17	eqeq1d 2767	. . . . . . 7 ⊢ (𝐽 ∈ Top → ((topGen‘𝐽) = (topGen‘𝐴) ↔ 𝐽 = (topGen‘𝐴)))
19		eqcom 2772	. . . . . . 7 ⊢ (𝐽 = (topGen‘𝐴) ↔ (topGen‘𝐴) = 𝐽)
20	18, 19	bitrdi 290	. . . . . 6 ⊢ (𝐽 ∈ Top → ((topGen‘𝐽) = (topGen‘𝐴) ↔ (topGen‘𝐴) = 𝐽))
21	20	adantr 486	. . . . 5 ⊢ ((𝐽 ∈ Top ∧ 𝐴 ∈ V) → ((topGen‘𝐽) = (topGen‘𝐴) ↔ (topGen‘𝐴) = 𝐽))
22	16, 21	bitrd 282	. . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝐴 ∈ V) → (𝐽 ∼ 𝐴 ↔ (topGen‘𝐴) = 𝐽))
23	22	ex 418	. . 3 ⊢ (𝐽 ∈ Top → (𝐴 ∈ V → (𝐽 ∼ 𝐴 ↔ (topGen‘𝐴) = 𝐽)))
24	8, 15, 23	pm5.21ndd 382	. 2 ⊢ (𝐽 ∈ Top → (𝐽 ∼ 𝐴 ↔ (topGen‘𝐴) = 𝐽))
25	6, 24	bitrid 286	1 ⊢ (𝐽 ∈ Top → (𝐴 ∈ [𝐽] ∼ ↔ (topGen‘𝐴) = 𝐽))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2146  Vcvv 3457   ∩ cin 3905   class class class wbr 5111  ^◡ccnv 5662  Rel wrel 5668  ‘cfv 6540   Er wer 8697  [cec 8698  topGenctg 17514  Topctop 23102  TopBasesctb 23154  Fnecfne 36906

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-sep 5259  ax-nul 5271  ax-pow 5338  ax-pr 5406  ax-un 7742

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-iota 6496  df-fun 6542  df-fv 6548  df-er 8700  df-ec 8702  df-topgen 17520  df-top 23103  df-bases 23155  df-fne 36907

This theorem is used by: (None)