msrid - Mathbox for Mario Carneiro

	Mathbox for Mario Carneiro		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > msrid		Structured version Visualization version GIF version

Theorem msrid 31442

Description: The reduct of a statement is itself. (Contributed by Mario Carneiro, 18-Jul-2016.)

**Hypotheses**
Ref	Expression
mstaval.r	⊢ 𝑅 = (mStRed‘𝑇)
mstaval.s	⊢ 𝑆 = (mStat‘𝑇)

**Assertion**
Ref	Expression
msrid	⊢ (𝑋 ∈ 𝑆 → (𝑅‘𝑋) = 𝑋)

Proof of Theorem msrid Dummy variable 𝑠 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2622	. . . . 5 ⊢ (mPreSt‘𝑇) = (mPreSt‘𝑇)
2		mstaval.r	. . . . 5 ⊢ 𝑅 = (mStRed‘𝑇)
3	1, 2	msrf 31439	. . . 4 ⊢ 𝑅:(mPreSt‘𝑇)⟶(mPreSt‘𝑇)
4		ffn 6045	. . . 4 ⊢ (𝑅:(mPreSt‘𝑇)⟶(mPreSt‘𝑇) → 𝑅 Fn (mPreSt‘𝑇))
5		fvelrnb 6243	. . . 4 ⊢ (𝑅 Fn (mPreSt‘𝑇) → (𝑋 ∈ ran 𝑅 ↔ ∃𝑠 ∈ (mPreSt‘𝑇)(𝑅‘𝑠) = 𝑋))
6	3, 4, 5	mp2b 10	. . 3 ⊢ (𝑋 ∈ ran 𝑅 ↔ ∃𝑠 ∈ (mPreSt‘𝑇)(𝑅‘𝑠) = 𝑋)
7	1	mpst123 31437	. . . . . . . . . . 11 ⊢ (𝑠 ∈ (mPreSt‘𝑇) → 𝑠 = ⟨(1^st ‘(1^st ‘𝑠)), (2^nd ‘(1^st ‘𝑠)), (2^nd ‘𝑠)⟩)
8	7	fveq2d 6195	. . . . . . . . . 10 ⊢ (𝑠 ∈ (mPreSt‘𝑇) → (𝑅‘𝑠) = (𝑅‘⟨(1^st ‘(1^st ‘𝑠)), (2^nd ‘(1^st ‘𝑠)), (2^nd ‘𝑠)⟩))
9		id 22	. . . . . . . . . . . 12 ⊢ (𝑠 ∈ (mPreSt‘𝑇) → 𝑠 ∈ (mPreSt‘𝑇))
10	7, 9	eqeltrrd 2702	. . . . . . . . . . 11 ⊢ (𝑠 ∈ (mPreSt‘𝑇) → ⟨(1^st ‘(1^st ‘𝑠)), (2^nd ‘(1^st ‘𝑠)), (2^nd ‘𝑠)⟩ ∈ (mPreSt‘𝑇))
11		eqid 2622	. . . . . . . . . . . 12 ⊢ (mVars‘𝑇) = (mVars‘𝑇)
12		eqid 2622	. . . . . . . . . . . 12 ⊢ ∪ ((mVars‘𝑇) “ ((2^nd ‘(1^st ‘𝑠)) ∪ {(2^nd ‘𝑠)})) = ∪ ((mVars‘𝑇) “ ((2^nd ‘(1^st ‘𝑠)) ∪ {(2^nd ‘𝑠)}))
13	11, 1, 2, 12	msrval 31435	. . . . . . . . . . 11 ⊢ (⟨(1^st ‘(1^st ‘𝑠)), (2^nd ‘(1^st ‘𝑠)), (2^nd ‘𝑠)⟩ ∈ (mPreSt‘𝑇) → (𝑅‘⟨(1^st ‘(1^st ‘𝑠)), (2^nd ‘(1^st ‘𝑠)), (2^nd ‘𝑠)⟩) = ⟨((1^st ‘(1^st ‘𝑠)) ∩ (∪ ((mVars‘𝑇) “ ((2^nd ‘(1^st ‘𝑠)) ∪ {(2^nd ‘𝑠)})) × ∪ ((mVars‘𝑇) “ ((2^nd ‘(1^st ‘𝑠)) ∪ {(2^nd ‘𝑠)})))), (2^nd ‘(1^st ‘𝑠)), (2^nd ‘𝑠)⟩)
14	10, 13	syl 17	. . . . . . . . . 10 ⊢ (𝑠 ∈ (mPreSt‘𝑇) → (𝑅‘⟨(1^st ‘(1^st ‘𝑠)), (2^nd ‘(1^st ‘𝑠)), (2^nd ‘𝑠)⟩) = ⟨((1^st ‘(1^st ‘𝑠)) ∩ (∪ ((mVars‘𝑇) “ ((2^nd ‘(1^st ‘𝑠)) ∪ {(2^nd ‘𝑠)})) × ∪ ((mVars‘𝑇) “ ((2^nd ‘(1^st ‘𝑠)) ∪ {(2^nd ‘𝑠)})))), (2^nd ‘(1^st ‘𝑠)), (2^nd ‘𝑠)⟩)
15	8, 14	eqtrd 2656	. . . . . . . . 9 ⊢ (𝑠 ∈ (mPreSt‘𝑇) → (𝑅‘𝑠) = ⟨((1^st ‘(1^st ‘𝑠)) ∩ (∪ ((mVars‘𝑇) “ ((2^nd ‘(1^st ‘𝑠)) ∪ {(2^nd ‘𝑠)})) × ∪ ((mVars‘𝑇) “ ((2^nd ‘(1^st ‘𝑠)) ∪ {(2^nd ‘𝑠)})))), (2^nd ‘(1^st ‘𝑠)), (2^nd ‘𝑠)⟩)
16	3	ffvelrni 6358	. . . . . . . . 9 ⊢ (𝑠 ∈ (mPreSt‘𝑇) → (𝑅‘𝑠) ∈ (mPreSt‘𝑇))
17	15, 16	eqeltrrd 2702	. . . . . . . 8 ⊢ (𝑠 ∈ (mPreSt‘𝑇) → ⟨((1^st ‘(1^st ‘𝑠)) ∩ (∪ ((mVars‘𝑇) “ ((2^nd ‘(1^st ‘𝑠)) ∪ {(2^nd ‘𝑠)})) × ∪ ((mVars‘𝑇) “ ((2^nd ‘(1^st ‘𝑠)) ∪ {(2^nd ‘𝑠)})))), (2^nd ‘(1^st ‘𝑠)), (2^nd ‘𝑠)⟩ ∈ (mPreSt‘𝑇))
18	11, 1, 2, 12	msrval 31435	. . . . . . . 8 ⊢ (⟨((1^st ‘(1^st ‘𝑠)) ∩ (∪ ((mVars‘𝑇) “ ((2^nd ‘(1^st ‘𝑠)) ∪ {(2^nd ‘𝑠)})) × ∪ ((mVars‘𝑇) “ ((2^nd ‘(1^st ‘𝑠)) ∪ {(2^nd ‘𝑠)})))), (2^nd ‘(1^st ‘𝑠)), (2^nd ‘𝑠)⟩ ∈ (mPreSt‘𝑇) → (𝑅‘⟨((1^st ‘(1^st ‘𝑠)) ∩ (∪ ((mVars‘𝑇) “ ((2^nd ‘(1^st ‘𝑠)) ∪ {(2^nd ‘𝑠)})) × ∪ ((mVars‘𝑇) “ ((2^nd ‘(1^st ‘𝑠)) ∪ {(2^nd ‘𝑠)})))), (2^nd ‘(1^st ‘𝑠)), (2^nd ‘𝑠)⟩) = ⟨(((1^st ‘(1^st ‘𝑠)) ∩ (∪ ((mVars‘𝑇) “ ((2^nd ‘(1^st ‘𝑠)) ∪ {(2^nd ‘𝑠)})) × ∪ ((mVars‘𝑇) “ ((2^nd ‘(1^st ‘𝑠)) ∪ {(2^nd ‘𝑠)})))) ∩ (∪ ((mVars‘𝑇) “ ((2^nd ‘(1^st ‘𝑠)) ∪ {(2^nd ‘𝑠)})) × ∪ ((mVars‘𝑇) “ ((2^nd ‘(1^st ‘𝑠)) ∪ {(2^nd ‘𝑠)})))), (2^nd ‘(1^st ‘𝑠)), (2^nd ‘𝑠)⟩)
19	17, 18	syl 17	. . . . . . 7 ⊢ (𝑠 ∈ (mPreSt‘𝑇) → (𝑅‘⟨((1^st ‘(1^st ‘𝑠)) ∩ (∪ ((mVars‘𝑇) “ ((2^nd ‘(1^st ‘𝑠)) ∪ {(2^nd ‘𝑠)})) × ∪ ((mVars‘𝑇) “ ((2^nd ‘(1^st ‘𝑠)) ∪ {(2^nd ‘𝑠)})))), (2^nd ‘(1^st ‘𝑠)), (2^nd ‘𝑠)⟩) = ⟨(((1^st ‘(1^st ‘𝑠)) ∩ (∪ ((mVars‘𝑇) “ ((2^nd ‘(1^st ‘𝑠)) ∪ {(2^nd ‘𝑠)})) × ∪ ((mVars‘𝑇) “ ((2^nd ‘(1^st ‘𝑠)) ∪ {(2^nd ‘𝑠)})))) ∩ (∪ ((mVars‘𝑇) “ ((2^nd ‘(1^st ‘𝑠)) ∪ {(2^nd ‘𝑠)})) × ∪ ((mVars‘𝑇) “ ((2^nd ‘(1^st ‘𝑠)) ∪ {(2^nd ‘𝑠)})))), (2^nd ‘(1^st ‘𝑠)), (2^nd ‘𝑠)⟩)
20		inass 3823	. . . . . . . . . 10 ⊢ (((1^st ‘(1^st ‘𝑠)) ∩ (∪ ((mVars‘𝑇) “ ((2^nd ‘(1^st ‘𝑠)) ∪ {(2^nd ‘𝑠)})) × ∪ ((mVars‘𝑇) “ ((2^nd ‘(1^st ‘𝑠)) ∪ {(2^nd ‘𝑠)})))) ∩ (∪ ((mVars‘𝑇) “ ((2^nd ‘(1^st ‘𝑠)) ∪ {(2^nd ‘𝑠)})) × ∪ ((mVars‘𝑇) “ ((2^nd ‘(1^st ‘𝑠)) ∪ {(2^nd ‘𝑠)})))) = ((1^st ‘(1^st ‘𝑠)) ∩ ((∪ ((mVars‘𝑇) “ ((2^nd ‘(1^st ‘𝑠)) ∪ {(2^nd ‘𝑠)})) × ∪ ((mVars‘𝑇) “ ((2^nd ‘(1^st ‘𝑠)) ∪ {(2^nd ‘𝑠)}))) ∩ (∪ ((mVars‘𝑇) “ ((2^nd ‘(1^st ‘𝑠)) ∪ {(2^nd ‘𝑠)})) × ∪ ((mVars‘𝑇) “ ((2^nd ‘(1^st ‘𝑠)) ∪ {(2^nd ‘𝑠)})))))
21		inidm 3822	. . . . . . . . . . 11 ⊢ ((∪ ((mVars‘𝑇) “ ((2^nd ‘(1^st ‘𝑠)) ∪ {(2^nd ‘𝑠)})) × ∪ ((mVars‘𝑇) “ ((2^nd ‘(1^st ‘𝑠)) ∪ {(2^nd ‘𝑠)}))) ∩ (∪ ((mVars‘𝑇) “ ((2^nd ‘(1^st ‘𝑠)) ∪ {(2^nd ‘𝑠)})) × ∪ ((mVars‘𝑇) “ ((2^nd ‘(1^st ‘𝑠)) ∪ {(2^nd ‘𝑠)})))) = (∪ ((mVars‘𝑇) “ ((2^nd ‘(1^st ‘𝑠)) ∪ {(2^nd ‘𝑠)})) × ∪ ((mVars‘𝑇) “ ((2^nd ‘(1^st ‘𝑠)) ∪ {(2^nd ‘𝑠)})))
22	21	ineq2i 3811	. . . . . . . . . 10 ⊢ ((1^st ‘(1^st ‘𝑠)) ∩ ((∪ ((mVars‘𝑇) “ ((2^nd ‘(1^st ‘𝑠)) ∪ {(2^nd ‘𝑠)})) × ∪ ((mVars‘𝑇) “ ((2^nd ‘(1^st ‘𝑠)) ∪ {(2^nd ‘𝑠)}))) ∩ (∪ ((mVars‘𝑇) “ ((2^nd ‘(1^st ‘𝑠)) ∪ {(2^nd ‘𝑠)})) × ∪ ((mVars‘𝑇) “ ((2^nd ‘(1^st ‘𝑠)) ∪ {(2^nd ‘𝑠)}))))) = ((1^st ‘(1^st ‘𝑠)) ∩ (∪ ((mVars‘𝑇) “ ((2^nd ‘(1^st ‘𝑠)) ∪ {(2^nd ‘𝑠)})) × ∪ ((mVars‘𝑇) “ ((2^nd ‘(1^st ‘𝑠)) ∪ {(2^nd ‘𝑠)}))))
23	20, 22	eqtri 2644	. . . . . . . . 9 ⊢ (((1^st ‘(1^st ‘𝑠)) ∩ (∪ ((mVars‘𝑇) “ ((2^nd ‘(1^st ‘𝑠)) ∪ {(2^nd ‘𝑠)})) × ∪ ((mVars‘𝑇) “ ((2^nd ‘(1^st ‘𝑠)) ∪ {(2^nd ‘𝑠)})))) ∩ (∪ ((mVars‘𝑇) “ ((2^nd ‘(1^st ‘𝑠)) ∪ {(2^nd ‘𝑠)})) × ∪ ((mVars‘𝑇) “ ((2^nd ‘(1^st ‘𝑠)) ∪ {(2^nd ‘𝑠)})))) = ((1^st ‘(1^st ‘𝑠)) ∩ (∪ ((mVars‘𝑇) “ ((2^nd ‘(1^st ‘𝑠)) ∪ {(2^nd ‘𝑠)})) × ∪ ((mVars‘𝑇) “ ((2^nd ‘(1^st ‘𝑠)) ∪ {(2^nd ‘𝑠)}))))
24	23	a1i 11	. . . . . . . 8 ⊢ (𝑠 ∈ (mPreSt‘𝑇) → (((1^st ‘(1^st ‘𝑠)) ∩ (∪ ((mVars‘𝑇) “ ((2^nd ‘(1^st ‘𝑠)) ∪ {(2^nd ‘𝑠)})) × ∪ ((mVars‘𝑇) “ ((2^nd ‘(1^st ‘𝑠)) ∪ {(2^nd ‘𝑠)})))) ∩ (∪ ((mVars‘𝑇) “ ((2^nd ‘(1^st ‘𝑠)) ∪ {(2^nd ‘𝑠)})) × ∪ ((mVars‘𝑇) “ ((2^nd ‘(1^st ‘𝑠)) ∪ {(2^nd ‘𝑠)})))) = ((1^st ‘(1^st ‘𝑠)) ∩ (∪ ((mVars‘𝑇) “ ((2^nd ‘(1^st ‘𝑠)) ∪ {(2^nd ‘𝑠)})) × ∪ ((mVars‘𝑇) “ ((2^nd ‘(1^st ‘𝑠)) ∪ {(2^nd ‘𝑠)})))))
25	24	oteq1d 4414	. . . . . . 7 ⊢ (𝑠 ∈ (mPreSt‘𝑇) → ⟨(((1^st ‘(1^st ‘𝑠)) ∩ (∪ ((mVars‘𝑇) “ ((2^nd ‘(1^st ‘𝑠)) ∪ {(2^nd ‘𝑠)})) × ∪ ((mVars‘𝑇) “ ((2^nd ‘(1^st ‘𝑠)) ∪ {(2^nd ‘𝑠)})))) ∩ (∪ ((mVars‘𝑇) “ ((2^nd ‘(1^st ‘𝑠)) ∪ {(2^nd ‘𝑠)})) × ∪ ((mVars‘𝑇) “ ((2^nd ‘(1^st ‘𝑠)) ∪ {(2^nd ‘𝑠)})))), (2^nd ‘(1^st ‘𝑠)), (2^nd ‘𝑠)⟩ = ⟨((1^st ‘(1^st ‘𝑠)) ∩ (∪ ((mVars‘𝑇) “ ((2^nd ‘(1^st ‘𝑠)) ∪ {(2^nd ‘𝑠)})) × ∪ ((mVars‘𝑇) “ ((2^nd ‘(1^st ‘𝑠)) ∪ {(2^nd ‘𝑠)})))), (2^nd ‘(1^st ‘𝑠)), (2^nd ‘𝑠)⟩)
26	19, 25	eqtrd 2656	. . . . . 6 ⊢ (𝑠 ∈ (mPreSt‘𝑇) → (𝑅‘⟨((1^st ‘(1^st ‘𝑠)) ∩ (∪ ((mVars‘𝑇) “ ((2^nd ‘(1^st ‘𝑠)) ∪ {(2^nd ‘𝑠)})) × ∪ ((mVars‘𝑇) “ ((2^nd ‘(1^st ‘𝑠)) ∪ {(2^nd ‘𝑠)})))), (2^nd ‘(1^st ‘𝑠)), (2^nd ‘𝑠)⟩) = ⟨((1^st ‘(1^st ‘𝑠)) ∩ (∪ ((mVars‘𝑇) “ ((2^nd ‘(1^st ‘𝑠)) ∪ {(2^nd ‘𝑠)})) × ∪ ((mVars‘𝑇) “ ((2^nd ‘(1^st ‘𝑠)) ∪ {(2^nd ‘𝑠)})))), (2^nd ‘(1^st ‘𝑠)), (2^nd ‘𝑠)⟩)
27	15	fveq2d 6195	. . . . . 6 ⊢ (𝑠 ∈ (mPreSt‘𝑇) → (𝑅‘(𝑅‘𝑠)) = (𝑅‘⟨((1^st ‘(1^st ‘𝑠)) ∩ (∪ ((mVars‘𝑇) “ ((2^nd ‘(1^st ‘𝑠)) ∪ {(2^nd ‘𝑠)})) × ∪ ((mVars‘𝑇) “ ((2^nd ‘(1^st ‘𝑠)) ∪ {(2^nd ‘𝑠)})))), (2^nd ‘(1^st ‘𝑠)), (2^nd ‘𝑠)⟩))
28	26, 27, 15	3eqtr4d 2666	. . . . 5 ⊢ (𝑠 ∈ (mPreSt‘𝑇) → (𝑅‘(𝑅‘𝑠)) = (𝑅‘𝑠))
29		fveq2 6191	. . . . . 6 ⊢ ((𝑅‘𝑠) = 𝑋 → (𝑅‘(𝑅‘𝑠)) = (𝑅‘𝑋))
30		id 22	. . . . . 6 ⊢ ((𝑅‘𝑠) = 𝑋 → (𝑅‘𝑠) = 𝑋)
31	29, 30	eqeq12d 2637	. . . . 5 ⊢ ((𝑅‘𝑠) = 𝑋 → ((𝑅‘(𝑅‘𝑠)) = (𝑅‘𝑠) ↔ (𝑅‘𝑋) = 𝑋))
32	28, 31	syl5ibcom 235	. . . 4 ⊢ (𝑠 ∈ (mPreSt‘𝑇) → ((𝑅‘𝑠) = 𝑋 → (𝑅‘𝑋) = 𝑋))
33	32	rexlimiv 3027	. . 3 ⊢ (∃𝑠 ∈ (mPreSt‘𝑇)(𝑅‘𝑠) = 𝑋 → (𝑅‘𝑋) = 𝑋)
34	6, 33	sylbi 207	. 2 ⊢ (𝑋 ∈ ran 𝑅 → (𝑅‘𝑋) = 𝑋)
35		mstaval.s	. . 3 ⊢ 𝑆 = (mStat‘𝑇)
36	2, 35	mstaval 31441	. 2 ⊢ 𝑆 = ran 𝑅
37	34, 36	eleq2s 2719	1 ⊢ (𝑋 ∈ 𝑆 → (𝑅‘𝑋) = 𝑋)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 196 = wceq 1483 ∈ wcel 1990 ∃wrex 2913 ∪ cun 3572 ∩ cin 3573 {csn 4177 ⟨cotp 4185 ∪ cuni 4436 × cxp 5112 ran crn 5115 “ cima 5117 Fn wfn 5883 ⟶wf 5884 ‘cfv 5888 1^st c1st 7166 2^nd c2nd 7167 mVarscmvrs 31366 mPreStcmpst 31370 mStRedcmsr 31371 mStatcmsta 31372

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-8 1992 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-rep 4771 ax-sep 4781 ax-nul 4789 ax-pow 4843 ax-pr 4906 ax-un 6949

This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3an 1039 df-tru 1486 df-fal 1489 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-ral 2917 df-rex 2918 df-reu 2919 df-rab 2921 df-v 3202 df-sbc 3436 df-csb 3534 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-nul 3916 df-if 4087 df-pw 4160 df-sn 4178 df-pr 4180 df-op 4184 df-ot 4186 df-uni 4437 df-iun 4522 df-br 4654 df-opab 4713 df-mpt 4730 df-id 5024 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-rn 5125 df-res 5126 df-ima 5127 df-iota 5851 df-fun 5890 df-fn 5891 df-f 5892 df-f1 5893 df-fo 5894 df-f1o 5895 df-fv 5896 df-1st 7168 df-2nd 7169 df-mpst 31390 df-msr 31391 df-msta 31392

This theorem is referenced by: elmsta 31445

W3C validator