mressmrcd - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > mressmrcd		Structured version Visualization version GIF version

Theorem mressmrcd 17813

Description: In a Moore system, if a set is between another set and its closure, the two sets have the same closure. Deduction form. (Contributed by David Moews, 1-May-2017.)

**Hypotheses**
Ref	Expression
mressmrcd.1	⊢ (𝜑 → 𝐴 ∈ (Moore‘𝑋))
mressmrcd.2	⊢ 𝑁 = (mrCls‘𝐴)
mressmrcd.3	⊢ (𝜑 → 𝑆 ⊆ (𝑁‘𝑇))
mressmrcd.4	⊢ (𝜑 → 𝑇 ⊆ 𝑆)

**Assertion**
Ref	Expression
mressmrcd	⊢ (𝜑 → (𝑁‘𝑆) = (𝑁‘𝑇))

**Proof of Theorem mressmrcd**
Step	Hyp	Ref	Expression
1		mressmrcd.1	. . . 4 ⊢ (𝜑 → 𝐴 ∈ (Moore‘𝑋))
2		mressmrcd.2	. . . 4 ⊢ 𝑁 = (mrCls‘𝐴)
3		mressmrcd.3	. . . 4 ⊢ (𝜑 → 𝑆 ⊆ (𝑁‘𝑇))
4	1, 2	mrcssvd 17809	. . . 4 ⊢ (𝜑 → (𝑁‘𝑇) ⊆ 𝑋)
5	1, 2, 3, 4	mrcssd 17810	. . 3 ⊢ (𝜑 → (𝑁‘𝑆) ⊆ (𝑁‘(𝑁‘𝑇)))
6		mressmrcd.4	. . . . 5 ⊢ (𝜑 → 𝑇 ⊆ 𝑆)
7	3, 4	sstrd 3922	. . . . 5 ⊢ (𝜑 → 𝑆 ⊆ 𝑋)
8	6, 7	sstrd 3922	. . . 4 ⊢ (𝜑 → 𝑇 ⊆ 𝑋)
9	1, 2, 8	mrcidmd 17812	. . 3 ⊢ (𝜑 → (𝑁‘(𝑁‘𝑇)) = (𝑁‘𝑇))
10	5, 9	sseqtrd 3948	. 2 ⊢ (𝜑 → (𝑁‘𝑆) ⊆ (𝑁‘𝑇))
11	1, 2, 6, 7	mrcssd 17810	. 2 ⊢ (𝜑 → (𝑁‘𝑇) ⊆ (𝑁‘𝑆))
12	10, 11	eqssd 3929	1 ⊢ (𝜑 → (𝑁‘𝑆) = (𝑁‘𝑇))

Colors of variables: wff setvar class

This proof depends on syntax axioms: → wi 4 = wceq 1569 ∈ wcel 2146 ⊆ wss 3899 ‘cfv 6546 Moorecmre 17764 mrClscmrc 17765

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1944 ax-6 2001 ax-7 2042 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2196 ax-12 2215 ax-ext 2735 ax-sep 5251 ax-nul 5262 ax-pow 5330 ax-pr 5394 ax-un 7758

This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2101 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 3416 df-v 3455 df-sbc 3742 df-csb 3851 df-ss 3900 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-pw 4561 df-sn 4588 df-pr 4590 df-op 4838 df-uni 4870 df-int 4910 df-br 5106 df-opab 5170 df-mpt 5189 df-id 5549 df-xp 5660 df-rel 5661 df-cnv 5662 df-co 5663 df-dm 5664 df-rn 5665 df-res 5666 df-ima 5667 df-iota 6500 df-fun 6548 df-fn 6549 df-f 6550 df-fv 6554 df-mre 17768 df-mrc 17769

This theorem is used by: mrieqvlemd 17815 mrissmrcd 17826

W3C validator