Mathbox for Mario Carneiro |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > mthmblem | Structured version Visualization version GIF version |
Description: Lemma for mthmb 33840. (Contributed by Mario Carneiro, 18-Jul-2016.) |
Ref | Expression |
---|---|
mthmb.r | ⊢ 𝑅 = (mStRed‘𝑇) |
mthmb.u | ⊢ 𝑈 = (mThm‘𝑇) |
Ref | Expression |
---|---|
mthmblem | ⊢ ((𝑅‘𝑋) = (𝑅‘𝑌) → (𝑋 ∈ 𝑈 → 𝑌 ∈ 𝑈)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | mthmb.r | . . . . 5 ⊢ 𝑅 = (mStRed‘𝑇) | |
2 | eqid 2737 | . . . . 5 ⊢ (mPPSt‘𝑇) = (mPPSt‘𝑇) | |
3 | mthmb.u | . . . . 5 ⊢ 𝑈 = (mThm‘𝑇) | |
4 | 1, 2, 3 | mthmval 33834 | . . . 4 ⊢ 𝑈 = (◡𝑅 “ (𝑅 “ (mPPSt‘𝑇))) |
5 | 4 | eleq2i 2829 | . . 3 ⊢ (𝑋 ∈ 𝑈 ↔ 𝑋 ∈ (◡𝑅 “ (𝑅 “ (mPPSt‘𝑇)))) |
6 | eqid 2737 | . . . . . 6 ⊢ (mPreSt‘𝑇) = (mPreSt‘𝑇) | |
7 | 6, 1 | msrf 33801 | . . . . 5 ⊢ 𝑅:(mPreSt‘𝑇)⟶(mPreSt‘𝑇) |
8 | ffn 6655 | . . . . 5 ⊢ (𝑅:(mPreSt‘𝑇)⟶(mPreSt‘𝑇) → 𝑅 Fn (mPreSt‘𝑇)) | |
9 | 7, 8 | ax-mp 5 | . . . 4 ⊢ 𝑅 Fn (mPreSt‘𝑇) |
10 | elpreima 6995 | . . . 4 ⊢ (𝑅 Fn (mPreSt‘𝑇) → (𝑋 ∈ (◡𝑅 “ (𝑅 “ (mPPSt‘𝑇))) ↔ (𝑋 ∈ (mPreSt‘𝑇) ∧ (𝑅‘𝑋) ∈ (𝑅 “ (mPPSt‘𝑇))))) | |
11 | 9, 10 | ax-mp 5 | . . 3 ⊢ (𝑋 ∈ (◡𝑅 “ (𝑅 “ (mPPSt‘𝑇))) ↔ (𝑋 ∈ (mPreSt‘𝑇) ∧ (𝑅‘𝑋) ∈ (𝑅 “ (mPPSt‘𝑇)))) |
12 | 5, 11 | bitri 275 | . 2 ⊢ (𝑋 ∈ 𝑈 ↔ (𝑋 ∈ (mPreSt‘𝑇) ∧ (𝑅‘𝑋) ∈ (𝑅 “ (mPPSt‘𝑇)))) |
13 | eleq1 2825 | . . . 4 ⊢ ((𝑅‘𝑋) = (𝑅‘𝑌) → ((𝑅‘𝑋) ∈ (𝑅 “ (mPPSt‘𝑇)) ↔ (𝑅‘𝑌) ∈ (𝑅 “ (mPPSt‘𝑇)))) | |
14 | ffun 6658 | . . . . . . 7 ⊢ (𝑅:(mPreSt‘𝑇)⟶(mPreSt‘𝑇) → Fun 𝑅) | |
15 | 7, 14 | ax-mp 5 | . . . . . 6 ⊢ Fun 𝑅 |
16 | fvelima 6895 | . . . . . 6 ⊢ ((Fun 𝑅 ∧ (𝑅‘𝑌) ∈ (𝑅 “ (mPPSt‘𝑇))) → ∃𝑥 ∈ (mPPSt‘𝑇)(𝑅‘𝑥) = (𝑅‘𝑌)) | |
17 | 15, 16 | mpan 688 | . . . . 5 ⊢ ((𝑅‘𝑌) ∈ (𝑅 “ (mPPSt‘𝑇)) → ∃𝑥 ∈ (mPPSt‘𝑇)(𝑅‘𝑥) = (𝑅‘𝑌)) |
18 | 1, 2, 3 | mthmi 33836 | . . . . . 6 ⊢ ((𝑥 ∈ (mPPSt‘𝑇) ∧ (𝑅‘𝑥) = (𝑅‘𝑌)) → 𝑌 ∈ 𝑈) |
19 | 18 | rexlimiva 3141 | . . . . 5 ⊢ (∃𝑥 ∈ (mPPSt‘𝑇)(𝑅‘𝑥) = (𝑅‘𝑌) → 𝑌 ∈ 𝑈) |
20 | 17, 19 | syl 17 | . . . 4 ⊢ ((𝑅‘𝑌) ∈ (𝑅 “ (mPPSt‘𝑇)) → 𝑌 ∈ 𝑈) |
21 | 13, 20 | syl6bi 253 | . . 3 ⊢ ((𝑅‘𝑋) = (𝑅‘𝑌) → ((𝑅‘𝑋) ∈ (𝑅 “ (mPPSt‘𝑇)) → 𝑌 ∈ 𝑈)) |
22 | 21 | adantld 492 | . 2 ⊢ ((𝑅‘𝑋) = (𝑅‘𝑌) → ((𝑋 ∈ (mPreSt‘𝑇) ∧ (𝑅‘𝑋) ∈ (𝑅 “ (mPPSt‘𝑇))) → 𝑌 ∈ 𝑈)) |
23 | 12, 22 | biimtrid 241 | 1 ⊢ ((𝑅‘𝑋) = (𝑅‘𝑌) → (𝑋 ∈ 𝑈 → 𝑌 ∈ 𝑈)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 397 = wceq 1541 ∈ wcel 2106 ∃wrex 3071 ◡ccnv 5623 “ cima 5627 Fun wfun 6477 Fn wfn 6478 ⟶wf 6479 ‘cfv 6483 mPreStcmpst 33732 mStRedcmsr 33733 mPPStcmpps 33737 mThmcmthm 33738 |
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 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2708 ax-rep 5233 ax-sep 5247 ax-nul 5254 ax-pow 5312 ax-pr 5376 ax-un 7654 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 846 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2539 df-eu 2568 df-clab 2715 df-cleq 2729 df-clel 2815 df-nfc 2887 df-ne 2942 df-ral 3063 df-rex 3072 df-reu 3351 df-rab 3405 df-v 3444 df-sbc 3731 df-csb 3847 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-nul 4274 df-if 4478 df-pw 4553 df-sn 4578 df-pr 4580 df-op 4584 df-ot 4586 df-uni 4857 df-iun 4947 df-br 5097 df-opab 5159 df-mpt 5180 df-id 5522 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-iota 6435 df-fun 6485 df-fn 6486 df-f 6487 df-f1 6488 df-fo 6489 df-f1o 6490 df-fv 6491 df-ov 7344 df-oprab 7345 df-1st 7903 df-2nd 7904 df-mpst 33752 df-msr 33753 df-mpps 33757 df-mthm 33758 |
This theorem is referenced by: mthmb 33840 |
Copyright terms: Public domain | W3C validator |