Theorem restopnb 22526

Description: If 𝐵 is an open subset of the subspace base set 𝐴, then any subset of 𝐵 is open iff it is open in 𝐴. (Contributed by Mario Carneiro, 2-Mar-2015.)

Assertion

Ref	Expression
restopnb	⊢ (((𝐽 ∈ Top ∧ 𝐴 ∈ 𝑉) ∧ (𝐵 ∈ 𝐽 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐶 ⊆ 𝐵)) → (𝐶 ∈ 𝐽 ↔ 𝐶 ∈ (𝐽 ↾t 𝐴)))

Proof of Theorem restopnb

Dummy variable 𝑣 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		simpr3 1196	. . . . . . 7 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ∈ 𝑉) ∧ (𝐵 ∈ 𝐽 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐶 ⊆ 𝐵)) → 𝐶 ⊆ 𝐵)
2		simpr2 1195	. . . . . . 7 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ∈ 𝑉) ∧ (𝐵 ∈ 𝐽 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐶 ⊆ 𝐵)) → 𝐵 ⊆ 𝐴)
3	1, 2	sstrd 3954	. . . . . 6 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ∈ 𝑉) ∧ (𝐵 ∈ 𝐽 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐶 ⊆ 𝐵)) → 𝐶 ⊆ 𝐴)
4		df-ss 3927	. . . . . 6 ⊢ (𝐶 ⊆ 𝐴 ↔ (𝐶 ∩ 𝐴) = 𝐶)
5	3, 4	sylib 217	. . . . 5 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ∈ 𝑉) ∧ (𝐵 ∈ 𝐽 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐶 ⊆ 𝐵)) → (𝐶 ∩ 𝐴) = 𝐶)
6	5	eqcomd 2742	. . . 4 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ∈ 𝑉) ∧ (𝐵 ∈ 𝐽 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐶 ⊆ 𝐵)) → 𝐶 = (𝐶 ∩ 𝐴))
7		ineq1 4165	. . . . . 6 ⊢ (𝑣 = 𝐶 → (𝑣 ∩ 𝐴) = (𝐶 ∩ 𝐴))
8	7	rspceeqv 3595	. . . . 5 ⊢ ((𝐶 ∈ 𝐽 ∧ 𝐶 = (𝐶 ∩ 𝐴)) → ∃𝑣 ∈ 𝐽 𝐶 = (𝑣 ∩ 𝐴))
9	8	expcom 414	. . . 4 ⊢ (𝐶 = (𝐶 ∩ 𝐴) → (𝐶 ∈ 𝐽 → ∃𝑣 ∈ 𝐽 𝐶 = (𝑣 ∩ 𝐴)))
10	6, 9	syl 17	. . 3 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ∈ 𝑉) ∧ (𝐵 ∈ 𝐽 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐶 ⊆ 𝐵)) → (𝐶 ∈ 𝐽 → ∃𝑣 ∈ 𝐽 𝐶 = (𝑣 ∩ 𝐴)))
11		inass 4179	. . . . . 6 ⊢ ((𝑣 ∩ 𝐴) ∩ 𝐵) = (𝑣 ∩ (𝐴 ∩ 𝐵))
12		simprr 771	. . . . . . . 8 ⊢ ((((𝐽 ∈ Top ∧ 𝐴 ∈ 𝑉) ∧ (𝐵 ∈ 𝐽 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐶 ⊆ 𝐵)) ∧ (𝑣 ∈ 𝐽 ∧ 𝐶 = (𝑣 ∩ 𝐴))) → 𝐶 = (𝑣 ∩ 𝐴))
13	12	ineq1d 4171	. . . . . . 7 ⊢ ((((𝐽 ∈ Top ∧ 𝐴 ∈ 𝑉) ∧ (𝐵 ∈ 𝐽 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐶 ⊆ 𝐵)) ∧ (𝑣 ∈ 𝐽 ∧ 𝐶 = (𝑣 ∩ 𝐴))) → (𝐶 ∩ 𝐵) = ((𝑣 ∩ 𝐴) ∩ 𝐵))
14		simplr3 1217	. . . . . . . . 9 ⊢ ((((𝐽 ∈ Top ∧ 𝐴 ∈ 𝑉) ∧ (𝐵 ∈ 𝐽 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐶 ⊆ 𝐵)) ∧ 𝑣 ∈ 𝐽) → 𝐶 ⊆ 𝐵)
15		df-ss 3927	. . . . . . . . 9 ⊢ (𝐶 ⊆ 𝐵 ↔ (𝐶 ∩ 𝐵) = 𝐶)
16	14, 15	sylib 217	. . . . . . . 8 ⊢ ((((𝐽 ∈ Top ∧ 𝐴 ∈ 𝑉) ∧ (𝐵 ∈ 𝐽 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐶 ⊆ 𝐵)) ∧ 𝑣 ∈ 𝐽) → (𝐶 ∩ 𝐵) = 𝐶)
17	16	adantrr 715	. . . . . . 7 ⊢ ((((𝐽 ∈ Top ∧ 𝐴 ∈ 𝑉) ∧ (𝐵 ∈ 𝐽 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐶 ⊆ 𝐵)) ∧ (𝑣 ∈ 𝐽 ∧ 𝐶 = (𝑣 ∩ 𝐴))) → (𝐶 ∩ 𝐵) = 𝐶)
18	13, 17	eqtr3d 2778	. . . . . 6 ⊢ ((((𝐽 ∈ Top ∧ 𝐴 ∈ 𝑉) ∧ (𝐵 ∈ 𝐽 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐶 ⊆ 𝐵)) ∧ (𝑣 ∈ 𝐽 ∧ 𝐶 = (𝑣 ∩ 𝐴))) → ((𝑣 ∩ 𝐴) ∩ 𝐵) = 𝐶)
19		simplr2 1216	. . . . . . . . 9 ⊢ ((((𝐽 ∈ Top ∧ 𝐴 ∈ 𝑉) ∧ (𝐵 ∈ 𝐽 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐶 ⊆ 𝐵)) ∧ 𝑣 ∈ 𝐽) → 𝐵 ⊆ 𝐴)
20		sseqin2 4175	. . . . . . . . 9 ⊢ (𝐵 ⊆ 𝐴 ↔ (𝐴 ∩ 𝐵) = 𝐵)
21	19, 20	sylib 217	. . . . . . . 8 ⊢ ((((𝐽 ∈ Top ∧ 𝐴 ∈ 𝑉) ∧ (𝐵 ∈ 𝐽 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐶 ⊆ 𝐵)) ∧ 𝑣 ∈ 𝐽) → (𝐴 ∩ 𝐵) = 𝐵)
22	21	ineq2d 4172	. . . . . . 7 ⊢ ((((𝐽 ∈ Top ∧ 𝐴 ∈ 𝑉) ∧ (𝐵 ∈ 𝐽 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐶 ⊆ 𝐵)) ∧ 𝑣 ∈ 𝐽) → (𝑣 ∩ (𝐴 ∩ 𝐵)) = (𝑣 ∩ 𝐵))
23	22	adantrr 715	. . . . . 6 ⊢ ((((𝐽 ∈ Top ∧ 𝐴 ∈ 𝑉) ∧ (𝐵 ∈ 𝐽 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐶 ⊆ 𝐵)) ∧ (𝑣 ∈ 𝐽 ∧ 𝐶 = (𝑣 ∩ 𝐴))) → (𝑣 ∩ (𝐴 ∩ 𝐵)) = (𝑣 ∩ 𝐵))
24	11, 18, 23	3eqtr3a 2800	. . . . 5 ⊢ ((((𝐽 ∈ Top ∧ 𝐴 ∈ 𝑉) ∧ (𝐵 ∈ 𝐽 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐶 ⊆ 𝐵)) ∧ (𝑣 ∈ 𝐽 ∧ 𝐶 = (𝑣 ∩ 𝐴))) → 𝐶 = (𝑣 ∩ 𝐵))
25		simplll 773	. . . . . 6 ⊢ ((((𝐽 ∈ Top ∧ 𝐴 ∈ 𝑉) ∧ (𝐵 ∈ 𝐽 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐶 ⊆ 𝐵)) ∧ (𝑣 ∈ 𝐽 ∧ 𝐶 = (𝑣 ∩ 𝐴))) → 𝐽 ∈ Top)
26		simprl 769	. . . . . 6 ⊢ ((((𝐽 ∈ Top ∧ 𝐴 ∈ 𝑉) ∧ (𝐵 ∈ 𝐽 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐶 ⊆ 𝐵)) ∧ (𝑣 ∈ 𝐽 ∧ 𝐶 = (𝑣 ∩ 𝐴))) → 𝑣 ∈ 𝐽)
27		simplr1 1215	. . . . . 6 ⊢ ((((𝐽 ∈ Top ∧ 𝐴 ∈ 𝑉) ∧ (𝐵 ∈ 𝐽 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐶 ⊆ 𝐵)) ∧ (𝑣 ∈ 𝐽 ∧ 𝐶 = (𝑣 ∩ 𝐴))) → 𝐵 ∈ 𝐽)
28		inopn 22248	. . . . . 6 ⊢ ((𝐽 ∈ Top ∧ 𝑣 ∈ 𝐽 ∧ 𝐵 ∈ 𝐽) → (𝑣 ∩ 𝐵) ∈ 𝐽)
29	25, 26, 27, 28	syl3anc 1371	. . . . 5 ⊢ ((((𝐽 ∈ Top ∧ 𝐴 ∈ 𝑉) ∧ (𝐵 ∈ 𝐽 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐶 ⊆ 𝐵)) ∧ (𝑣 ∈ 𝐽 ∧ 𝐶 = (𝑣 ∩ 𝐴))) → (𝑣 ∩ 𝐵) ∈ 𝐽)
30	24, 29	eqeltrd 2838	. . . 4 ⊢ ((((𝐽 ∈ Top ∧ 𝐴 ∈ 𝑉) ∧ (𝐵 ∈ 𝐽 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐶 ⊆ 𝐵)) ∧ (𝑣 ∈ 𝐽 ∧ 𝐶 = (𝑣 ∩ 𝐴))) → 𝐶 ∈ 𝐽)
31	30	rexlimdvaa 3153	. . 3 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ∈ 𝑉) ∧ (𝐵 ∈ 𝐽 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐶 ⊆ 𝐵)) → (∃𝑣 ∈ 𝐽 𝐶 = (𝑣 ∩ 𝐴) → 𝐶 ∈ 𝐽))
32	10, 31	impbid 211	. 2 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ∈ 𝑉) ∧ (𝐵 ∈ 𝐽 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐶 ⊆ 𝐵)) → (𝐶 ∈ 𝐽 ↔ ∃𝑣 ∈ 𝐽 𝐶 = (𝑣 ∩ 𝐴)))
33		elrest 17309	. . 3 ⊢ ((𝐽 ∈ Top ∧ 𝐴 ∈ 𝑉) → (𝐶 ∈ (𝐽 ↾t 𝐴) ↔ ∃𝑣 ∈ 𝐽 𝐶 = (𝑣 ∩ 𝐴)))
34	33	adantr 481	. 2 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ∈ 𝑉) ∧ (𝐵 ∈ 𝐽 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐶 ⊆ 𝐵)) → (𝐶 ∈ (𝐽 ↾t 𝐴) ↔ ∃𝑣 ∈ 𝐽 𝐶 = (𝑣 ∩ 𝐴)))
35	32, 34	bitr4d 281	1 ⊢ (((𝐽 ∈ Top ∧ 𝐴 ∈ 𝑉) ∧ (𝐵 ∈ 𝐽 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐶 ⊆ 𝐵)) → (𝐶 ∈ 𝐽 ↔ 𝐶 ∈ (𝐽 ↾t 𝐴)))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 396   ∧ w3a 1087   = wceq 1541   ∈ wcel 2106  ∃wrex 3073   ∩ cin 3909   ⊆ wss 3910  (class class class)co 7357   ↾_t crest 17302  Topctop 22242

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2707  ax-rep 5242  ax-sep 5256  ax-nul 5263  ax-pr 5384  ax-un 7672

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2538  df-eu 2567  df-clab 2714  df-cleq 2728  df-clel 2814  df-nfc 2889  df-ne 2944  df-ral 3065  df-rex 3074  df-reu 3354  df-rab 3408  df-v 3447  df-sbc 3740  df-csb 3856  df-dif 3913  df-un 3915  df-in 3917  df-ss 3927  df-nul 4283  df-if 4487  df-pw 4562  df-sn 4587  df-pr 4589  df-op 4593  df-uni 4866  df-iun 4956  df-br 5106  df-opab 5168  df-mpt 5189  df-id 5531  df-xp 5639  df-rel 5640  df-cnv 5641  df-co 5642  df-dm 5643  df-rn 5644  df-res 5645  df-ima 5646  df-iota 6448  df-fun 6498  df-fn 6499  df-f 6500  df-f1 6501  df-fo 6502  df-f1o 6503  df-fv 6504  df-ov 7360  df-oprab 7361  df-mpo 7362  df-rest 17304  df-top 22243

This theorem is referenced by:  restopn2  22528  cxpcn3  26101  pnfneige0  32532  fourierdlem62  44399  fouriersw  44462  iooii  46940