| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > trlid0 | Structured version Visualization version GIF version | ||
| Description: The trace of the identity translation is zero. (Contributed by NM, 11-Jun-2013.) |
| Ref | Expression |
|---|---|
| trlid0.b | ⊢ 𝐵 = (Base‘𝐾) |
| trlid0.z | ⊢ 0 = (0.‘𝐾) |
| trlid0.h | ⊢ 𝐻 = (LHyp‘𝐾) |
| trlid0.r | ⊢ 𝑅 = ((trL‘𝐾)‘𝑊) |
| Ref | Expression |
|---|---|
| trlid0 | ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → (𝑅‘( I ↾ 𝐵)) = 0 ) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2765 | . . 3 ⊢ (le‘𝐾) = (le‘𝐾) | |
| 2 | eqid 2765 | . . 3 ⊢ (Atoms‘𝐾) = (Atoms‘𝐾) | |
| 3 | trlid0.h | . . 3 ⊢ 𝐻 = (LHyp‘𝐾) | |
| 4 | 1, 2, 3 | lhpexnle 40642 | . 2 ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → ∃𝑝 ∈ (Atoms‘𝐾) ¬ 𝑝(le‘𝐾)𝑊) |
| 5 | simpl 487 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻)) | |
| 6 | simpr 489 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) | |
| 7 | trlid0.b | . . . . 5 ⊢ 𝐵 = (Base‘𝐾) | |
| 8 | eqid 2765 | . . . . 5 ⊢ ((LTrn‘𝐾)‘𝑊) = ((LTrn‘𝐾)‘𝑊) | |
| 9 | 7, 3, 8 | idltrn 40786 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → ( I ↾ 𝐵) ∈ ((LTrn‘𝐾)‘𝑊)) |
| 10 | 9 | adantr 485 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → ( I ↾ 𝐵) ∈ ((LTrn‘𝐾)‘𝑊)) |
| 11 | eqid 2765 | . . . 4 ⊢ ( I ↾ 𝐵) = ( I ↾ 𝐵) | |
| 12 | 7, 1, 2, 3, 8 | ltrnideq 40811 | . . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ( I ↾ 𝐵) ∈ ((LTrn‘𝐾)‘𝑊) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → (( I ↾ 𝐵) = ( I ↾ 𝐵) ↔ (( I ↾ 𝐵)‘𝑝) = 𝑝)) |
| 13 | 5, 10, 6, 12 | syl3anc 1394 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → (( I ↾ 𝐵) = ( I ↾ 𝐵) ↔ (( I ↾ 𝐵)‘𝑝) = 𝑝)) |
| 14 | 11, 13 | mpbii 236 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → (( I ↾ 𝐵)‘𝑝) = 𝑝) |
| 15 | trlid0.z | . . . 4 ⊢ 0 = (0.‘𝐾) | |
| 16 | trlid0.r | . . . 4 ⊢ 𝑅 = ((trL‘𝐾)‘𝑊) | |
| 17 | 1, 15, 2, 3, 8, 16 | trl0 40806 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊) ∧ (( I ↾ 𝐵) ∈ ((LTrn‘𝐾)‘𝑊) ∧ (( I ↾ 𝐵)‘𝑝) = 𝑝)) → (𝑅‘( I ↾ 𝐵)) = 0 ) |
| 18 | 5, 6, 10, 14, 17 | syl112anc 1397 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → (𝑅‘( I ↾ 𝐵)) = 0 ) |
| 19 | 4, 18 | rexlimddv 3172 | 1 ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → (𝑅‘( I ↾ 𝐵)) = 0 ) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 400 = wceq 1563 ∈ wcel 2145 class class class wbr 5105 I cid 5546 ↾ cres 5654 ‘cfv 6525 Basecbs 17259 lecple 17307 0.cp0 18467 Atomscatm 39899 HLchlt 39986 LHypclh 40620 LTrncltrn 40737 trLctrl 40794 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2737 ax-rep 5232 ax-sep 5251 ax-nul 5261 ax-pow 5327 ax-pr 5395 ax-un 7722 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1566 df-fal 1576 df-ex 1803 df-nf 1807 df-sb 2094 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-ral 3080 df-rex 3090 df-rmo 3370 df-reu 3371 df-rab 3418 df-v 3459 df-sbc 3748 df-csb 3856 df-dif 3910 df-un 3912 df-in 3914 df-ss 3924 df-nul 4289 df-if 4484 df-pw 4560 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4869 df-iun 4954 df-br 5106 df-opab 5168 df-mpt 5187 df-id 5547 df-xp 5658 df-rel 5659 df-cnv 5660 df-co 5661 df-dm 5662 df-rn 5663 df-res 5664 df-ima 5665 df-iota 6481 df-fun 6527 df-fn 6528 df-f 6529 df-f1 6530 df-fo 6531 df-f1o 6532 df-fv 6533 df-riota 7357 df-ov 7403 df-oprab 7404 df-mpo 7405 df-map 8814 df-proset 18340 df-poset 18359 df-plt 18374 df-lub 18390 df-glb 18391 df-join 18392 df-meet 18393 df-p0 18469 df-p1 18470 df-lat 18478 df-clat 18545 df-oposet 39812 df-ol 39814 df-oml 39815 df-covers 39902 df-ats 39903 df-atl 39934 df-cvlat 39958 df-hlat 39987 df-lhyp 40624 df-laut 40625 df-ldil 40740 df-ltrn 40741 df-trl 40795 |
| This theorem is referenced by: tendoid 41409 tendo0tp 41425 cdlemkid2 41560 cdlemk39s-id 41576 dian0 41675 dihmeetlem4preN 41942 |
| Copyright terms: Public domain | W3C validator |