Theorem mremre 17230

Description: The Moore collections of subsets of a space, viewed as a kind of subset of the power set, form a Moore collection in their own right on the power set. (Contributed by Stefan O'Rear, 30-Jan-2015.)

Assertion

Ref	Expression
mremre	⊢ (𝑋 ∈ 𝑉 → (Moore‘𝑋) ∈ (Moore‘𝒫 𝑋))

Proof of Theorem mremre

Dummy variables 𝑎 𝑏 𝑐 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		mresspw 17218	. . . . 5 ⊢ (𝑎 ∈ (Moore‘𝑋) → 𝑎 ⊆ 𝒫 𝑋)
2		velpw 4535	. . . . 5 ⊢ (𝑎 ∈ 𝒫 𝒫 𝑋 ↔ 𝑎 ⊆ 𝒫 𝑋)
3	1, 2	sylibr 233	. . . 4 ⊢ (𝑎 ∈ (Moore‘𝑋) → 𝑎 ∈ 𝒫 𝒫 𝑋)
4	3	ssriv 3921	. . 3 ⊢ (Moore‘𝑋) ⊆ 𝒫 𝒫 𝑋
5	4	a1i 11	. 2 ⊢ (𝑋 ∈ 𝑉 → (Moore‘𝑋) ⊆ 𝒫 𝒫 𝑋)
6		ssidd 3940	. . 3 ⊢ (𝑋 ∈ 𝑉 → 𝒫 𝑋 ⊆ 𝒫 𝑋)
7		pwidg 4552	. . 3 ⊢ (𝑋 ∈ 𝑉 → 𝑋 ∈ 𝒫 𝑋)
8		intssuni2 4901	. . . . . 6 ⊢ ((𝑎 ⊆ 𝒫 𝑋 ∧ 𝑎 ≠ ∅) → ∩ 𝑎 ⊆ ∪ 𝒫 𝑋)
9	8	3adant1 1128	. . . . 5 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑎 ⊆ 𝒫 𝑋 ∧ 𝑎 ≠ ∅) → ∩ 𝑎 ⊆ ∪ 𝒫 𝑋)
10		unipw 5360	. . . . 5 ⊢ ∪ 𝒫 𝑋 = 𝑋
11	9, 10	sseqtrdi 3967	. . . 4 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑎 ⊆ 𝒫 𝑋 ∧ 𝑎 ≠ ∅) → ∩ 𝑎 ⊆ 𝑋)
12		elpw2g 5263	. . . . 5 ⊢ (𝑋 ∈ 𝑉 → (∩ 𝑎 ∈ 𝒫 𝑋 ↔ ∩ 𝑎 ⊆ 𝑋))
13	12	3ad2ant1 1131	. . . 4 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑎 ⊆ 𝒫 𝑋 ∧ 𝑎 ≠ ∅) → (∩ 𝑎 ∈ 𝒫 𝑋 ↔ ∩ 𝑎 ⊆ 𝑋))
14	11, 13	mpbird 256	. . 3 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑎 ⊆ 𝒫 𝑋 ∧ 𝑎 ≠ ∅) → ∩ 𝑎 ∈ 𝒫 𝑋)
15	6, 7, 14	ismred 17228	. 2 ⊢ (𝑋 ∈ 𝑉 → 𝒫 𝑋 ∈ (Moore‘𝑋))
16		n0 4277	. . . . 5 ⊢ (𝑎 ≠ ∅ ↔ ∃𝑏 𝑏 ∈ 𝑎)
17		intss1 4891	. . . . . . . . 9 ⊢ (𝑏 ∈ 𝑎 → ∩ 𝑎 ⊆ 𝑏)
18	17	adantl 481	. . . . . . . 8 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝑎 ⊆ (Moore‘𝑋)) ∧ 𝑏 ∈ 𝑎) → ∩ 𝑎 ⊆ 𝑏)
19		simpr 484	. . . . . . . . . 10 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑎 ⊆ (Moore‘𝑋)) → 𝑎 ⊆ (Moore‘𝑋))
20	19	sselda 3917	. . . . . . . . 9 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝑎 ⊆ (Moore‘𝑋)) ∧ 𝑏 ∈ 𝑎) → 𝑏 ∈ (Moore‘𝑋))
21		mresspw 17218	. . . . . . . . 9 ⊢ (𝑏 ∈ (Moore‘𝑋) → 𝑏 ⊆ 𝒫 𝑋)
22	20, 21	syl 17	. . . . . . . 8 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝑎 ⊆ (Moore‘𝑋)) ∧ 𝑏 ∈ 𝑎) → 𝑏 ⊆ 𝒫 𝑋)
23	18, 22	sstrd 3927	. . . . . . 7 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝑎 ⊆ (Moore‘𝑋)) ∧ 𝑏 ∈ 𝑎) → ∩ 𝑎 ⊆ 𝒫 𝑋)
24	23	ex 412	. . . . . 6 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑎 ⊆ (Moore‘𝑋)) → (𝑏 ∈ 𝑎 → ∩ 𝑎 ⊆ 𝒫 𝑋))
25	24	exlimdv 1937	. . . . 5 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑎 ⊆ (Moore‘𝑋)) → (∃𝑏 𝑏 ∈ 𝑎 → ∩ 𝑎 ⊆ 𝒫 𝑋))
26	16, 25	syl5bi 241	. . . 4 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑎 ⊆ (Moore‘𝑋)) → (𝑎 ≠ ∅ → ∩ 𝑎 ⊆ 𝒫 𝑋))
27	26	3impia 1115	. . 3 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑎 ⊆ (Moore‘𝑋) ∧ 𝑎 ≠ ∅) → ∩ 𝑎 ⊆ 𝒫 𝑋)
28		simp2 1135	. . . . . . 7 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑎 ⊆ (Moore‘𝑋) ∧ 𝑎 ≠ ∅) → 𝑎 ⊆ (Moore‘𝑋))
29	28	sselda 3917	. . . . . 6 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝑎 ⊆ (Moore‘𝑋) ∧ 𝑎 ≠ ∅) ∧ 𝑏 ∈ 𝑎) → 𝑏 ∈ (Moore‘𝑋))
30		mre1cl 17220	. . . . . 6 ⊢ (𝑏 ∈ (Moore‘𝑋) → 𝑋 ∈ 𝑏)
31	29, 30	syl 17	. . . . 5 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝑎 ⊆ (Moore‘𝑋) ∧ 𝑎 ≠ ∅) ∧ 𝑏 ∈ 𝑎) → 𝑋 ∈ 𝑏)
32	31	ralrimiva 3107	. . . 4 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑎 ⊆ (Moore‘𝑋) ∧ 𝑎 ≠ ∅) → ∀𝑏 ∈ 𝑎 𝑋 ∈ 𝑏)
33		elintg 4884	. . . . 5 ⊢ (𝑋 ∈ 𝑉 → (𝑋 ∈ ∩ 𝑎 ↔ ∀𝑏 ∈ 𝑎 𝑋 ∈ 𝑏))
34	33	3ad2ant1 1131	. . . 4 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑎 ⊆ (Moore‘𝑋) ∧ 𝑎 ≠ ∅) → (𝑋 ∈ ∩ 𝑎 ↔ ∀𝑏 ∈ 𝑎 𝑋 ∈ 𝑏))
35	32, 34	mpbird 256	. . 3 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑎 ⊆ (Moore‘𝑋) ∧ 𝑎 ≠ ∅) → 𝑋 ∈ ∩ 𝑎)
36		simp12 1202	. . . . . . 7 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝑎 ⊆ (Moore‘𝑋) ∧ 𝑎 ≠ ∅) ∧ 𝑏 ⊆ ∩ 𝑎 ∧ 𝑏 ≠ ∅) → 𝑎 ⊆ (Moore‘𝑋))
37	36	sselda 3917	. . . . . 6 ⊢ ((((𝑋 ∈ 𝑉 ∧ 𝑎 ⊆ (Moore‘𝑋) ∧ 𝑎 ≠ ∅) ∧ 𝑏 ⊆ ∩ 𝑎 ∧ 𝑏 ≠ ∅) ∧ 𝑐 ∈ 𝑎) → 𝑐 ∈ (Moore‘𝑋))
38		simpl2 1190	. . . . . . 7 ⊢ ((((𝑋 ∈ 𝑉 ∧ 𝑎 ⊆ (Moore‘𝑋) ∧ 𝑎 ≠ ∅) ∧ 𝑏 ⊆ ∩ 𝑎 ∧ 𝑏 ≠ ∅) ∧ 𝑐 ∈ 𝑎) → 𝑏 ⊆ ∩ 𝑎)
39		intss1 4891	. . . . . . . 8 ⊢ (𝑐 ∈ 𝑎 → ∩ 𝑎 ⊆ 𝑐)
40	39	adantl 481	. . . . . . 7 ⊢ ((((𝑋 ∈ 𝑉 ∧ 𝑎 ⊆ (Moore‘𝑋) ∧ 𝑎 ≠ ∅) ∧ 𝑏 ⊆ ∩ 𝑎 ∧ 𝑏 ≠ ∅) ∧ 𝑐 ∈ 𝑎) → ∩ 𝑎 ⊆ 𝑐)
41	38, 40	sstrd 3927	. . . . . 6 ⊢ ((((𝑋 ∈ 𝑉 ∧ 𝑎 ⊆ (Moore‘𝑋) ∧ 𝑎 ≠ ∅) ∧ 𝑏 ⊆ ∩ 𝑎 ∧ 𝑏 ≠ ∅) ∧ 𝑐 ∈ 𝑎) → 𝑏 ⊆ 𝑐)
42		simpl3 1191	. . . . . 6 ⊢ ((((𝑋 ∈ 𝑉 ∧ 𝑎 ⊆ (Moore‘𝑋) ∧ 𝑎 ≠ ∅) ∧ 𝑏 ⊆ ∩ 𝑎 ∧ 𝑏 ≠ ∅) ∧ 𝑐 ∈ 𝑎) → 𝑏 ≠ ∅)
43		mreintcl 17221	. . . . . 6 ⊢ ((𝑐 ∈ (Moore‘𝑋) ∧ 𝑏 ⊆ 𝑐 ∧ 𝑏 ≠ ∅) → ∩ 𝑏 ∈ 𝑐)
44	37, 41, 42, 43	syl3anc 1369	. . . . 5 ⊢ ((((𝑋 ∈ 𝑉 ∧ 𝑎 ⊆ (Moore‘𝑋) ∧ 𝑎 ≠ ∅) ∧ 𝑏 ⊆ ∩ 𝑎 ∧ 𝑏 ≠ ∅) ∧ 𝑐 ∈ 𝑎) → ∩ 𝑏 ∈ 𝑐)
45	44	ralrimiva 3107	. . . 4 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝑎 ⊆ (Moore‘𝑋) ∧ 𝑎 ≠ ∅) ∧ 𝑏 ⊆ ∩ 𝑎 ∧ 𝑏 ≠ ∅) → ∀𝑐 ∈ 𝑎 ∩ 𝑏 ∈ 𝑐)
46		intex 5256	. . . . . 6 ⊢ (𝑏 ≠ ∅ ↔ ∩ 𝑏 ∈ V)
47		elintg 4884	. . . . . 6 ⊢ (∩ 𝑏 ∈ V → (∩ 𝑏 ∈ ∩ 𝑎 ↔ ∀𝑐 ∈ 𝑎 ∩ 𝑏 ∈ 𝑐))
48	46, 47	sylbi 216	. . . . 5 ⊢ (𝑏 ≠ ∅ → (∩ 𝑏 ∈ ∩ 𝑎 ↔ ∀𝑐 ∈ 𝑎 ∩ 𝑏 ∈ 𝑐))
49	48	3ad2ant3 1133	. . . 4 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝑎 ⊆ (Moore‘𝑋) ∧ 𝑎 ≠ ∅) ∧ 𝑏 ⊆ ∩ 𝑎 ∧ 𝑏 ≠ ∅) → (∩ 𝑏 ∈ ∩ 𝑎 ↔ ∀𝑐 ∈ 𝑎 ∩ 𝑏 ∈ 𝑐))
50	45, 49	mpbird 256	. . 3 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝑎 ⊆ (Moore‘𝑋) ∧ 𝑎 ≠ ∅) ∧ 𝑏 ⊆ ∩ 𝑎 ∧ 𝑏 ≠ ∅) → ∩ 𝑏 ∈ ∩ 𝑎)
51	27, 35, 50	ismred 17228	. 2 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑎 ⊆ (Moore‘𝑋) ∧ 𝑎 ≠ ∅) → ∩ 𝑎 ∈ (Moore‘𝑋))
52	5, 15, 51	ismred 17228	1 ⊢ (𝑋 ∈ 𝑉 → (Moore‘𝑋) ∈ (Moore‘𝒫 𝑋))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 395   ∧ w3a 1085  ∃wex 1783   ∈ wcel 2108   ≠ wne 2942  ∀wral 3063  Vcvv 3422   ⊆ wss 3883  ∅c0 4253  𝒫 cpw 4530  ∪ cuni 4836  ∩ cint 4876  ‘cfv 6418  Moorecmre 17208

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-sep 5218  ax-nul 5225  ax-pow 5283  ax-pr 5347

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-ral 3068  df-rex 3069  df-rab 3072  df-v 3424  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4254  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4837  df-int 4877  df-br 5071  df-opab 5133  df-mpt 5154  df-id 5480  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-iota 6376  df-fun 6420  df-fv 6426  df-mre 17212

This theorem is referenced by:  mreacs  17284  mreclatdemoBAD  22155