Theorem submre 17652

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 4190	. . 3 ⊢ (𝐶 ∩ 𝒫 𝐴) ⊆ 𝒫 𝐴
2	1	a1i 11	. 2 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝐴 ∈ 𝐶) → (𝐶 ∩ 𝒫 𝐴) ⊆ 𝒫 𝐴)
3		simpr 489	. . 3 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝐴 ∈ 𝐶) → 𝐴 ∈ 𝐶)
4		pwidg 4582	. . . 4 ⊢ (𝐴 ∈ 𝐶 → 𝐴 ∈ 𝒫 𝐴)
5	4	adantl 486	. . 3 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝐴 ∈ 𝐶) → 𝐴 ∈ 𝒫 𝐴)
6	3, 5	elind 4153	. 2 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝐴 ∈ 𝐶) → 𝐴 ∈ (𝐶 ∩ 𝒫 𝐴))
7		simp1l 1216	. . . 4 ⊢ (((𝐶 ∈ (Moore‘𝑋) ∧ 𝐴 ∈ 𝐶) ∧ 𝑥 ⊆ (𝐶 ∩ 𝒫 𝐴) ∧ 𝑥 ≠ ∅) → 𝐶 ∈ (Moore‘𝑋))
8		inss1 4189	. . . . . 6 ⊢ (𝐶 ∩ 𝒫 𝐴) ⊆ 𝐶
9		sstr 3945	. . . . . 6 ⊢ ((𝑥 ⊆ (𝐶 ∩ 𝒫 𝐴) ∧ (𝐶 ∩ 𝒫 𝐴) ⊆ 𝐶) → 𝑥 ⊆ 𝐶)
10	8, 9	mpan2 703	. . . . 5 ⊢ (𝑥 ⊆ (𝐶 ∩ 𝒫 𝐴) → 𝑥 ⊆ 𝐶)
11	10	3ad2ant2 1152	. . . 4 ⊢ (((𝐶 ∈ (Moore‘𝑋) ∧ 𝐴 ∈ 𝐶) ∧ 𝑥 ⊆ (𝐶 ∩ 𝒫 𝐴) ∧ 𝑥 ≠ ∅) → 𝑥 ⊆ 𝐶)
12		simp3 1156	. . . 4 ⊢ (((𝐶 ∈ (Moore‘𝑋) ∧ 𝐴 ∈ 𝐶) ∧ 𝑥 ⊆ (𝐶 ∩ 𝒫 𝐴) ∧ 𝑥 ≠ ∅) → 𝑥 ≠ ∅)
13		mreintcl 17642	. . . 4 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑥 ⊆ 𝐶 ∧ 𝑥 ≠ ∅) → ∩ 𝑥 ∈ 𝐶)
14	7, 11, 12, 13	syl3anc 1398	. . 3 ⊢ (((𝐶 ∈ (Moore‘𝑋) ∧ 𝐴 ∈ 𝐶) ∧ 𝑥 ⊆ (𝐶 ∩ 𝒫 𝐴) ∧ 𝑥 ≠ ∅) → ∩ 𝑥 ∈ 𝐶)
15		sstr 3945	. . . . . . . 8 ⊢ ((𝑥 ⊆ (𝐶 ∩ 𝒫 𝐴) ∧ (𝐶 ∩ 𝒫 𝐴) ⊆ 𝒫 𝐴) → 𝑥 ⊆ 𝒫 𝐴)
16	1, 15	mpan2 703	. . . . . . 7 ⊢ (𝑥 ⊆ (𝐶 ∩ 𝒫 𝐴) → 𝑥 ⊆ 𝒫 𝐴)
17	16	3ad2ant2 1152	. . . . . 6 ⊢ (((𝐶 ∈ (Moore‘𝑋) ∧ 𝐴 ∈ 𝐶) ∧ 𝑥 ⊆ (𝐶 ∩ 𝒫 𝐴) ∧ 𝑥 ≠ ∅) → 𝑥 ⊆ 𝒫 𝐴)
18		intssuni2 4938	. . . . . 6 ⊢ ((𝑥 ⊆ 𝒫 𝐴 ∧ 𝑥 ≠ ∅) → ∩ 𝑥 ⊆ ∪ 𝒫 𝐴)
19	17, 12, 18	syl2anc 595	. . . . 5 ⊢ (((𝐶 ∈ (Moore‘𝑋) ∧ 𝐴 ∈ 𝐶) ∧ 𝑥 ⊆ (𝐶 ∩ 𝒫 𝐴) ∧ 𝑥 ≠ ∅) → ∩ 𝑥 ⊆ ∪ 𝒫 𝐴)
20		unipw 5431	. . . . 5 ⊢ ∪ 𝒫 𝐴 = 𝐴
21	19, 20	sseqtrdi 3977	. . . 4 ⊢ (((𝐶 ∈ (Moore‘𝑋) ∧ 𝐴 ∈ 𝐶) ∧ 𝑥 ⊆ (𝐶 ∩ 𝒫 𝐴) ∧ 𝑥 ≠ ∅) → ∩ 𝑥 ⊆ 𝐴)
22		elpw2g 5304	. . . . . 6 ⊢ (𝐴 ∈ 𝐶 → (∩ 𝑥 ∈ 𝒫 𝐴 ↔ ∩ 𝑥 ⊆ 𝐴))
23	22	adantl 486	. . . . 5 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝐴 ∈ 𝐶) → (∩ 𝑥 ∈ 𝒫 𝐴 ↔ ∩ 𝑥 ⊆ 𝐴))
24	23	3ad2ant1 1151	. . . 4 ⊢ (((𝐶 ∈ (Moore‘𝑋) ∧ 𝐴 ∈ 𝐶) ∧ 𝑥 ⊆ (𝐶 ∩ 𝒫 𝐴) ∧ 𝑥 ≠ ∅) → (∩ 𝑥 ∈ 𝒫 𝐴 ↔ ∩ 𝑥 ⊆ 𝐴))
25	21, 24	mpbird 260	. . 3 ⊢ (((𝐶 ∈ (Moore‘𝑋) ∧ 𝐴 ∈ 𝐶) ∧ 𝑥 ⊆ (𝐶 ∩ 𝒫 𝐴) ∧ 𝑥 ≠ ∅) → ∩ 𝑥 ∈ 𝒫 𝐴)
26	14, 25	elind 4153	. 2 ⊢ (((𝐶 ∈ (Moore‘𝑋) ∧ 𝐴 ∈ 𝐶) ∧ 𝑥 ⊆ (𝐶 ∩ 𝒫 𝐴) ∧ 𝑥 ≠ ∅) → ∩ 𝑥 ∈ (𝐶 ∩ 𝒫 𝐴))
27	2, 6, 26	ismred 17649	1 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝐴 ∈ 𝐶) → (𝐶 ∩ 𝒫 𝐴) ∈ (Moore‘𝐴))

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 400   ∧ w3a 1103   ∈ wcel 2143   ≠ wne 2958   ∩ cin 3904   ⊆ wss 3905  ∅c0 4286  𝒫 cpw 4562  ∪ cuni 4872  ∩ cint 4912  ‘cfv 6536  Moorecmre 17629

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-sep 5257  ax-nul 5269  ax-pow 5336  ax-pr 5404

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-int 4913  df-br 5110  df-opab 5174  df-mpt 5193  df-id 5556  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-iota 6492  df-fun 6538  df-fv 6544  df-mre 17633

This theorem is referenced by:  submrc  17679