| 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 2766 | . . 3 ⊢ (le‘𝐾) = (le‘𝐾) | |
| 2 | eqid 2766 | . . 3 ⊢ (Atoms‘𝐾) = (Atoms‘𝐾) | |
| 3 | trlid0.h | . . 3 ⊢ 𝐻 = (LHyp‘𝐾) | |
| 4 | 1, 2, 3 | lhpexnle 40821 | . 2 ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → ∃𝑝 ∈ (Atoms‘𝐾) ¬ 𝑝(le‘𝐾)𝑊) |
| 5 | simpl 488 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻)) | |
| 6 | simpr 490 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) | |
| 7 | trlid0.b | . . . . 5 ⊢ 𝐵 = (Base‘𝐾) | |
| 8 | eqid 2766 | . . . . 5 ⊢ ((LTrn‘𝐾)‘𝑊) = ((LTrn‘𝐾)‘𝑊) | |
| 9 | 7, 3, 8 | idltrn 40965 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → ( I ↾ 𝐵) ∈ ((LTrn‘𝐾)‘𝑊)) |
| 10 | 9 | adantr 486 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → ( I ↾ 𝐵) ∈ ((LTrn‘𝐾)‘𝑊)) |
| 11 | eqid 2766 | . . . 4 ⊢ ( I ↾ 𝐵) = ( I ↾ 𝐵) | |
| 12 | 7, 1, 2, 3, 8 | ltrnideq 40990 | . . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ( I ↾ 𝐵) ∈ ((LTrn‘𝐾)‘𝑊) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → (( I ↾ 𝐵) = ( I ↾ 𝐵) ↔ (( I ↾ 𝐵)‘𝑝) = 𝑝)) |
| 13 | 5, 10, 6, 12 | syl3anc 1398 | . . . 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 40985 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊) ∧ (( I ↾ 𝐵) ∈ ((LTrn‘𝐾)‘𝑊) ∧ (( I ↾ 𝐵)‘𝑝) = 𝑝)) → (𝑅‘( I ↾ 𝐵)) = 0 ) |
| 18 | 5, 6, 10, 14, 17 | syl112anc 1401 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → (𝑅‘( I ↾ 𝐵)) = 0 ) |
| 19 | 4, 18 | rexlimddv 3175 | 1 ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → (𝑅‘( I ↾ 𝐵)) = 0 ) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2146 class class class wbr 5114 I cid 5560 ↾ cres 5668 ‘cfv 6543 Basecbs 17294 lecple 17342 0.cp0 18502 Atomscatm 40078 HLchlt 40165 LHypclh 40799 LTrncltrn 40916 trLctrl 40973 |
| 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 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2738 ax-rep 5243 ax-sep 5262 ax-nul 5274 ax-pow 5341 ax-pr 5409 ax-un 7745 |
| 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 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2841 df-nfc 2915 df-ne 2962 df-ral 3083 df-rex 3093 df-rmo 3372 df-reu 3373 df-rab 3420 df-v 3460 df-sbc 3748 df-csb 3857 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-nul 4290 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4878 df-iun 4963 df-br 5115 df-opab 5179 df-mpt 5198 df-id 5561 df-xp 5672 df-rel 5673 df-cnv 5674 df-co 5675 df-dm 5676 df-rn 5677 df-res 5678 df-ima 5679 df-iota 6499 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-riota 7380 df-ov 7426 df-oprab 7427 df-mpo 7428 df-map 8835 df-proset 18375 df-poset 18394 df-plt 18409 df-lub 18425 df-glb 18426 df-join 18427 df-meet 18428 df-p0 18504 df-p1 18505 df-lat 18513 df-clat 18580 df-oposet 39991 df-ol 39993 df-oml 39994 df-covers 40081 df-ats 40082 df-atl 40113 df-cvlat 40137 df-hlat 40166 df-lhyp 40803 df-laut 40804 df-ldil 40919 df-ltrn 40920 df-trl 40974 |
| This theorem is used by: tendoid 41588 tendo0tp 41604 cdlemkid2 41739 cdlemk39s-id 41755 dian0 41854 dihmeetlem4preN 42121 |
| Copyright terms: Public domain | W3C validator |