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 34139

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 2736	. . . . 5 ⊢ (mPreSt‘𝑇) = (mPreSt‘𝑇)
2		mstaval.r	. . . . 5 ⊢ 𝑅 = (mStRed‘𝑇)
3	1, 2	msrf 34136	. . . 4 ⊢ 𝑅:(mPreSt‘𝑇)⟶(mPreSt‘𝑇)
4		ffn 6668	. . . 4 ⊢ (𝑅:(mPreSt‘𝑇)⟶(mPreSt‘𝑇) → 𝑅 Fn (mPreSt‘𝑇))
5		fvelrnb 6903	. . . 4 ⊢ (𝑅 Fn (mPreSt‘𝑇) → (𝑋 ∈ ran 𝑅 ↔ ∃𝑠 ∈ (mPreSt‘𝑇)(𝑅‘𝑠) = 𝑋))
6	3, 4, 5	mp2b 10	. . 3 ⊢ (𝑋 ∈ ran 𝑅 ↔ ∃𝑠 ∈ (mPreSt‘𝑇)(𝑅‘𝑠) = 𝑋)
7	1	mpst123 34134	. . . . . . . . . . 11 ⊢ (𝑠 ∈ (mPreSt‘𝑇) → 𝑠 = ⟨(1^st ‘(1^st ‘𝑠)), (2^nd ‘(1^st ‘𝑠)), (2^nd ‘𝑠)⟩)
8	7	fveq2d 6846	. . . . . . . . . 10 ⊢ (𝑠 ∈ (mPreSt‘𝑇) → (𝑅‘𝑠) = (𝑅‘⟨(1^st ‘(1^st ‘𝑠)), (2^nd ‘(1^st ‘𝑠)), (2^nd ‘𝑠)⟩))
9		id 22	. . . . . . . . . . . 12 ⊢ (𝑠 ∈ (mPreSt‘𝑇) → 𝑠 ∈ (mPreSt‘𝑇))
10	7, 9	eqeltrrd 2839	. . . . . . . . . . 11 ⊢ (𝑠 ∈ (mPreSt‘𝑇) → ⟨(1^st ‘(1^st ‘𝑠)), (2^nd ‘(1^st ‘𝑠)), (2^nd ‘𝑠)⟩ ∈ (mPreSt‘𝑇))
11		eqid 2736	. . . . . . . . . . . 12 ⊢ (mVars‘𝑇) = (mVars‘𝑇)
12		eqid 2736	. . . . . . . . . . . 12 ⊢ ∪ ((mVars‘𝑇) “ ((2^nd ‘(1^st ‘𝑠)) ∪ {(2^nd ‘𝑠)})) = ∪ ((mVars‘𝑇) “ ((2^nd ‘(1^st ‘𝑠)) ∪ {(2^nd ‘𝑠)}))
13	11, 1, 2, 12	msrval 34132	. . . . . . . . . . 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 2776	. . . . . . . . 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	ffvelcdmi 7034	. . . . . . . . 9 ⊢ (𝑠 ∈ (mPreSt‘𝑇) → (𝑅‘𝑠) ∈ (mPreSt‘𝑇))
17	15, 16	eqeltrrd 2839	. . . . . . . 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 34132	. . . . . . . 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 4179	. . . . . . . . . 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 4178	. . . . . . . . . . 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 4169	. . . . . . . . . 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 2764	. . . . . . . . 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 4842	. . . . . . 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 2776	. . . . . 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 6846	. . . . . 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 2786	. . . . 5 ⊢ (𝑠 ∈ (mPreSt‘𝑇) → (𝑅‘(𝑅‘𝑠)) = (𝑅‘𝑠))
29		fveq2 6842	. . . . . 6 ⊢ ((𝑅‘𝑠) = 𝑋 → (𝑅‘(𝑅‘𝑠)) = (𝑅‘𝑋))
30		id 22	. . . . . 6 ⊢ ((𝑅‘𝑠) = 𝑋 → (𝑅‘𝑠) = 𝑋)
31	29, 30	eqeq12d 2752	. . . . 5 ⊢ ((𝑅‘𝑠) = 𝑋 → ((𝑅‘(𝑅‘𝑠)) = (𝑅‘𝑠) ↔ (𝑅‘𝑋) = 𝑋))
32	28, 31	syl5ibcom 244	. . . 4 ⊢ (𝑠 ∈ (mPreSt‘𝑇) → ((𝑅‘𝑠) = 𝑋 → (𝑅‘𝑋) = 𝑋))
33	32	rexlimiv 3145	. . 3 ⊢ (∃𝑠 ∈ (mPreSt‘𝑇)(𝑅‘𝑠) = 𝑋 → (𝑅‘𝑋) = 𝑋)
34	6, 33	sylbi 216	. 2 ⊢ (𝑋 ∈ ran 𝑅 → (𝑅‘𝑋) = 𝑋)
35		mstaval.s	. . 3 ⊢ 𝑆 = (mStat‘𝑇)
36	2, 35	mstaval 34138	. 2 ⊢ 𝑆 = ran 𝑅
37	34, 36	eleq2s 2856	1 ⊢ (𝑋 ∈ 𝑆 → (𝑅‘𝑋) = 𝑋)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 = wceq 1541 ∈ wcel 2106 ∃wrex 3073 ∪ cun 3908 ∩ cin 3909 {csn 4586 ⟨cotp 4594 ∪ cuni 4865 × cxp 5631 ran crn 5634 “ cima 5636 Fn wfn 6491 ⟶wf 6492 ‘cfv 6496 1^st c1st 7919 2^nd c2nd 7920 mVarscmvrs 34063 mPreStcmpst 34067 mStRedcmsr 34068 mStatcmsta 34069

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 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2707 ax-rep 5242 ax-sep 5256 ax-nul 5263 ax-pow 5320 ax-pr 5384 ax-un 7672

This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2538 df-eu 2567 df-clab 2714 df-cleq 2728 df-clel 2814 df-nfc 2889 df-ne 2944 df-ral 3065 df-rex 3074 df-reu 3354 df-rab 3408 df-v 3447 df-sbc 3740 df-csb 3856 df-dif 3913 df-un 3915 df-in 3917 df-ss 3927 df-nul 4283 df-if 4487 df-pw 4562 df-sn 4587 df-pr 4589 df-op 4593 df-ot 4595 df-uni 4866 df-iun 4956 df-br 5106 df-opab 5168 df-mpt 5189 df-id 5531 df-xp 5639 df-rel 5640 df-cnv 5641 df-co 5642 df-dm 5643 df-rn 5644 df-res 5645 df-ima 5646 df-iota 6448 df-fun 6498 df-fn 6499 df-f 6500 df-f1 6501 df-fo 6502 df-f1o 6503 df-fv 6504 df-1st 7921 df-2nd 7922 df-mpst 34087 df-msr 34088 df-msta 34089

This theorem is referenced by: elmsta 34142

W3C validator