| 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 35758 | . . . 4 ⊢ 𝑅:𝑃⟶𝑃 |
| 4 | 3 | ffvelcdmi 7037 | . . 3 ⊢ (𝑋 ∈ 𝑃 → (𝑅‘𝑋) ∈ 𝑃) |
| 5 | 4 | a1i 11 | . 2 ⊢ ((𝑅‘𝑋) = (𝑅‘𝑌) → (𝑋 ∈ 𝑃 → (𝑅‘𝑋) ∈ 𝑃)) |
| 6 | 3 | ffvelcdmi 7037 | . . 3 ⊢ (𝑌 ∈ 𝑃 → (𝑅‘𝑌) ∈ 𝑃) |
| 7 | eleq1 2825 | . . 3 ⊢ ((𝑅‘𝑋) = (𝑅‘𝑌) → ((𝑅‘𝑋) ∈ 𝑃 ↔ (𝑅‘𝑌) ∈ 𝑃)) | |
| 8 | 6, 7 | imbitrrid 246 | . 2 ⊢ ((𝑅‘𝑋) = (𝑅‘𝑌) → (𝑌 ∈ 𝑃 → (𝑅‘𝑋) ∈ 𝑃)) |
| 9 | 3 | fdmi 6681 | . . . . . 6 ⊢ dom 𝑅 = 𝑃 |
| 10 | 0nelxp 5666 | . . . . . . 7 ⊢ ¬ ∅ ∈ ((V × V) × V) | |
| 11 | 1 | mpstssv 35755 | . . . . . . . 8 ⊢ 𝑃 ⊆ ((V × V) × V) |
| 12 | 11 | sseli 3931 | . . . . . . 7 ⊢ (∅ ∈ 𝑃 → ∅ ∈ ((V × V) × V)) |
| 13 | 10, 12 | mto 197 | . . . . . 6 ⊢ ¬ ∅ ∈ 𝑃 |
| 14 | 9, 13 | ndmfvrcl 6875 | . . . . 5 ⊢ ((𝑅‘𝑋) ∈ 𝑃 → 𝑋 ∈ 𝑃) |
| 15 | 14 | adantl 481 | . . . 4 ⊢ (((𝑅‘𝑋) = (𝑅‘𝑌) ∧ (𝑅‘𝑋) ∈ 𝑃) → 𝑋 ∈ 𝑃) |
| 16 | 7 | biimpa 476 | . . . . 5 ⊢ (((𝑅‘𝑋) = (𝑅‘𝑌) ∧ (𝑅‘𝑋) ∈ 𝑃) → (𝑅‘𝑌) ∈ 𝑃) |
| 17 | 9, 13 | ndmfvrcl 6875 | . . . . 5 ⊢ ((𝑅‘𝑌) ∈ 𝑃 → 𝑌 ∈ 𝑃) |
| 18 | 16, 17 | syl 17 | . . . 4 ⊢ (((𝑅‘𝑋) = (𝑅‘𝑌) ∧ (𝑅‘𝑋) ∈ 𝑃) → 𝑌 ∈ 𝑃) |
| 19 | 15, 18 | 2thd 265 | . . 3 ⊢ (((𝑅‘𝑋) = (𝑅‘𝑌) ∧ (𝑅‘𝑋) ∈ 𝑃) → (𝑋 ∈ 𝑃 ↔ 𝑌 ∈ 𝑃)) |
| 20 | 19 | ex 412 | . 2 ⊢ ((𝑅‘𝑋) = (𝑅‘𝑌) → ((𝑅‘𝑋) ∈ 𝑃 → (𝑋 ∈ 𝑃 ↔ 𝑌 ∈ 𝑃))) |
| 21 | 5, 8, 20 | pm5.21ndd 379 | 1 ⊢ ((𝑅‘𝑋) = (𝑅‘𝑌) → (𝑋 ∈ 𝑃 ↔ 𝑌 ∈ 𝑃)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1542 ∈ wcel 2114 Vcvv 3442 ∅c0 4287 × cxp 5630 ‘cfv 6500 mPreStcmpst 35689 mStRedcmsr 35690 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5226 ax-sep 5243 ax-nul 5253 ax-pow 5312 ax-pr 5379 ax-un 7690 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3063 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-ot 4591 df-uni 4866 df-iun 4950 df-br 5101 df-opab 5163 df-mpt 5182 df-id 5527 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-iota 6456 df-fun 6502 df-fn 6503 df-f 6504 df-f1 6505 df-fo 6506 df-f1o 6507 df-fv 6508 df-1st 7943 df-2nd 7944 df-mpst 35709 df-msr 35710 |
| This theorem is referenced by: elmthm 35792 |
| Copyright terms: Public domain | W3C validator |