| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > dihvalb | Structured version Visualization version GIF version | ||
| Description: Value of isomorphism H for a lattice 𝐾 when 𝑋 ≤ 𝑊. (Contributed by NM, 4-Mar-2014.) |
| Ref | Expression |
|---|---|
| dihvalb.b | ⊢ 𝐵 = (Base‘𝐾) |
| dihvalb.l | ⊢ ≤ = (le‘𝐾) |
| dihvalb.h | ⊢ 𝐻 = (LHyp‘𝐾) |
| dihvalb.i | ⊢ 𝐼 = ((DIsoH‘𝐾)‘𝑊) |
| dihvalb.d | ⊢ 𝐷 = ((DIsoB‘𝐾)‘𝑊) |
| Ref | Expression |
|---|---|
| dihvalb | ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≤ 𝑊)) → (𝐼‘𝑋) = (𝐷‘𝑋)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dihvalb.b | . . . 4 ⊢ 𝐵 = (Base‘𝐾) | |
| 2 | dihvalb.l | . . . 4 ⊢ ≤ = (le‘𝐾) | |
| 3 | eqid 2760 | . . . 4 ⊢ (join‘𝐾) = (join‘𝐾) | |
| 4 | eqid 2760 | . . . 4 ⊢ (meet‘𝐾) = (meet‘𝐾) | |
| 5 | eqid 2760 | . . . 4 ⊢ (Atoms‘𝐾) = (Atoms‘𝐾) | |
| 6 | dihvalb.h | . . . 4 ⊢ 𝐻 = (LHyp‘𝐾) | |
| 7 | dihvalb.i | . . . 4 ⊢ 𝐼 = ((DIsoH‘𝐾)‘𝑊) | |
| 8 | dihvalb.d | . . . 4 ⊢ 𝐷 = ((DIsoB‘𝐾)‘𝑊) | |
| 9 | eqid 2760 | . . . 4 ⊢ ((DIsoC‘𝐾)‘𝑊) = ((DIsoC‘𝐾)‘𝑊) | |
| 10 | eqid 2760 | . . . 4 ⊢ ((DVecH‘𝐾)‘𝑊) = ((DVecH‘𝐾)‘𝑊) | |
| 11 | eqid 2760 | . . . 4 ⊢ (LSubSp‘((DVecH‘𝐾)‘𝑊)) = (LSubSp‘((DVecH‘𝐾)‘𝑊)) | |
| 12 | eqid 2760 | . . . 4 ⊢ (LSSum‘((DVecH‘𝐾)‘𝑊)) = (LSSum‘((DVecH‘𝐾)‘𝑊)) | |
| 13 | 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12 | dihval 42108 | . . 3 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ 𝐵) → (𝐼‘𝑋) = if(𝑋 ≤ 𝑊, (𝐷‘𝑋), (℩𝑢 ∈ (LSubSp‘((DVecH‘𝐾)‘𝑊))∀𝑞 ∈ (Atoms‘𝐾)((¬ 𝑞 ≤ 𝑊 ∧ (𝑞(join‘𝐾)(𝑋(meet‘𝐾)𝑊)) = 𝑋) → 𝑢 = ((((DIsoC‘𝐾)‘𝑊)‘𝑞)(LSSum‘((DVecH‘𝐾)‘𝑊))(𝐷‘(𝑋(meet‘𝐾)𝑊))))))) |
| 14 | iftrue 4488 | . . 3 ⊢ (𝑋 ≤ 𝑊 → if(𝑋 ≤ 𝑊, (𝐷‘𝑋), (℩𝑢 ∈ (LSubSp‘((DVecH‘𝐾)‘𝑊))∀𝑞 ∈ (Atoms‘𝐾)((¬ 𝑞 ≤ 𝑊 ∧ (𝑞(join‘𝐾)(𝑋(meet‘𝐾)𝑊)) = 𝑋) → 𝑢 = ((((DIsoC‘𝐾)‘𝑊)‘𝑞)(LSSum‘((DVecH‘𝐾)‘𝑊))(𝐷‘(𝑋(meet‘𝐾)𝑊)))))) = (𝐷‘𝑋)) | |
| 15 | 13, 14 | sylan9eq 2815 | . 2 ⊢ ((((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ 𝐵) ∧ 𝑋 ≤ 𝑊) → (𝐼‘𝑋) = (𝐷‘𝑋)) |
| 16 | 15 | anasss 472 | 1 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≤ 𝑊)) → (𝐼‘𝑋) = (𝐷‘𝑋)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ∀wral 3076 ifcif 4482 class class class wbr 5103 ‘cfv 6533 ℩crio 7370 (class class class)co 7414 Basecbs 17304 lecple 17352 joincjn 18402 meetcmee 18403 LSSumclsm 19764 LSubSpclss 21118 Atomscatm 40139 LHypclh 40860 DVecHcdvh 41954 DIsoBcdib 42014 DIsoCcdic 42048 DIsoHcdih 42104 |
| 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 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-rep 5232 ax-sep 5251 ax-nul 5263 ax-pr 5398 |
| 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 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-reu 3366 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 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 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-riota 7371 df-ov 7417 df-dih 42105 |
| This theorem is used by: dihopelvalbN 42114 dih1dimb 42116 dih2dimb 42120 dih2dimbALTN 42121 dihvalcq2 42123 dihlss 42126 dihord6apre 42132 dihord3 42133 dihord5b 42135 dihord5apre 42138 dih0 42156 dihwN 42165 dihglblem3N 42171 dihmeetlem2N 42175 dih1dimatlem 42205 dihjatcclem4 42297 |
| Copyright terms: Public domain | W3C validator |