Theorem consubclo 21037

Description: If a clopen set meets a connected subspace, it must contain the entire subspace. (Contributed by Mario Carneiro, 10-Mar-2015.)

Hypotheses

Ref	Expression
consubclo.1	⊢ 𝑋 = ∪ 𝐽
consubclo.3	⊢ (𝜑 → 𝐴 ⊆ 𝑋)
consubclo.4	⊢ (𝜑 → (𝐽 ↾t 𝐴) ∈ Con)
consubclo.5	⊢ (𝜑 → 𝐵 ∈ 𝐽)
consubclo.6	⊢ (𝜑 → (𝐵 ∩ 𝐴) ≠ ∅)
consubclo.7	⊢ (𝜑 → 𝐵 ∈ (Clsd‘𝐽))

Assertion

Ref	Expression
consubclo	⊢ (𝜑 → 𝐴 ⊆ 𝐵)

Proof of Theorem consubclo

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2610	. . . 4 ⊢ ∪ (𝐽 ↾t 𝐴) = ∪ (𝐽 ↾t 𝐴)
2		consubclo.4	. . . 4 ⊢ (𝜑 → (𝐽 ↾t 𝐴) ∈ Con)
3		consubclo.7	. . . . . 6 ⊢ (𝜑 → 𝐵 ∈ (Clsd‘𝐽))
4		cldrcl 20640	. . . . . 6 ⊢ (𝐵 ∈ (Clsd‘𝐽) → 𝐽 ∈ Top)
5	3, 4	syl 17	. . . . 5 ⊢ (𝜑 → 𝐽 ∈ Top)
6		consubclo.1	. . . . . . . 8 ⊢ 𝑋 = ∪ 𝐽
7	6	topopn 20536	. . . . . . 7 ⊢ (𝐽 ∈ Top → 𝑋 ∈ 𝐽)
8	5, 7	syl 17	. . . . . 6 ⊢ (𝜑 → 𝑋 ∈ 𝐽)
9		consubclo.3	. . . . . 6 ⊢ (𝜑 → 𝐴 ⊆ 𝑋)
10	8, 9	ssexd 4733	. . . . 5 ⊢ (𝜑 → 𝐴 ∈ V)
11		consubclo.5	. . . . 5 ⊢ (𝜑 → 𝐵 ∈ 𝐽)
12		elrestr 15912	. . . . 5 ⊢ ((𝐽 ∈ Top ∧ 𝐴 ∈ V ∧ 𝐵 ∈ 𝐽) → (𝐵 ∩ 𝐴) ∈ (𝐽 ↾t 𝐴))
13	5, 10, 11, 12	syl3anc 1318	. . . 4 ⊢ (𝜑 → (𝐵 ∩ 𝐴) ∈ (𝐽 ↾t 𝐴))
14		consubclo.6	. . . 4 ⊢ (𝜑 → (𝐵 ∩ 𝐴) ≠ ∅)
15		eqid 2610	. . . . . 6 ⊢ (𝐵 ∩ 𝐴) = (𝐵 ∩ 𝐴)
16		ineq1 3769	. . . . . . . 8 ⊢ (𝑥 = 𝐵 → (𝑥 ∩ 𝐴) = (𝐵 ∩ 𝐴))
17	16	eqeq2d 2620	. . . . . . 7 ⊢ (𝑥 = 𝐵 → ((𝐵 ∩ 𝐴) = (𝑥 ∩ 𝐴) ↔ (𝐵 ∩ 𝐴) = (𝐵 ∩ 𝐴)))
18	17	rspcev 3282	. . . . . 6 ⊢ ((𝐵 ∈ (Clsd‘𝐽) ∧ (𝐵 ∩ 𝐴) = (𝐵 ∩ 𝐴)) → ∃𝑥 ∈ (Clsd‘𝐽)(𝐵 ∩ 𝐴) = (𝑥 ∩ 𝐴))
19	3, 15, 18	sylancl 693	. . . . 5 ⊢ (𝜑 → ∃𝑥 ∈ (Clsd‘𝐽)(𝐵 ∩ 𝐴) = (𝑥 ∩ 𝐴))
20	6	restcld 20786	. . . . . 6 ⊢ ((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) → ((𝐵 ∩ 𝐴) ∈ (Clsd‘(𝐽 ↾t 𝐴)) ↔ ∃𝑥 ∈ (Clsd‘𝐽)(𝐵 ∩ 𝐴) = (𝑥 ∩ 𝐴)))
21	5, 9, 20	syl2anc 691	. . . . 5 ⊢ (𝜑 → ((𝐵 ∩ 𝐴) ∈ (Clsd‘(𝐽 ↾t 𝐴)) ↔ ∃𝑥 ∈ (Clsd‘𝐽)(𝐵 ∩ 𝐴) = (𝑥 ∩ 𝐴)))
22	19, 21	mpbird 246	. . . 4 ⊢ (𝜑 → (𝐵 ∩ 𝐴) ∈ (Clsd‘(𝐽 ↾t 𝐴)))
23	1, 2, 13, 14, 22	conclo 21028	. . 3 ⊢ (𝜑 → (𝐵 ∩ 𝐴) = ∪ (𝐽 ↾t 𝐴))
24	6	restuni 20776	. . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝐴 ⊆ 𝑋) → 𝐴 = ∪ (𝐽 ↾t 𝐴))
25	5, 9, 24	syl2anc 691	. . 3 ⊢ (𝜑 → 𝐴 = ∪ (𝐽 ↾t 𝐴))
26	23, 25	eqtr4d 2647	. 2 ⊢ (𝜑 → (𝐵 ∩ 𝐴) = 𝐴)
27		sseqin2 3779	. 2 ⊢ (𝐴 ⊆ 𝐵 ↔ (𝐵 ∩ 𝐴) = 𝐴)
28	26, 27	sylibr 223	1 ⊢ (𝜑 → 𝐴 ⊆ 𝐵)

Syntax hints:   → wi 4   ↔ wb 195   = wceq 1475   ∈ wcel 1977   ≠ wne 2780  ∃wrex 2897  Vcvv 3173   ∩ cin 3539   ⊆ wss 3540  ∅c0 3874  ∪ cuni 4372  ‘cfv 5804  (class class class)co 6549   ↾_t crest 15904  Topctop 20517  Clsdccld 20630  Conccon 21024

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-rep 4699  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847

This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3or 1032  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-ral 2901  df-rex 2902  df-reu 2903  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-pss 3556  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-tp 4130  df-op 4132  df-uni 4373  df-int 4411  df-iun 4457  df-br 4584  df-opab 4644  df-mpt 4645  df-tr 4681  df-eprel 4949  df-id 4953  df-po 4959  df-so 4960  df-fr 4997  df-we 4999  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-pred 5597  df-ord 5643  df-on 5644  df-lim 5645  df-suc 5646  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-ov 6552  df-oprab 6553  df-mpt2 6554  df-om 6958  df-1st 7059  df-2nd 7060  df-wrecs 7294  df-recs 7355  df-rdg 7393  df-oadd 7451  df-er 7629  df-en 7842  df-fin 7845  df-fi 8200  df-rest 15906  df-topgen 15927  df-top 20521  df-bases 20522  df-topon 20523  df-cld 20633  df-con 21025

This theorem is referenced by:  concn  21039  concompclo  21048