Mathbox for Mario Carneiro |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > msrrcl | Structured version Visualization version GIF version |
Description: If 𝑋 and 𝑌 have the same reduct, then one is a pre-statement iff the other is. (Contributed by Mario Carneiro, 18-Jul-2016.) |
Ref | Expression |
---|---|
mpstssv.p | ⊢ 𝑃 = (mPreSt‘𝑇) |
msrf.r | ⊢ 𝑅 = (mStRed‘𝑇) |
Ref | Expression |
---|---|
msrrcl | ⊢ ((𝑅‘𝑋) = (𝑅‘𝑌) → (𝑋 ∈ 𝑃 ↔ 𝑌 ∈ 𝑃)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | mpstssv.p | . . . . 5 ⊢ 𝑃 = (mPreSt‘𝑇) | |
2 | msrf.r | . . . . 5 ⊢ 𝑅 = (mStRed‘𝑇) | |
3 | 1, 2 | msrf 33504 | . . . 4 ⊢ 𝑅:𝑃⟶𝑃 |
4 | 3 | ffvelrni 6960 | . . 3 ⊢ (𝑋 ∈ 𝑃 → (𝑅‘𝑋) ∈ 𝑃) |
5 | 4 | a1i 11 | . 2 ⊢ ((𝑅‘𝑋) = (𝑅‘𝑌) → (𝑋 ∈ 𝑃 → (𝑅‘𝑋) ∈ 𝑃)) |
6 | 3 | ffvelrni 6960 | . . 3 ⊢ (𝑌 ∈ 𝑃 → (𝑅‘𝑌) ∈ 𝑃) |
7 | eleq1 2826 | . . 3 ⊢ ((𝑅‘𝑋) = (𝑅‘𝑌) → ((𝑅‘𝑋) ∈ 𝑃 ↔ (𝑅‘𝑌) ∈ 𝑃)) | |
8 | 6, 7 | syl5ibr 245 | . 2 ⊢ ((𝑅‘𝑋) = (𝑅‘𝑌) → (𝑌 ∈ 𝑃 → (𝑅‘𝑋) ∈ 𝑃)) |
9 | 3 | fdmi 6612 | . . . . . 6 ⊢ dom 𝑅 = 𝑃 |
10 | 0nelxp 5623 | . . . . . . 7 ⊢ ¬ ∅ ∈ ((V × V) × V) | |
11 | 1 | mpstssv 33501 | . . . . . . . 8 ⊢ 𝑃 ⊆ ((V × V) × V) |
12 | 11 | sseli 3917 | . . . . . . 7 ⊢ (∅ ∈ 𝑃 → ∅ ∈ ((V × V) × V)) |
13 | 10, 12 | mto 196 | . . . . . 6 ⊢ ¬ ∅ ∈ 𝑃 |
14 | 9, 13 | ndmfvrcl 6805 | . . . . 5 ⊢ ((𝑅‘𝑋) ∈ 𝑃 → 𝑋 ∈ 𝑃) |
15 | 14 | adantl 482 | . . . 4 ⊢ (((𝑅‘𝑋) = (𝑅‘𝑌) ∧ (𝑅‘𝑋) ∈ 𝑃) → 𝑋 ∈ 𝑃) |
16 | 7 | biimpa 477 | . . . . 5 ⊢ (((𝑅‘𝑋) = (𝑅‘𝑌) ∧ (𝑅‘𝑋) ∈ 𝑃) → (𝑅‘𝑌) ∈ 𝑃) |
17 | 9, 13 | ndmfvrcl 6805 | . . . . 5 ⊢ ((𝑅‘𝑌) ∈ 𝑃 → 𝑌 ∈ 𝑃) |
18 | 16, 17 | syl 17 | . . . 4 ⊢ (((𝑅‘𝑋) = (𝑅‘𝑌) ∧ (𝑅‘𝑋) ∈ 𝑃) → 𝑌 ∈ 𝑃) |
19 | 15, 18 | 2thd 264 | . . 3 ⊢ (((𝑅‘𝑋) = (𝑅‘𝑌) ∧ (𝑅‘𝑋) ∈ 𝑃) → (𝑋 ∈ 𝑃 ↔ 𝑌 ∈ 𝑃)) |
20 | 19 | ex 413 | . 2 ⊢ ((𝑅‘𝑋) = (𝑅‘𝑌) → ((𝑅‘𝑋) ∈ 𝑃 → (𝑋 ∈ 𝑃 ↔ 𝑌 ∈ 𝑃))) |
21 | 5, 8, 20 | pm5.21ndd 381 | 1 ⊢ ((𝑅‘𝑋) = (𝑅‘𝑌) → (𝑋 ∈ 𝑃 ↔ 𝑌 ∈ 𝑃)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 = wceq 1539 ∈ wcel 2106 Vcvv 3432 ∅c0 4256 × cxp 5587 ‘cfv 6433 mPreStcmpst 33435 mStRedcmsr 33436 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 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 2709 ax-rep 5209 ax-sep 5223 ax-nul 5230 ax-pow 5288 ax-pr 5352 ax-un 7588 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ne 2944 df-ral 3069 df-rex 3070 df-reu 3072 df-rab 3073 df-v 3434 df-sbc 3717 df-csb 3833 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-nul 4257 df-if 4460 df-pw 4535 df-sn 4562 df-pr 4564 df-op 4568 df-ot 4570 df-uni 4840 df-iun 4926 df-br 5075 df-opab 5137 df-mpt 5158 df-id 5489 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-rn 5600 df-res 5601 df-ima 5602 df-iota 6391 df-fun 6435 df-fn 6436 df-f 6437 df-f1 6438 df-fo 6439 df-f1o 6440 df-fv 6441 df-1st 7831 df-2nd 7832 df-mpst 33455 df-msr 33456 |
This theorem is referenced by: elmthm 33538 |
Copyright terms: Public domain | W3C validator |