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

Theorem istendod 41787
Description: Deduce the predicate "is 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‘𝐾)‘𝑊)
istendod.1 (𝜑 → (𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻))
istendod.2 (𝜑 → 𝑆:𝑇⟶𝑇)
istendod.3 ((𝜑 ∧ 𝑓 ∈ 𝑇 ∧ 𝑔 ∈ 𝑇) → (𝑆‘(𝑓 ∘ 𝑔)) = ((𝑆‘𝑓) ∘ (𝑆‘𝑔)))
istendod.4 ((𝜑 ∧ 𝑓 ∈ 𝑇) → (𝑅‘(𝑆‘𝑓)) ≤ (𝑅‘𝑓))
Assertion
Ref Expression
istendod (𝜑 → 𝑆 ∈ 𝐸)
Distinct variable groups:   𝑓,𝑔,𝐾   𝑇,𝑓,𝑔   𝑓,𝑊,𝑔   𝑆,𝑓,𝑔   ≤ ,𝑓   𝑅,𝑓   𝜑,𝑓,𝑔
Allowed substitution hints:   𝑅(𝑔)   𝐸(𝑓, 𝑔)   𝐻(𝑓, 𝑔)   ≤ (𝑔)   𝑉(𝑓, 𝑔)

Proof of Theorem istendod
StepHypRef Expression
1 istendod.2 . 2 (𝜑 → 𝑆:𝑇⟶𝑇)
2 istendod.3 . . . 4 ((𝜑 ∧ 𝑓 ∈ 𝑇 ∧ 𝑔 ∈ 𝑇) → (𝑆‘(𝑓 ∘ 𝑔)) = ((𝑆‘𝑓) ∘ (𝑆‘𝑔)))
323expb 1138 . . 3 ((𝜑 ∧ (𝑓 ∈ 𝑇 ∧ 𝑔 ∈ 𝑇)) → (𝑆‘(𝑓 ∘ 𝑔)) = ((𝑆‘𝑓) ∘ (𝑆‘𝑔)))
43ralrimivva 3206 . 2 (𝜑 → ∀𝑓 ∈ 𝑇 ∀𝑔 ∈ 𝑇 (𝑆‘(𝑓 ∘ 𝑔)) = ((𝑆‘𝑓) ∘ (𝑆‘𝑔)))
5 istendod.4 . . 3 ((𝜑 ∧ 𝑓 ∈ 𝑇) → (𝑅‘(𝑆‘𝑓)) ≤ (𝑅‘𝑓))
65ralrimiva 3155 . 2 (𝜑 → ∀𝑓 ∈ 𝑇 (𝑅‘(𝑆‘𝑓)) ≤ (𝑅‘𝑓))
7 istendod.1 . . 3 (𝜑 → (𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻))
8 tendoset.l . . . 4 ≤ = (le‘𝐾)
9 tendoset.h . . . 4 𝐻 = (LHyp‘𝐾)
10 tendoset.t . . . 4 𝑇 = ((LTrn‘𝐾)‘𝑊)
11 tendoset.r . . . 4 𝑅 = ((trL‘𝐾)‘𝑊)
12 tendoset.e . . . 4 𝐸 = ((TEndo‘𝐾)‘𝑊)
138, 9, 10, 11, 12istendo 41785 . . 3 ((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) → (𝑆 ∈ 𝐸 ↔ (𝑆:𝑇⟶𝑇 ∧ ∀𝑓 ∈ 𝑇 ∀𝑔 ∈ 𝑇 (𝑆‘(𝑓 ∘ 𝑔)) = ((𝑆‘𝑓) ∘ (𝑆‘𝑔)) ∧ ∀𝑓 ∈ 𝑇 (𝑅‘(𝑆‘𝑓)) ≤ (𝑅‘𝑓))))
147, 13syl 18 . 2 (𝜑 → (𝑆 ∈ 𝐸 ↔ (𝑆:𝑇⟶𝑇 ∧ ∀𝑓 ∈ 𝑇 ∀𝑔 ∈ 𝑇 (𝑆‘(𝑓 ∘ 𝑔)) = ((𝑆‘𝑓) ∘ (𝑆‘𝑔)) ∧ ∀𝑓 ∈ 𝑇 (𝑅‘(𝑆‘𝑓)) ≤ (𝑅‘𝑓))))
151, 4, 6, 14mpbir3and 1361 1 (𝜑 → 𝑆 ∈ 𝐸)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  ∀wral 3077   class class class wbr 5103   ∘ ccom 5655  ⟶wf 6527  ‘cfv 6531  lecple 17415  LHypclh 41009  LTrncltrn 41126  trLctrl 41183  TEndoctendo 41777
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 7740
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 6487  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-ov 7415  df-oprab 7416  df-mpo 7417  df-map 8833  df-tendo 41780
This theorem is used by:  tendoidcl  41794  tendococl  41797  tendoplcl  41806  tendo0cl  41815  tendoicl  41821  cdlemk56  41996
  Copyright terms: Public domain W3C validator