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

Theorem istendo 40721
Description: The predicate "is a trace-preserving endomorphism". Similar to definition of trace-preserving endomorphism in [Crawley] p. 117, penultimate line. (Contributed by NM, 8-Jun-2013.)
Hypotheses
Ref Expression
tendoset.l = (le‘𝐾)
tendoset.h 𝐻 = (LHyp‘𝐾)
tendoset.t 𝑇 = ((LTrn‘𝐾)‘𝑊)
tendoset.r 𝑅 = ((trL‘𝐾)‘𝑊)
tendoset.e 𝐸 = ((TEndo‘𝐾)‘𝑊)
Assertion
Ref Expression
istendo ((𝐾𝑉𝑊𝐻) → (𝑆𝐸 ↔ (𝑆:𝑇𝑇 ∧ ∀𝑓𝑇𝑔𝑇 (𝑆‘(𝑓𝑔)) = ((𝑆𝑓) ∘ (𝑆𝑔)) ∧ ∀𝑓𝑇 (𝑅‘(𝑆𝑓)) (𝑅𝑓))))
Distinct variable groups:   𝑓,𝑔,𝐾   𝑇,𝑓,𝑔   𝑓,𝑊,𝑔   𝑆,𝑓,𝑔
Allowed substitution hints:   𝑅(𝑓,𝑔)   𝐸(𝑓,𝑔)   𝐻(𝑓,𝑔)   (𝑓,𝑔)   𝑉(𝑓,𝑔)

