| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > tendoeq1 | Structured version Visualization version GIF version | ||
| Description: Condition determining equality of two trace-preserving endomorphisms. (Contributed by NM, 11-Jun-2013.) |
| Ref | Expression |
|---|---|
| tendof.h | ⊢ 𝐻 = (LHyp‘𝐾) |
| tendof.t | ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) |
| tendof.e | ⊢ 𝐸 = ((TEndo‘𝐾)‘𝑊) |
| Ref | Expression |
|---|---|
| tendoeq1 | ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑈 ∈ 𝐸 ∧ 𝑉 ∈ 𝐸) ∧ ∀𝑓 ∈ 𝑇 (𝑈‘𝑓) = (𝑉‘𝑓)) → 𝑈 = 𝑉) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simp3 1156 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑈 ∈ 𝐸 ∧ 𝑉 ∈ 𝐸) ∧ ∀𝑓 ∈ 𝑇 (𝑈‘𝑓) = (𝑉‘𝑓)) → ∀𝑓 ∈ 𝑇 (𝑈‘𝑓) = (𝑉‘𝑓)) | |
| 2 | simp1 1154 | . . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑈 ∈ 𝐸 ∧ 𝑉 ∈ 𝐸) ∧ ∀𝑓 ∈ 𝑇 (𝑈‘𝑓) = (𝑉‘𝑓)) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻)) | |
| 3 | simp2l 1218 | . . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑈 ∈ 𝐸 ∧ 𝑉 ∈ 𝐸) ∧ ∀𝑓 ∈ 𝑇 (𝑈‘𝑓) = (𝑉‘𝑓)) → 𝑈 ∈ 𝐸) | |
| 4 | tendof.h | . . . . . 6 ⊢ 𝐻 = (LHyp‘𝐾) | |
| 5 | tendof.t | . . . . . 6 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) | |
| 6 | tendof.e | . . . . . 6 ⊢ 𝐸 = ((TEndo‘𝐾)‘𝑊) | |
| 7 | 4, 5, 6 | tendof 42011 | . . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑈 ∈ 𝐸) → 𝑈:𝑇⟶𝑇) |
| 8 | 2, 3, 7 | syl2anc 596 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑈 ∈ 𝐸 ∧ 𝑉 ∈ 𝐸) ∧ ∀𝑓 ∈ 𝑇 (𝑈‘𝑓) = (𝑉‘𝑓)) → 𝑈:𝑇⟶𝑇) |
| 9 | 8 | ffnd 6729 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑈 ∈ 𝐸 ∧ 𝑉 ∈ 𝐸) ∧ ∀𝑓 ∈ 𝑇 (𝑈‘𝑓) = (𝑉‘𝑓)) → 𝑈 Fn 𝑇) |
| 10 | simp2r 1219 | . . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑈 ∈ 𝐸 ∧ 𝑉 ∈ 𝐸) ∧ ∀𝑓 ∈ 𝑇 (𝑈‘𝑓) = (𝑉‘𝑓)) → 𝑉 ∈ 𝐸) | |
| 11 | 4, 5, 6 | tendof 42011 | . . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑉 ∈ 𝐸) → 𝑉:𝑇⟶𝑇) |
| 12 | 2, 10, 11 | syl2anc 596 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑈 ∈ 𝐸 ∧ 𝑉 ∈ 𝐸) ∧ ∀𝑓 ∈ 𝑇 (𝑈‘𝑓) = (𝑉‘𝑓)) → 𝑉:𝑇⟶𝑇) |
| 13 | 12 | ffnd 6729 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑈 ∈ 𝐸 ∧ 𝑉 ∈ 𝐸) ∧ ∀𝑓 ∈ 𝑇 (𝑈‘𝑓) = (𝑉‘𝑓)) → 𝑉 Fn 𝑇) |
| 14 | eqfnfv 7049 | . . 3 ⊢ ((𝑈 Fn 𝑇 ∧ 𝑉 Fn 𝑇) → (𝑈 = 𝑉 ↔ ∀𝑓 ∈ 𝑇 (𝑈‘𝑓) = (𝑉‘𝑓))) | |
| 15 | 9, 13, 14 | syl2anc 596 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑈 ∈ 𝐸 ∧ 𝑉 ∈ 𝐸) ∧ ∀𝑓 ∈ 𝑇 (𝑈‘𝑓) = (𝑉‘𝑓)) → (𝑈 = 𝑉 ↔ ∀𝑓 ∈ 𝑇 (𝑈‘𝑓) = (𝑉‘𝑓))) |
| 16 | 1, 15 | mpbird 260 | 1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑈 ∈ 𝐸 ∧ 𝑉 ∈ 𝐸) ∧ ∀𝑓 ∈ 𝑇 (𝑈‘𝑓) = (𝑉‘𝑓)) → 𝑈 = 𝑉) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2147 ∀wral 3080 Fn wfn 6550 ⟶wf 6551 ‘cfv 6555 HLchlt 40598 LHypclh 41232 LTrncltrn 41349 TEndoctendo 42000 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5235 ax-sep 5252 ax-nul 5263 ax-pow 5331 ax-pr 5395 ax-un 7772 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-iun 4956 df-br 5107 df-opab 5171 df-mpt 5190 df-id 5550 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-iota 6509 df-fun 6557 df-fn 6558 df-f 6559 df-f1 6560 df-fo 6561 df-f1o 6562 df-fv 6563 df-ov 7443 df-oprab 7444 df-mpo 7445 df-map 8874 df-tendo 42003 |
| This theorem is used by: tendoeq2 42022 tendoplcom 42030 tendoplass 42031 tendodi1 42032 tendodi2 42033 tendo0pl 42039 tendoipl 42045 |
| Copyright terms: Public domain | W3C validator |