Theorem msrrcl 30694

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 30693	. . . 4 ⊢ 𝑅:𝑃⟶𝑃
4	3	ffvelrni 6266	. . 3 ⊢ (𝑋 ∈ 𝑃 → (𝑅‘𝑋) ∈ 𝑃)
5	4	a1i 11	. 2 ⊢ ((𝑅‘𝑋) = (𝑅‘𝑌) → (𝑋 ∈ 𝑃 → (𝑅‘𝑋) ∈ 𝑃))
6	3	ffvelrni 6266	. . 3 ⊢ (𝑌 ∈ 𝑃 → (𝑅‘𝑌) ∈ 𝑃)
7		eleq1 2676	. . 3 ⊢ ((𝑅‘𝑋) = (𝑅‘𝑌) → ((𝑅‘𝑋) ∈ 𝑃 ↔ (𝑅‘𝑌) ∈ 𝑃))
8	6, 7	syl5ibr 235	. 2 ⊢ ((𝑅‘𝑋) = (𝑅‘𝑌) → (𝑌 ∈ 𝑃 → (𝑅‘𝑋) ∈ 𝑃))
9	3	fdmi 5965	. . . . . 6 ⊢ dom 𝑅 = 𝑃
10		0nelxp 5067	. . . . . . 7 ⊢ ¬ ∅ ∈ ((V × V) × V)
11	1	mpstssv 30690	. . . . . . . 8 ⊢ 𝑃 ⊆ ((V × V) × V)
12	11	sseli 3564	. . . . . . 7 ⊢ (∅ ∈ 𝑃 → ∅ ∈ ((V × V) × V))
13	10, 12	mto 187	. . . . . 6 ⊢ ¬ ∅ ∈ 𝑃
14	9, 13	ndmfvrcl 6129	. . . . 5 ⊢ ((𝑅‘𝑋) ∈ 𝑃 → 𝑋 ∈ 𝑃)
15	14	adantl 481	. . . 4 ⊢ (((𝑅‘𝑋) = (𝑅‘𝑌) ∧ (𝑅‘𝑋) ∈ 𝑃) → 𝑋 ∈ 𝑃)
16	7	biimpa 500	. . . . 5 ⊢ (((𝑅‘𝑋) = (𝑅‘𝑌) ∧ (𝑅‘𝑋) ∈ 𝑃) → (𝑅‘𝑌) ∈ 𝑃)
17	9, 13	ndmfvrcl 6129	. . . . 5 ⊢ ((𝑅‘𝑌) ∈ 𝑃 → 𝑌 ∈ 𝑃)
18	16, 17	syl 17	. . . 4 ⊢ (((𝑅‘𝑋) = (𝑅‘𝑌) ∧ (𝑅‘𝑋) ∈ 𝑃) → 𝑌 ∈ 𝑃)
19	15, 18	2thd 254	. . 3 ⊢ (((𝑅‘𝑋) = (𝑅‘𝑌) ∧ (𝑅‘𝑋) ∈ 𝑃) → (𝑋 ∈ 𝑃 ↔ 𝑌 ∈ 𝑃))
20	19	ex 449	. 2 ⊢ ((𝑅‘𝑋) = (𝑅‘𝑌) → ((𝑅‘𝑋) ∈ 𝑃 → (𝑋 ∈ 𝑃 ↔ 𝑌 ∈ 𝑃)))
21	5, 8, 20	pm5.21ndd 368	1 ⊢ ((𝑅‘𝑋) = (𝑅‘𝑌) → (𝑋 ∈ 𝑃 ↔ 𝑌 ∈ 𝑃))

Syntax hints:   → wi 4   ↔ wb 195   ∧ wa 383   = wceq 1475   ∈ wcel 1977  Vcvv 3173  ∅c0 3874   × cxp 5036  ‘cfv 5804  mPreStcmpst 30624  mStRedcmsr 30625

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-rep 4699  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847

This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-fal 1481  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-ral 2901  df-rex 2902  df-reu 2903  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-op 4132  df-ot 4134  df-uni 4373  df-iun 4457  df-br 4584  df-opab 4644  df-mpt 4645  df-id 4953  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-1st 7059  df-2nd 7060  df-mpst 30644  df-msr 30645

This theorem is referenced by:  elmthm  30727