Users' Mathboxes Mathbox for Mario Carneiro < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  mthmblem Structured version   Visualization version   GIF version

Theorem mthmblem 36431
Description: Lemma for mthmb 36432. (Contributed by Mario Carneiro, 18-Jul-2016.)
Hypotheses
Ref Expression
mthmb.r 𝑅 = (mStRed‘𝑇)
mthmb.u 𝑈 = (mThm‘𝑇)
Assertion
Ref Expression
mthmblem ((𝑅‘𝑋) = (𝑅‘𝑌) → (𝑋 ∈ 𝑈 → 𝑌 ∈ 𝑈))

Proof of Theorem mthmblem
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 mthmb.r . . . . 5 𝑅 = (mStRed‘𝑇)
2 eqid 2760 . . . . 5 (mPPSt‘𝑇) = (mPPSt‘𝑇)
3 mthmb.u . . . . 5 𝑈 = (mThm‘𝑇)
41, 2, 3mthmval 36426 . . . 4 𝑈 = (◡𝑅 “ (𝑅 “ (mPPSt‘𝑇)))
54eleq2i 2852 . . 3 (𝑋 ∈ 𝑈 ↔ 𝑋 ∈ (◡𝑅 “ (𝑅 “ (mPPSt‘𝑇))))
6 eqid 2760 . . . . . 6 (mPreSt‘𝑇) = (mPreSt‘𝑇)
76, 1msrf 36393 . . . . 5 𝑅:(mPreSt‘𝑇)⟶(mPreSt‘𝑇)
8 ffn 6709 . . . . 5 (𝑅:(mPreSt‘𝑇)⟶(mPreSt‘𝑇) → 𝑅 Fn (mPreSt‘𝑇))
97, 8ax-mp 5 . . . 4 𝑅 Fn (mPreSt‘𝑇)
10 elpreima 7057 . . . 4 (𝑅 Fn (mPreSt‘𝑇) → (𝑋 ∈ (◡𝑅 “ (𝑅 “ (mPPSt‘𝑇))) ↔ (𝑋 ∈ (mPreSt‘𝑇) ∧ (𝑅‘𝑋) ∈ (𝑅 “ (mPPSt‘𝑇)))))
119, 10ax-mp 5 . . 3 (𝑋 ∈ (◡𝑅 “ (𝑅 “ (mPPSt‘𝑇))) ↔ (𝑋 ∈ (mPreSt‘𝑇) ∧ (𝑅‘𝑋) ∈ (𝑅 “ (mPPSt‘𝑇))))
125, 11bitri 278 . 2 (𝑋 ∈ 𝑈 ↔ (𝑋 ∈ (mPreSt‘𝑇) ∧ (𝑅‘𝑋) ∈ (𝑅 “ (mPPSt‘𝑇))))
13 eleq1 2848 . . . 4 ((𝑅‘𝑋) = (𝑅‘𝑌) → ((𝑅‘𝑋) ∈ (𝑅 “ (mPPSt‘𝑇)) ↔ (𝑅‘𝑌) ∈ (𝑅 “ (mPPSt‘𝑇))))
14 ffun 6712 . . . . . . 7 (𝑅:(mPreSt‘𝑇)⟶(mPreSt‘𝑇) → Fun 𝑅)
157, 14ax-mp 5 . . . . . 6 Fun 𝑅
16 fvelima 6950 . . . . . 6 ((Fun 𝑅 ∧ (𝑅‘𝑌) ∈ (𝑅 “ (mPPSt‘𝑇))) → ∃𝑥 ∈ (mPPSt‘𝑇)(𝑅‘𝑥) = (𝑅‘𝑌))
1715, 16mpan 703 . . . . 5 ((𝑅‘𝑌) ∈ (𝑅 “ (mPPSt‘𝑇)) → ∃𝑥 ∈ (mPPSt‘𝑇)(𝑅‘𝑥) = (𝑅‘𝑌))
181, 2, 3mthmi 36428 . . . . . 6 ((𝑥 ∈ (mPPSt‘𝑇) ∧ (𝑅‘𝑥) = (𝑅‘𝑌)) → 𝑌 ∈ 𝑈)
1918rexlimiva 3155 . . . . 5 (∃𝑥 ∈ (mPPSt‘𝑇)(𝑅‘𝑥) = (𝑅‘𝑌) → 𝑌 ∈ 𝑈)
2017, 19syl 18 . . . 4 ((𝑅‘𝑌) ∈ (𝑅 “ (mPPSt‘𝑇)) → 𝑌 ∈ 𝑈)
2113, 20biimtrdi 256 . . 3 ((𝑅‘𝑋) = (𝑅‘𝑌) → ((𝑅‘𝑋) ∈ (𝑅 “ (mPPSt‘𝑇)) → 𝑌 ∈ 𝑈))
2221adantld 496 . 2 ((𝑅‘𝑋) = (𝑅‘𝑌) → ((𝑋 ∈ (mPreSt‘𝑇) ∧ (𝑅‘𝑋) ∈ (𝑅 “ (mPPSt‘𝑇))) → 𝑌 ∈ 𝑈))
2312, 22biimtrid 245 1 ((𝑅‘𝑋) = (𝑅‘𝑌) → (𝑋 ∈ 𝑈 → 𝑌 ∈ 𝑈))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1569   ∈ wcel 2144  ∃wrex 3086  ◡ccnv 5649   “ cima 5653  Fun wfun 6532   Fn wfn 6533  ⟶wf 6534  ‘cfv 6538  mPreStcmpst 36324  mStRedcmsr 36325  mPPStcmpps 36329  mThmcmthm 36330
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 5326  ax-pr 5390  ax-un 7751
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 3847  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  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 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-ov 7423  df-oprab 7424  df-1st 8001  df-2nd 8002  df-mpst 36344  df-msr 36345  df-mpps 36349  df-mthm 36350
This theorem is used by:  mthmb  36432
  Copyright terms: Public domain W3C validator