| 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 36425 | . . . 4 ⊢ 𝑅:𝑃⟶𝑃 |
| 4 | 3 | ffvelcdmi 7088 | . . 3 ⊢ (𝑋 ∈ 𝑃 → (𝑅‘𝑋) ∈ 𝑃) |
| 5 | 4 | a1i 11 | . 2 ⊢ ((𝑅‘𝑋) = (𝑅‘𝑌) → (𝑋 ∈ 𝑃 → (𝑅‘𝑋) ∈ 𝑃)) |
| 6 | 3 | ffvelcdmi 7088 | . . 3 ⊢ (𝑌 ∈ 𝑃 → (𝑅‘𝑌) ∈ 𝑃) |
| 7 | eleq1 2848 | . . 3 ⊢ ((𝑅‘𝑋) = (𝑅‘𝑌) → ((𝑅‘𝑋) ∈ 𝑃 ↔ (𝑅‘𝑌) ∈ 𝑃)) | |
| 8 | 6, 7 | imbitrrid 249 | . 2 ⊢ ((𝑅‘𝑋) = (𝑅‘𝑌) → (𝑌 ∈ 𝑃 → (𝑅‘𝑋) ∈ 𝑃)) |
| 9 | 3 | fdmi 6726 | . . . . . 6 ⊢ dom 𝑅 = 𝑃 |
| 10 | 0nelxp 5685 | . . . . . . 7 ⊢ ¬ ∅ ∈ ((V × V) × V) | |
| 11 | 1 | mpstssv 36422 | . . . . . . . 8 ⊢ 𝑃 ⊆ ((V × V) × V) |
| 12 | 11 | sseli 3905 | . . . . . . 7 ⊢ (∅ ∈ 𝑃 → ∅ ∈ ((V × V) × V)) |
| 13 | 10, 12 | mto 200 | . . . . . 6 ⊢ ¬ ∅ ∈ 𝑃 |
| 14 | 9, 13 | ndmfvrcl 6923 | . . . . 5 ⊢ ((𝑅‘𝑋) ∈ 𝑃 → 𝑋 ∈ 𝑃) |
| 15 | 14 | adantl 487 | . . . 4 ⊢ (((𝑅‘𝑋) = (𝑅‘𝑌) ∧ (𝑅‘𝑋) ∈ 𝑃) → 𝑋 ∈ 𝑃) |
| 16 | 7 | biimpa 482 | . . . . 5 ⊢ (((𝑅‘𝑋) = (𝑅‘𝑌) ∧ (𝑅‘𝑋) ∈ 𝑃) → (𝑅‘𝑌) ∈ 𝑃) |
| 17 | 9, 13 | ndmfvrcl 6923 | . . . . 5 ⊢ ((𝑅‘𝑌) ∈ 𝑃 → 𝑌 ∈ 𝑃) |
| 18 | 16, 17 | syl 18 | . . . 4 ⊢ (((𝑅‘𝑋) = (𝑅‘𝑌) ∧ (𝑅‘𝑋) ∈ 𝑃) → 𝑌 ∈ 𝑃) |
| 19 | 15, 18 | 2thd 268 | . . 3 ⊢ (((𝑅‘𝑋) = (𝑅‘𝑌) ∧ (𝑅‘𝑋) ∈ 𝑃) → (𝑋 ∈ 𝑃 ↔ 𝑌 ∈ 𝑃)) |
| 20 | 19 | ex 418 | . 2 ⊢ ((𝑅‘𝑋) = (𝑅‘𝑌) → ((𝑅‘𝑋) ∈ 𝑃 → (𝑋 ∈ 𝑃 ↔ 𝑌 ∈ 𝑃))) |
| 21 | 5, 8, 20 | pm5.21ndd 382 | 1 ⊢ ((𝑅‘𝑋) = (𝑅‘𝑌) → (𝑋 ∈ 𝑃 ↔ 𝑌 ∈ 𝑃)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1569 ∈ wcel 2144 Vcvv 3450 ∅c0 4277 × cxp 5649 ‘cfv 6543 mPreStcmpst 36356 mStRedcmsr 36357 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5327 ax-pr 5391 ax-un 7755 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3848 df-ss 3897 df-dif 4046 df-in 4090 df-un 4150 df-nul 4278 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-ot 4858 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-id 5546 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-iota 6497 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-1st 8005 df-2nd 8006 df-mpst 36376 df-msr 36377 |
| This theorem is used by: elmthm 36459 |
| Copyright terms: Public domain | W3C validator |