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 35532

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 2729	. . . . 5 ⊢ (mPreSt‘𝑇) = (mPreSt‘𝑇)
2		mstaval.r	. . . . 5 ⊢ 𝑅 = (mStRed‘𝑇)
3	1, 2	msrf 35529	. . . 4 ⊢ 𝑅:(mPreSt‘𝑇)⟶(mPreSt‘𝑇)
4		ffn 6688	. . . 4 ⊢ (𝑅:(mPreSt‘𝑇)⟶(mPreSt‘𝑇) → 𝑅 Fn (mPreSt‘𝑇))
5		fvelrnb 6921	. . . 4 ⊢ (𝑅 Fn (mPreSt‘𝑇) → (𝑋 ∈ ran 𝑅 ↔ ∃𝑠 ∈ (mPreSt‘𝑇)(𝑅‘𝑠) = 𝑋))
6	3, 4, 5	mp2b 10	. . 3 ⊢ (𝑋 ∈ ran 𝑅 ↔ ∃𝑠 ∈ (mPreSt‘𝑇)(𝑅‘𝑠) = 𝑋)
7	1	mpst123 35527	. . . . . . . . . . 11 ⊢ (𝑠 ∈ (mPreSt‘𝑇) → 𝑠 = ⟨(1^st ‘(1^st ‘𝑠)), (2^nd ‘(1^st ‘𝑠)), (2^nd ‘𝑠)⟩)
8	7	fveq2d 6862	. . . . . . . . . 10 ⊢ (𝑠 ∈ (mPreSt‘𝑇) → (𝑅‘𝑠) = (𝑅‘⟨(1^st ‘(1^st ‘𝑠)), (2^nd ‘(1^st ‘𝑠)), (2^nd ‘𝑠)⟩))
9		id 22	. . . . . . . . . . . 12 ⊢ (𝑠 ∈ (mPreSt‘𝑇) → 𝑠 ∈ (mPreSt‘𝑇))
10	7, 9	eqeltrrd 2829	. . . . . . . . . . 11 ⊢ (𝑠 ∈ (mPreSt‘𝑇) → ⟨(1^st ‘(1^st ‘𝑠)), (2^nd ‘(1^st ‘𝑠)), (2^nd ‘𝑠)⟩ ∈ (mPreSt‘𝑇))
11		eqid 2729	. . . . . . . . . . . 12 ⊢ (mVars‘𝑇) = (mVars‘𝑇)
12		eqid 2729	. . . . . . . . . . . 12 ⊢ ∪ ((mVars‘𝑇) “ ((2^nd ‘(1^st ‘𝑠)) ∪ {(2^nd ‘𝑠)})) = ∪ ((mVars‘𝑇) “ ((2^nd ‘(1^st ‘𝑠)) ∪ {(2^nd ‘𝑠)}))
13	11, 1, 2, 12	msrval 35525	. . . . . . . . . . 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 2764	. . . . . . . . 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 7055	. . . . . . . . 9 ⊢ (𝑠 ∈ (mPreSt‘𝑇) → (𝑅‘𝑠) ∈ (mPreSt‘𝑇))
17	15, 16	eqeltrrd 2829	. . . . . . . 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 35525	. . . . . . . 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 4191	. . . . . . . . . 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 4190	. . . . . . . . . . 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 4180	. . . . . . . . . 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 2752	. . . . . . . . 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 4849	. . . . . . 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 2764	. . . . . 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 6862	. . . . . 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 2774	. . . . 5 ⊢ (𝑠 ∈ (mPreSt‘𝑇) → (𝑅‘(𝑅‘𝑠)) = (𝑅‘𝑠))
29		fveq2 6858	. . . . . 6 ⊢ ((𝑅‘𝑠) = 𝑋 → (𝑅‘(𝑅‘𝑠)) = (𝑅‘𝑋))
30		id 22	. . . . . 6 ⊢ ((𝑅‘𝑠) = 𝑋 → (𝑅‘𝑠) = 𝑋)
31	29, 30	eqeq12d 2745	. . . . 5 ⊢ ((𝑅‘𝑠) = 𝑋 → ((𝑅‘(𝑅‘𝑠)) = (𝑅‘𝑠) ↔ (𝑅‘𝑋) = 𝑋))
32	28, 31	syl5ibcom 245	. . . 4 ⊢ (𝑠 ∈ (mPreSt‘𝑇) → ((𝑅‘𝑠) = 𝑋 → (𝑅‘𝑋) = 𝑋))
33	32	rexlimiv 3127	. . 3 ⊢ (∃𝑠 ∈ (mPreSt‘𝑇)(𝑅‘𝑠) = 𝑋 → (𝑅‘𝑋) = 𝑋)
34	6, 33	sylbi 217	. 2 ⊢ (𝑋 ∈ ran 𝑅 → (𝑅‘𝑋) = 𝑋)
35		mstaval.s	. . 3 ⊢ 𝑆 = (mStat‘𝑇)
36	2, 35	mstaval 35531	. 2 ⊢ 𝑆 = ran 𝑅
37	34, 36	eleq2s 2846	1 ⊢ (𝑋 ∈ 𝑆 → (𝑅‘𝑋) = 𝑋)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 206 = wceq 1540 ∈ wcel 2109 ∃wrex 3053 ∪ cun 3912 ∩ cin 3913 {csn 4589 ⟨cotp 4597 ∪ cuni 4871 × cxp 5636 ran crn 5639 “ cima 5641 Fn wfn 6506 ⟶wf 6507 ‘cfv 6511 1^st c1st 7966 2^nd c2nd 7967 mVarscmvrs 35456 mPreStcmpst 35460 mStRedcmsr 35461 mStatcmsta 35462

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-rep 5234 ax-sep 5251 ax-nul 5261 ax-pow 5320 ax-pr 5387 ax-un 7711

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-ral 3045 df-rex 3054 df-reu 3355 df-rab 3406 df-v 3449 df-sbc 3754 df-csb 3863 df-dif 3917 df-un 3919 df-in 3921 df-ss 3931 df-nul 4297 df-if 4489 df-pw 4565 df-sn 4590 df-pr 4592 df-op 4596 df-ot 4598 df-uni 4872 df-iun 4957 df-br 5108 df-opab 5170 df-mpt 5189 df-id 5533 df-xp 5644 df-rel 5645 df-cnv 5646 df-co 5647 df-dm 5648 df-rn 5649 df-res 5650 df-ima 5651 df-iota 6464 df-fun 6513 df-fn 6514 df-f 6515 df-f1 6516 df-fo 6517 df-f1o 6518 df-fv 6519 df-1st 7968 df-2nd 7969 df-mpst 35480 df-msr 35481 df-msta 35482

This theorem is referenced by: elmsta 35535

W3C validator