Users' Mathboxes Mathbox for Norm Megill < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  tendotp Structured version   Visualization version   GIF version

Theorem tendotp 41798
Description: Trace-preserving property of a trace-preserving endomorphism. (Contributed by NM, 9-Jun-2013.)
Hypotheses
Ref Expression
tendoset.l ≤ = (le‘𝐾)
tendoset.h 𝐻 = (LHyp‘𝐾)
tendoset.t 𝑇 = ((LTrn‘𝐾)‘𝑊)
tendoset.r 𝑅 = ((trL‘𝐾)‘𝑊)
tendoset.e 𝐸 = ((TEndo‘𝐾)‘𝑊)
Assertion
Ref Expression
tendotp (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ 𝑆 ∈ 𝐸 ∧ 𝐹 ∈ 𝑇) → (𝑅‘(𝑆‘𝐹)) ≤ (𝑅‘𝐹))

Proof of Theorem tendotp
Dummy variables 𝑓 𝑔 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 tendoset.l . . . 4 ≤ = (le‘𝐾)
2 tendoset.h . . . 4 𝐻 = (LHyp‘𝐾)
3 tendoset.t . . . 4 𝑇 = ((LTrn‘𝐾)‘𝑊)
4 tendoset.r . . . 4 𝑅 = ((trL‘𝐾)‘𝑊)
5 tendoset.e . . . 4 𝐸 = ((TEndo‘𝐾)‘𝑊)
61, 2, 3, 4, 5istendo 41797 . . 3 ((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) → (𝑆 ∈ 𝐸 ↔ (𝑆:𝑇⟶𝑇 ∧ ∀𝑓 ∈ 𝑇 ∀𝑔 ∈ 𝑇 (𝑆‘(𝑓 ∘ 𝑔)) = ((𝑆‘𝑓) ∘ (𝑆‘𝑔)) ∧ ∀𝑓 ∈ 𝑇 (𝑅‘(𝑆‘𝑓)) ≤ (𝑅‘𝑓))))
7 2fveq3 6888 . . . . . 6 (𝑓 = 𝐹 → (𝑅‘(𝑆‘𝑓)) = (𝑅‘(𝑆‘𝐹)))
8 fveq2 6883 . . . . . 6 (𝑓 = 𝐹 → (𝑅‘𝑓) = (𝑅‘𝐹))
97, 8breq12d 5116 . . . . 5 (𝑓 = 𝐹 → ((𝑅‘(𝑆‘𝑓)) ≤ (𝑅‘𝑓) ↔ (𝑅‘(𝑆‘𝐹)) ≤ (𝑅‘𝐹)))
109rspccv 3574 . . . 4 (∀𝑓 ∈ 𝑇 (𝑅‘(𝑆‘𝑓)) ≤ (𝑅‘𝑓) → (𝐹 ∈ 𝑇 → (𝑅‘(𝑆‘𝐹)) ≤ (𝑅‘𝐹)))
11103ad2ant3 1153 . . 3 ((𝑆:𝑇⟶𝑇 ∧ ∀𝑓 ∈ 𝑇 ∀𝑔 ∈ 𝑇 (𝑆‘(𝑓 ∘ 𝑔)) = ((𝑆‘𝑓) ∘ (𝑆‘𝑔)) ∧ ∀𝑓 ∈ 𝑇 (𝑅‘(𝑆‘𝑓)) ≤ (𝑅‘𝑓)) → (𝐹 ∈ 𝑇 → (𝑅‘(𝑆‘𝐹)) ≤ (𝑅‘𝐹)))
126, 11biimtrdi 256 . 2 ((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) → (𝑆 ∈ 𝐸 → (𝐹 ∈ 𝑇 → (𝑅‘(𝑆‘𝐹)) ≤ (𝑅‘𝐹))))
13123imp 1128 1 (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ 𝑆 ∈ 𝐸 ∧ 𝐹 ∈ 𝑇) → (𝑅‘(𝑆‘𝐹)) ≤ (𝑅‘𝐹))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  ∀wral 3077   class class class wbr 5103   ∘ ccom 5655  ⟶wf 6533  ‘cfv 6537  lecple 17428  LHypclh 41021  LTrncltrn 41138  trLctrl 41195  TEndoctendo 41789
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7749
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  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 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-ov 7421  df-oprab 7422  df-mpo 7423  df-map 8842  df-tendo 41792
This theorem is used by:  tendococl  41809  tendoid  41810  tendopltp  41817  tendoicl  41833  cdlemi1  41855  tendotr  41867  cdleml1N  42013  dva1dim  42022  dialss  42083  diblss  42207
  Copyright terms: Public domain W3C validator