| 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 35892 | . . . 4 ⊢ 𝑅:𝑃⟶𝑃 |
| 4 | 3 | ffvelcdmi 7064 | . . 3 ⊢ (𝑋 ∈ 𝑃 → (𝑅‘𝑋) ∈ 𝑃) |
| 5 | 4 | a1i 11 | . 2 ⊢ ((𝑅‘𝑋) = (𝑅‘𝑌) → (𝑋 ∈ 𝑃 → (𝑅‘𝑋) ∈ 𝑃)) |
| 6 | 3 | ffvelcdmi 7064 | . . 3 ⊢ (𝑌 ∈ 𝑃 → (𝑅‘𝑌) ∈ 𝑃) |
| 7 | eleq1 2850 | . . 3 ⊢ ((𝑅‘𝑋) = (𝑅‘𝑌) → ((𝑅‘𝑋) ∈ 𝑃 ↔ (𝑅‘𝑌) ∈ 𝑃)) | |
| 8 | 6, 7 | imbitrrid 248 | . 2 ⊢ ((𝑅‘𝑋) = (𝑅‘𝑌) → (𝑌 ∈ 𝑃 → (𝑅‘𝑋) ∈ 𝑃)) |
| 9 | 3 | fdmi 6703 | . . . . . 6 ⊢ dom 𝑅 = 𝑃 |
| 10 | 0nelxp 5681 | . . . . . . 7 ⊢ ¬ ∅ ∈ ((V × V) × V) | |
| 11 | 1 | mpstssv 35889 | . . . . . . . 8 ⊢ 𝑃 ⊆ ((V × V) × V) |
| 12 | 11 | sseli 3932 | . . . . . . 7 ⊢ (∅ ∈ 𝑃 → ∅ ∈ ((V × V) × V)) |
| 13 | 10, 12 | mto 199 | . . . . . 6 ⊢ ¬ ∅ ∈ 𝑃 |
| 14 | 9, 13 | ndmfvrcl 6900 | . . . . 5 ⊢ ((𝑅‘𝑋) ∈ 𝑃 → 𝑋 ∈ 𝑃) |
| 15 | 14 | adantl 485 | . . . 4 ⊢ (((𝑅‘𝑋) = (𝑅‘𝑌) ∧ (𝑅‘𝑋) ∈ 𝑃) → 𝑋 ∈ 𝑃) |
| 16 | 7 | biimpa 480 | . . . . 5 ⊢ (((𝑅‘𝑋) = (𝑅‘𝑌) ∧ (𝑅‘𝑋) ∈ 𝑃) → (𝑅‘𝑌) ∈ 𝑃) |
| 17 | 9, 13 | ndmfvrcl 6900 | . . . . 5 ⊢ ((𝑅‘𝑌) ∈ 𝑃 → 𝑌 ∈ 𝑃) |
| 18 | 16, 17 | syl 17 | . . . 4 ⊢ (((𝑅‘𝑋) = (𝑅‘𝑌) ∧ (𝑅‘𝑋) ∈ 𝑃) → 𝑌 ∈ 𝑃) |
| 19 | 15, 18 | 2thd 267 | . . 3 ⊢ (((𝑅‘𝑋) = (𝑅‘𝑌) ∧ (𝑅‘𝑋) ∈ 𝑃) → (𝑋 ∈ 𝑃 ↔ 𝑌 ∈ 𝑃)) |
| 20 | 19 | ex 416 | . 2 ⊢ ((𝑅‘𝑋) = (𝑅‘𝑌) → ((𝑅‘𝑋) ∈ 𝑃 → (𝑋 ∈ 𝑃 ↔ 𝑌 ∈ 𝑃))) |
| 21 | 5, 8, 20 | pm5.21ndd 381 | 1 ⊢ ((𝑅‘𝑋) = (𝑅‘𝑌) → (𝑋 ∈ 𝑃 ↔ 𝑌 ∈ 𝑃)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 ∧ wa 399 = wceq 1560 ∈ wcel 2142 Vcvv 3454 ∅c0 4285 × cxp 5645 ‘cfv 6521 mPreStcmpst 35823 mStRedcmsr 35824 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1815 ax-4 1829 ax-5 1930 ax-6 1987 ax-7 2028 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-rep 5227 ax-sep 5246 ax-nul 5256 ax-pow 5322 ax-pr 5390 ax-un 7718 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1100 df-tru 1563 df-fal 1573 df-ex 1800 df-nf 1804 df-sb 2091 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3077 df-rex 3087 df-reu 3368 df-rab 3415 df-v 3456 df-sbc 3745 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-nul 4286 df-if 4481 df-pw 4557 df-sn 4583 df-pr 4585 df-op 4589 df-ot 4591 df-uni 4866 df-iun 4951 df-br 5101 df-opab 5163 df-mpt 5182 df-id 5542 df-xp 5653 df-rel 5654 df-cnv 5655 df-co 5656 df-dm 5657 df-rn 5658 df-res 5659 df-ima 5660 df-iota 6477 df-fun 6523 df-fn 6524 df-f 6525 df-f1 6526 df-fo 6527 df-f1o 6528 df-fv 6529 df-1st 7970 df-2nd 7971 df-mpst 35843 df-msr 35844 |
| This theorem is referenced by: elmthm 35926 |
| Copyright terms: Public domain | W3C validator |