Theorem submre 17567

Description: The subcollection of a closed set system below a given closed set is itself a closed set system. (Contributed by Stefan O'Rear, 9-Mar-2015.)

Assertion

Ref	Expression
submre	⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝐴 ∈ 𝐶) → (𝐶 ∩ 𝒫 𝐴) ∈ (Moore‘𝐴))

Proof of Theorem submre

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		inss2 4178	. . 3 ⊢ (𝐶 ∩ 𝒫 𝐴) ⊆ 𝒫 𝐴
2	1	a1i 11	. 2 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝐴 ∈ 𝐶) → (𝐶 ∩ 𝒫 𝐴) ⊆ 𝒫 𝐴)
3		simpr 484	. . 3 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝐴 ∈ 𝐶) → 𝐴 ∈ 𝐶)
4		pwidg 4561	. . . 4 ⊢ (𝐴 ∈ 𝐶 → 𝐴 ∈ 𝒫 𝐴)
5	4	adantl 481	. . 3 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝐴 ∈ 𝐶) → 𝐴 ∈ 𝒫 𝐴)
6	3, 5	elind 4140	. 2 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝐴 ∈ 𝐶) → 𝐴 ∈ (𝐶 ∩ 𝒫 𝐴))
7		simp1l 1199	. . . 4 ⊢ (((𝐶 ∈ (Moore‘𝑋) ∧ 𝐴 ∈ 𝐶) ∧ 𝑥 ⊆ (𝐶 ∩ 𝒫 𝐴) ∧ 𝑥 ≠ ∅) → 𝐶 ∈ (Moore‘𝑋))
8		inss1 4177	. . . . . 6 ⊢ (𝐶 ∩ 𝒫 𝐴) ⊆ 𝐶
9		sstr 3930	. . . . . 6 ⊢ ((𝑥 ⊆ (𝐶 ∩ 𝒫 𝐴) ∧ (𝐶 ∩ 𝒫 𝐴) ⊆ 𝐶) → 𝑥 ⊆ 𝐶)
10	8, 9	mpan2 692	. . . . 5 ⊢ (𝑥 ⊆ (𝐶 ∩ 𝒫 𝐴) → 𝑥 ⊆ 𝐶)
11	10	3ad2ant2 1135	. . . 4 ⊢ (((𝐶 ∈ (Moore‘𝑋) ∧ 𝐴 ∈ 𝐶) ∧ 𝑥 ⊆ (𝐶 ∩ 𝒫 𝐴) ∧ 𝑥 ≠ ∅) → 𝑥 ⊆ 𝐶)
12		simp3 1139	. . . 4 ⊢ (((𝐶 ∈ (Moore‘𝑋) ∧ 𝐴 ∈ 𝐶) ∧ 𝑥 ⊆ (𝐶 ∩ 𝒫 𝐴) ∧ 𝑥 ≠ ∅) → 𝑥 ≠ ∅)
13		mreintcl 17557	. . . 4 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑥 ⊆ 𝐶 ∧ 𝑥 ≠ ∅) → ∩ 𝑥 ∈ 𝐶)
14	7, 11, 12, 13	syl3anc 1374	. . 3 ⊢ (((𝐶 ∈ (Moore‘𝑋) ∧ 𝐴 ∈ 𝐶) ∧ 𝑥 ⊆ (𝐶 ∩ 𝒫 𝐴) ∧ 𝑥 ≠ ∅) → ∩ 𝑥 ∈ 𝐶)
15		sstr 3930	. . . . . . . 8 ⊢ ((𝑥 ⊆ (𝐶 ∩ 𝒫 𝐴) ∧ (𝐶 ∩ 𝒫 𝐴) ⊆ 𝒫 𝐴) → 𝑥 ⊆ 𝒫 𝐴)
16	1, 15	mpan2 692	. . . . . . 7 ⊢ (𝑥 ⊆ (𝐶 ∩ 𝒫 𝐴) → 𝑥 ⊆ 𝒫 𝐴)
17	16	3ad2ant2 1135	. . . . . 6 ⊢ (((𝐶 ∈ (Moore‘𝑋) ∧ 𝐴 ∈ 𝐶) ∧ 𝑥 ⊆ (𝐶 ∩ 𝒫 𝐴) ∧ 𝑥 ≠ ∅) → 𝑥 ⊆ 𝒫 𝐴)
18		intssuni2 4915	. . . . . 6 ⊢ ((𝑥 ⊆ 𝒫 𝐴 ∧ 𝑥 ≠ ∅) → ∩ 𝑥 ⊆ ∪ 𝒫 𝐴)
19	17, 12, 18	syl2anc 585	. . . . 5 ⊢ (((𝐶 ∈ (Moore‘𝑋) ∧ 𝐴 ∈ 𝐶) ∧ 𝑥 ⊆ (𝐶 ∩ 𝒫 𝐴) ∧ 𝑥 ≠ ∅) → ∩ 𝑥 ⊆ ∪ 𝒫 𝐴)
20		unipw 5402	. . . . 5 ⊢ ∪ 𝒫 𝐴 = 𝐴
21	19, 20	sseqtrdi 3962	. . . 4 ⊢ (((𝐶 ∈ (Moore‘𝑋) ∧ 𝐴 ∈ 𝐶) ∧ 𝑥 ⊆ (𝐶 ∩ 𝒫 𝐴) ∧ 𝑥 ≠ ∅) → ∩ 𝑥 ⊆ 𝐴)
22		elpw2g 5274	. . . . . 6 ⊢ (𝐴 ∈ 𝐶 → (∩ 𝑥 ∈ 𝒫 𝐴 ↔ ∩ 𝑥 ⊆ 𝐴))
23	22	adantl 481	. . . . 5 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝐴 ∈ 𝐶) → (∩ 𝑥 ∈ 𝒫 𝐴 ↔ ∩ 𝑥 ⊆ 𝐴))
24	23	3ad2ant1 1134	. . . 4 ⊢ (((𝐶 ∈ (Moore‘𝑋) ∧ 𝐴 ∈ 𝐶) ∧ 𝑥 ⊆ (𝐶 ∩ 𝒫 𝐴) ∧ 𝑥 ≠ ∅) → (∩ 𝑥 ∈ 𝒫 𝐴 ↔ ∩ 𝑥 ⊆ 𝐴))
25	21, 24	mpbird 257	. . 3 ⊢ (((𝐶 ∈ (Moore‘𝑋) ∧ 𝐴 ∈ 𝐶) ∧ 𝑥 ⊆ (𝐶 ∩ 𝒫 𝐴) ∧ 𝑥 ≠ ∅) → ∩ 𝑥 ∈ 𝒫 𝐴)
26	14, 25	elind 4140	. 2 ⊢ (((𝐶 ∈ (Moore‘𝑋) ∧ 𝐴 ∈ 𝐶) ∧ 𝑥 ⊆ (𝐶 ∩ 𝒫 𝐴) ∧ 𝑥 ≠ ∅) → ∩ 𝑥 ∈ (𝐶 ∩ 𝒫 𝐴))
27	2, 6, 26	ismred 17564	1 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝐴 ∈ 𝐶) → (𝐶 ∩ 𝒫 𝐴) ∈ (Moore‘𝐴))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1087   ∈ wcel 2114   ≠ wne 2932   ∩ cin 3888   ⊆ wss 3889  ∅c0 4273  𝒫 cpw 4541  ∪ cuni 4850  ∩ cint 4889  ‘cfv 6498  Moorecmre 17544

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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2708  ax-sep 5231  ax-nul 5241  ax-pow 5307  ax-pr 5375

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3062  df-rab 3390  df-v 3431  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-int 4890  df-br 5086  df-opab 5148  df-mpt 5167  df-id 5526  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-iota 6454  df-fun 6500  df-fv 6506  df-mre 17548

This theorem is referenced by:  submrc  17594