| 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 2760 | . . 3 ⊢ (le‘𝐾) = (le‘𝐾) | |
| 2 | eqid 2760 | . . 3 ⊢ (Atoms‘𝐾) = (Atoms‘𝐾) | |
| 3 | trlid0.h | . . 3 ⊢ 𝐻 = (LHyp‘𝐾) | |
| 4 | 1, 2, 3 | lhpexnle 41156 | . 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 2760 | . . . . 5 ⊢ ((LTrn‘𝐾)‘𝑊) = ((LTrn‘𝐾)‘𝑊) | |
| 9 | 7, 3, 8 | idltrn 41300 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → ( I ↾ 𝐵) ∈ ((LTrn‘𝐾)‘𝑊)) |
| 10 | 9 | adantr 486 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → ( I ↾ 𝐵) ∈ ((LTrn‘𝐾)‘𝑊)) |
| 11 | eqid 2760 | . . . 4 ⊢ ( I ↾ 𝐵) = ( I ↾ 𝐵) | |
| 12 | 7, 1, 2, 3, 8 | ltrnideq 41325 | . . . . 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 41320 | . . 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 3169 | 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 1569 ∈ wcel 2144 class class class wbr 5102 I cid 5544 ↾ cres 5652 ‘cfv 6538 Basecbs 17392 lecple 17440 0.cp0 18600 Atomscatm 40413 HLchlt 40500 LHypclh 41134 LTrncltrn 41251 trLctrl 41308 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7751 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-ss 3896 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-id 5545 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-riota 7377 df-ov 7423 df-oprab 7424 df-mpo 7425 df-map 8852 df-proset 18473 df-poset 18492 df-plt 18507 df-lub 18523 df-glb 18524 df-join 18525 df-meet 18526 df-p0 18602 df-p1 18603 df-lat 18611 df-clat 18678 df-oposet 40326 df-ol 40328 df-oml 40329 df-covers 40416 df-ats 40417 df-atl 40448 df-cvlat 40472 df-hlat 40501 df-lhyp 41138 df-laut 41139 df-ldil 41254 df-ltrn 41255 df-trl 41309 |
| This theorem is used by: tendoid 41923 tendo0tp 41939 cdlemkid2 42074 cdlemk39s-id 42090 dian0 42189 dihmeetlem4preN 42456 |
| Copyright terms: Public domain | W3C validator |