Proof of Theorem istendo
Dummy variable 𝑠 is 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, 5tendoset 40720 . . 3 ((𝐾𝑉𝑊𝐻) → 𝐸 = {𝑠 ∣ (𝑠:𝑇𝑇 ∧ ∀𝑓𝑇𝑔𝑇 (𝑠‘(𝑓𝑔)) = ((𝑠𝑓) ∘ (𝑠𝑔)) ∧ ∀𝑓𝑇 (𝑅‘(𝑠𝑓)) (𝑅𝑓))})
76eleq2d 2819 . 2 ((𝐾𝑉𝑊𝐻) → (𝑆𝐸𝑆 ∈ {𝑠 ∣ (𝑠:𝑇𝑇 ∧ ∀𝑓𝑇𝑔𝑇 (𝑠‘(𝑓𝑔)) = ((𝑠𝑓) ∘ (𝑠𝑔)) ∧ ∀𝑓𝑇 (𝑅‘(𝑠𝑓)) (𝑅𝑓))}))
83fvexi 6900 . . . . 5 𝑇 ∈ V
9 fex 7228 . . . . 5 ((𝑆:𝑇𝑇𝑇 ∈ V) → 𝑆 ∈ V)
108, 9mpan2 691 . . . 4 (𝑆:𝑇𝑇𝑆 ∈ V)
11103ad2ant1 1133 . . 3 ((𝑆:𝑇𝑇 ∧ ∀𝑓𝑇𝑔𝑇 (𝑆‘(𝑓𝑔)) = ((𝑆𝑓) ∘ (𝑆𝑔)) ∧ ∀𝑓𝑇 (𝑅‘(𝑆𝑓)) (𝑅𝑓)) → 𝑆 ∈ V)
12 feq1 6696 . . . 4 (𝑠 = 𝑆 → (𝑠:𝑇𝑇𝑆:𝑇𝑇))
13 fveq1 6885 . . . . . 6 (𝑠 = 𝑆 → (𝑠‘(𝑓𝑔)) = (𝑆‘(𝑓𝑔)))
14 fveq1 6885 . . . . . . 7 (𝑠 = 𝑆 → (𝑠𝑓) = (𝑆𝑓))
15 fveq1 6885 . . . . . . 7 (𝑠 = 𝑆 → (𝑠𝑔) = (𝑆𝑔))
1614, 15coeq12d 5855 . . . . . 6 (𝑠 = 𝑆 → ((𝑠𝑓) ∘ (𝑠𝑔)) = ((𝑆𝑓) ∘ (𝑆𝑔)))
1713, 16eqeq12d 2750 . . . . 5 (𝑠 = 𝑆 → ((𝑠‘(𝑓𝑔)) = ((𝑠𝑓) ∘ (𝑠𝑔)) ↔ (𝑆‘(𝑓𝑔)) = ((𝑆𝑓) ∘ (𝑆𝑔))))
18172ralbidv 3208 . . . 4 (𝑠 = 𝑆 → (∀𝑓𝑇𝑔𝑇 (𝑠‘(𝑓𝑔)) = ((𝑠𝑓) ∘ (𝑠𝑔)) ↔ ∀𝑓𝑇𝑔𝑇 (𝑆‘(𝑓𝑔)) = ((𝑆𝑓) ∘ (𝑆𝑔))))
1914fveq2d 6890 . . . . . 6 (𝑠 = 𝑆 → (𝑅‘(𝑠𝑓)) = (𝑅‘(𝑆𝑓)))
2019breq1d 5133 . . . . 5 (𝑠 = 𝑆 → ((𝑅‘(𝑠𝑓)) (𝑅𝑓) ↔ (𝑅‘(𝑆𝑓)) (𝑅𝑓)))
2120ralbidv 3165 . . . 4 (𝑠 = 𝑆 → (∀𝑓𝑇 (𝑅‘(𝑠𝑓)) (𝑅𝑓) ↔ ∀𝑓𝑇 (𝑅‘(𝑆𝑓)) (𝑅𝑓)))
2212, 18, 213anbi123d 1437 . . 3 (𝑠 = 𝑆 → ((𝑠:𝑇𝑇 ∧ ∀𝑓𝑇𝑔𝑇 (𝑠‘(𝑓𝑔)) = ((𝑠𝑓) ∘ (𝑠𝑔)) ∧ ∀𝑓𝑇 (𝑅‘(𝑠𝑓)) (𝑅𝑓)) ↔ (𝑆:𝑇𝑇 ∧ ∀𝑓𝑇𝑔𝑇 (𝑆‘(𝑓𝑔)) = ((𝑆𝑓) ∘ (𝑆𝑔)) ∧ ∀𝑓𝑇 (𝑅‘(𝑆𝑓)) (𝑅𝑓))))
2311, 22elab3 3669 . 2 (𝑆 ∈ {𝑠 ∣ (𝑠:𝑇𝑇 ∧ ∀𝑓𝑇𝑔𝑇 (𝑠‘(𝑓𝑔)) = ((𝑠𝑓) ∘ (𝑠𝑔)) ∧ ∀𝑓𝑇 (𝑅‘(𝑠𝑓)) (𝑅𝑓))} ↔ (𝑆:𝑇𝑇 ∧ ∀𝑓𝑇𝑔𝑇 (𝑆‘(𝑓𝑔)) = ((𝑆𝑓) ∘ (𝑆𝑔)) ∧ ∀𝑓𝑇 (𝑅‘(𝑆𝑓)) (𝑅𝑓)))
247, 23bitrdi 287 1 ((𝐾𝑉𝑊𝐻) → (𝑆𝐸 ↔ (𝑆:𝑇𝑇 ∧ ∀𝑓𝑇𝑔𝑇 (𝑆‘(𝑓𝑔)) = ((𝑆𝑓) ∘ (𝑆𝑔)) ∧ ∀𝑓𝑇 (𝑅‘(𝑆𝑓)) (𝑅𝑓))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  w3a 1086   = wceq 1539  wcel 2107  {cab 2712  wral 3050  Vcvv 3463   class class class wbr 5123  ccom 5669  wf 6537  cfv 6541  lecple 17280  LHypclh 39945  LTrncltrn 40062  trLctrl 40119  TEndoctendo 40713
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1794  ax-4 1808  ax-5 1909  ax-6 1966  ax-7 2006  ax-8 2109  ax-9 2117  ax-10 2140  ax-11 2156  ax-12 2176  ax-ext 2706  ax-rep 5259  ax-sep 5276  ax-nul 5286  ax-pow 5345  ax-pr 5412  ax-un 7737
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1779  df-nf 1783  df-sb 2064  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2726  df-clel 2808  df-nfc 2884  df-ne 2932  df-ral 3051  df-rex 3060  df-reu 3364  df-rab 3420  df-v 3465  df-sbc 3771  df-csb 3880  df-dif 3934  df-un 3936  df-in 3938  df-ss 3948  df-nul 4314  df-if 4506  df-pw 4582  df-sn 4607  df-pr 4609  df-op 4613  df-uni 4888  df-iun 4973  df-br 5124  df-opab 5186  df-mpt 5206  df-id 5558  df-xp 5671  df-rel 5672  df-cnv 5673  df-co 5674  df-dm 5675  df-rn 5676  df-res 5677  df-ima 5678  df-iota 6494  df-fun 6543  df-fn 6544  df-f 6545  df-f1 6546  df-fo 6547  df-f1o 6548  df-fv 6549  df-ov 7416  df-oprab 7417  df-mpo 7418  df-map 8850  df-tendo 40716
This theorem is referenced by:  tendotp  40722  istendod  40723  tendof  40724  tendovalco  40726
  Copyright terms: Public domain W3C validator