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 35758

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 2737	. . . . 5 ⊢ (mPreSt‘𝑇) = (mPreSt‘𝑇)
2		mstaval.r	. . . . 5 ⊢ 𝑅 = (mStRed‘𝑇)
3	1, 2	msrf 35755	. . . 4 ⊢ 𝑅:(mPreSt‘𝑇)⟶(mPreSt‘𝑇)
4		ffn 6670	. . . 4 ⊢ (𝑅:(mPreSt‘𝑇)⟶(mPreSt‘𝑇) → 𝑅 Fn (mPreSt‘𝑇))
5		fvelrnb 6902	. . . 4 ⊢ (𝑅 Fn (mPreSt‘𝑇) → (𝑋 ∈ ran 𝑅 ↔ ∃𝑠 ∈ (mPreSt‘𝑇)(𝑅‘𝑠) = 𝑋))
6	3, 4, 5	mp2b 10	. . 3 ⊢ (𝑋 ∈ ran 𝑅 ↔ ∃𝑠 ∈ (mPreSt‘𝑇)(𝑅‘𝑠) = 𝑋)
7	1	mpst123 35753	. . . . . . . . . . 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 2838	. . . . . . . . . . 11 ⊢ (𝑠 ∈ (mPreSt‘𝑇) → ⟨(1^st ‘(1^st ‘𝑠)), (2^nd ‘(1^st ‘𝑠)), (2^nd ‘𝑠)⟩ ∈ (mPreSt‘𝑇))
11		eqid 2737	. . . . . . . . . . . 12 ⊢ (mVars‘𝑇) = (mVars‘𝑇)
12		eqid 2737	. . . . . . . . . . . 12 ⊢ ∪ ((mVars‘𝑇) “ ((2^nd ‘(1^st ‘𝑠)) ∪ {(2^nd ‘𝑠)})) = ∪ ((mVars‘𝑇) “ ((2^nd ‘(1^st ‘𝑠)) ∪ {(2^nd ‘𝑠)}))
13	11, 1, 2, 12	msrval 35751	. . . . . . . . . . 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 2772	. . . . . . . . 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 7037	. . . . . . . . 9 ⊢ (𝑠 ∈ (mPreSt‘𝑇) → (𝑅‘𝑠) ∈ (mPreSt‘𝑇))
17	15, 16	eqeltrrd 2838	. . . . . . . 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 35751	. . . . . . . 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 4182	. . . . . . . . . 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 4181	. . . . . . . . . . 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 4171	. . . . . . . . . 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 2760	. . . . . . . . 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 4843	. . . . . . 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 2772	. . . . . 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 2782	. . . . 5 ⊢ (𝑠 ∈ (mPreSt‘𝑇) → (𝑅‘(𝑅‘𝑠)) = (𝑅‘𝑠))
29		fveq2 6842	. . . . . 6 ⊢ ((𝑅‘𝑠) = 𝑋 → (𝑅‘(𝑅‘𝑠)) = (𝑅‘𝑋))
30		id 22	. . . . . 6 ⊢ ((𝑅‘𝑠) = 𝑋 → (𝑅‘𝑠) = 𝑋)
31	29, 30	eqeq12d 2753	. . . . 5 ⊢ ((𝑅‘𝑠) = 𝑋 → ((𝑅‘(𝑅‘𝑠)) = (𝑅‘𝑠) ↔ (𝑅‘𝑋) = 𝑋))
32	28, 31	syl5ibcom 245	. . . 4 ⊢ (𝑠 ∈ (mPreSt‘𝑇) → ((𝑅‘𝑠) = 𝑋 → (𝑅‘𝑋) = 𝑋))
33	32	rexlimiv 3132	. . 3 ⊢ (∃𝑠 ∈ (mPreSt‘𝑇)(𝑅‘𝑠) = 𝑋 → (𝑅‘𝑋) = 𝑋)
34	6, 33	sylbi 217	. 2 ⊢ (𝑋 ∈ ran 𝑅 → (𝑅‘𝑋) = 𝑋)
35		mstaval.s	. . 3 ⊢ 𝑆 = (mStat‘𝑇)
36	2, 35	mstaval 35757	. 2 ⊢ 𝑆 = ran 𝑅
37	34, 36	eleq2s 2855	1 ⊢ (𝑋 ∈ 𝑆 → (𝑅‘𝑋) = 𝑋)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 206 = wceq 1542 ∈ wcel 2114 ∃wrex 3062 ∪ cun 3901 ∩ cin 3902 {csn 4582 ⟨cotp 4590 ∪ cuni 4865 × cxp 5630 ran crn 5633 “ cima 5635 Fn wfn 6495 ⟶wf 6496 ‘cfv 6500 1^st c1st 7941 2^nd c2nd 7942 mVarscmvrs 35682 mPreStcmpst 35686 mStRedcmsr 35687 mStatcmsta 35688

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 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5226 ax-sep 5243 ax-nul 5253 ax-pow 5312 ax-pr 5379 ax-un 7690

This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3063 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-ot 4591 df-uni 4866 df-iun 4950 df-br 5101 df-opab 5163 df-mpt 5182 df-id 5527 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-iota 6456 df-fun 6502 df-fn 6503 df-f 6504 df-f1 6505 df-fo 6506 df-f1o 6507 df-fv 6508 df-1st 7943 df-2nd 7944 df-mpst 35706 df-msr 35707 df-msta 35708

This theorem is referenced by: elmsta 35761

W3C validator