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 17801

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 17797	. . . 4 ⊢ (𝜑 → (𝑁‘𝑇) ⊆ 𝑋)
5	1, 2, 3, 4	mrcssd 17798	. . 3 ⊢ (𝜑 → (𝑁‘𝑆) ⊆ (𝑁‘(𝑁‘𝑇)))
6		mressmrcd.4	. . . . 5 ⊢ (𝜑 → 𝑇 ⊆ 𝑆)
7	3, 4	sstrd 3941	. . . . 5 ⊢ (𝜑 → 𝑆 ⊆ 𝑋)
8	6, 7	sstrd 3941	. . . 4 ⊢ (𝜑 → 𝑇 ⊆ 𝑋)
9	1, 2, 8	mrcidmd 17800	. . 3 ⊢ (𝜑 → (𝑁‘(𝑁‘𝑇)) = (𝑁‘𝑇))
10	5, 9	sseqtrd 3967	. 2 ⊢ (𝜑 → (𝑁‘𝑆) ⊆ (𝑁‘𝑇))
11	1, 2, 6, 7	mrcssd 17798	. 2 ⊢ (𝜑 → (𝑁‘𝑇) ⊆ (𝑁‘𝑆))
12	10, 11	eqssd 3948	1 ⊢ (𝜑 → (𝑁‘𝑆) = (𝑁‘𝑇))

Colors of variables: wff setvar class

This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2145 ⊆ wss 3899 ‘cfv 6538 Moorecmre 17752 mrClscmrc 17753

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7751

This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3078 df-rex 3088 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-int 4908 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5546 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-fv 6546 df-mre 17756 df-mrc 17757

This theorem is used by: mrieqvlemd 17803 mrissmrcd 17814

W3C validator