Theorem msrrcl 36035

Description: If 𝑋 and 𝑌 have the same reduct, then one is a pre-statement iff the other is. (Contributed by Mario Carneiro, 18-Jul-2016.)

Hypotheses

Ref	Expression
mpstssv.p	⊢ 𝑃 = (mPreSt‘𝑇)
msrf.r	⊢ 𝑅 = (mStRed‘𝑇)

Assertion

Ref	Expression
msrrcl	⊢ ((𝑅‘𝑋) = (𝑅‘𝑌) → (𝑋 ∈ 𝑃 ↔ 𝑌 ∈ 𝑃))

Proof of Theorem msrrcl

Step	Hyp	Ref	Expression
1		mpstssv.p	. . . . 5 ⊢ 𝑃 = (mPreSt‘𝑇)
2		msrf.r	. . . . 5 ⊢ 𝑅 = (mStRed‘𝑇)
3	1, 2	msrf 36034	. . . 4 ⊢ 𝑅:𝑃⟶𝑃
4	3	ffvelcdmi 7078	. . 3 ⊢ (𝑋 ∈ 𝑃 → (𝑅‘𝑋) ∈ 𝑃)
5	4	a1i 11	. 2 ⊢ ((𝑅‘𝑋) = (𝑅‘𝑌) → (𝑋 ∈ 𝑃 → (𝑅‘𝑋) ∈ 𝑃))
6	3	ffvelcdmi 7078	. . 3 ⊢ (𝑌 ∈ 𝑃 → (𝑅‘𝑌) ∈ 𝑃)
7		eleq1 2851	. . 3 ⊢ ((𝑅‘𝑋) = (𝑅‘𝑌) → ((𝑅‘𝑋) ∈ 𝑃 ↔ (𝑅‘𝑌) ∈ 𝑃))
8	6, 7	imbitrrid 249	. 2 ⊢ ((𝑅‘𝑋) = (𝑅‘𝑌) → (𝑌 ∈ 𝑃 → (𝑅‘𝑋) ∈ 𝑃))
9	3	fdmi 6717	. . . . . 6 ⊢ dom 𝑅 = 𝑃
10		0nelxp 5695	. . . . . . 7 ⊢ ¬ ∅ ∈ ((V × V) × V)
11	1	mpstssv 36031	. . . . . . . 8 ⊢ 𝑃 ⊆ ((V × V) × V)
12	11	sseli 3933	. . . . . . 7 ⊢ (∅ ∈ 𝑃 → ∅ ∈ ((V × V) × V))
13	10, 12	mto 200	. . . . . 6 ⊢ ¬ ∅ ∈ 𝑃
14	9, 13	ndmfvrcl 6914	. . . . 5 ⊢ ((𝑅‘𝑋) ∈ 𝑃 → 𝑋 ∈ 𝑃)
15	14	adantl 486	. . . 4 ⊢ (((𝑅‘𝑋) = (𝑅‘𝑌) ∧ (𝑅‘𝑋) ∈ 𝑃) → 𝑋 ∈ 𝑃)
16	7	biimpa 481	. . . . 5 ⊢ (((𝑅‘𝑋) = (𝑅‘𝑌) ∧ (𝑅‘𝑋) ∈ 𝑃) → (𝑅‘𝑌) ∈ 𝑃)
17	9, 13	ndmfvrcl 6914	. . . . 5 ⊢ ((𝑅‘𝑌) ∈ 𝑃 → 𝑌 ∈ 𝑃)
18	16, 17	syl 18	. . . 4 ⊢ (((𝑅‘𝑋) = (𝑅‘𝑌) ∧ (𝑅‘𝑋) ∈ 𝑃) → 𝑌 ∈ 𝑃)
19	15, 18	2thd 268	. . 3 ⊢ (((𝑅‘𝑋) = (𝑅‘𝑌) ∧ (𝑅‘𝑋) ∈ 𝑃) → (𝑋 ∈ 𝑃 ↔ 𝑌 ∈ 𝑃))
20	19	ex 417	. 2 ⊢ ((𝑅‘𝑋) = (𝑅‘𝑌) → ((𝑅‘𝑋) ∈ 𝑃 → (𝑋 ∈ 𝑃 ↔ 𝑌 ∈ 𝑃)))
21	5, 8, 20	pm5.21ndd 382	1 ⊢ ((𝑅‘𝑋) = (𝑅‘𝑌) → (𝑋 ∈ 𝑃 ↔ 𝑌 ∈ 𝑃))

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 400   = wceq 1570   ∈ wcel 2143  Vcvv 3455  ∅c0 4286   × cxp 5659  ‘cfv 6536  mPreStcmpst 35965  mStRedcmsr 35966

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-rep 5238  ax-sep 5257  ax-nul 5269  ax-pow 5336  ax-pr 5404  ax-un 7732

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-op 4596  df-ot 4598  df-uni 4873  df-iun 4958  df-br 5110  df-opab 5174  df-mpt 5193  df-id 5556  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-1st 7982  df-2nd 7983  df-mpst 35985  df-msr 35986

This theorem is referenced by:  elmthm  36068