| 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 2761 | . . . 4 ⊢ (join‘𝐾) = (join‘𝐾) | |
| 4 | eqid 2761 | . . . 4 ⊢ (meet‘𝐾) = (meet‘𝐾) | |
| 5 | eqid 2761 | . . . 4 ⊢ (Atoms‘𝐾) = (Atoms‘𝐾) | |
| 6 | dihvalb.h | . . . 4 ⊢ 𝐻 = (LHyp‘𝐾) | |
| 7 | dihvalb.i | . . . 4 ⊢ 𝐼 = ((DIsoH‘𝐾)‘𝑊) | |
| 8 | dihvalb.d | . . . 4 ⊢ 𝐷 = ((DIsoB‘𝐾)‘𝑊) | |
| 9 | eqid 2761 | . . . 4 ⊢ ((DIsoC‘𝐾)‘𝑊) = ((DIsoC‘𝐾)‘𝑊) | |
| 10 | eqid 2761 | . . . 4 ⊢ ((DVecH‘𝐾)‘𝑊) = ((DVecH‘𝐾)‘𝑊) | |
| 11 | eqid 2761 | . . . 4 ⊢ (LSubSp‘((DVecH‘𝐾)‘𝑊)) = (LSubSp‘((DVecH‘𝐾)‘𝑊)) | |
| 12 | eqid 2761 | . . . 4 ⊢ (LSSum‘((DVecH‘𝐾)‘𝑊)) = (LSSum‘((DVecH‘𝐾)‘𝑊)) | |
| 13 | 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12 | dihval 42289 | . . 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 2816 | . 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 3077 ifcif 4482 class class class wbr 5103 ‘cfv 6538 ℩crio 7376 (class class class)co 7420 Basecbs 17387 lecple 17435 joincjn 18485 meetcmee 18486 LSSumclsm 19848 LSubSpclss 21206 Atomscatm 40320 LHypclh 41041 DVecHcdvh 42135 DIsoBcdib 42195 DIsoCcdic 42229 DIsoHcdih 42285 |
| 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 2733 ax-rep 5232 ax-sep 5249 ax-nul 5260 ax-pr 5391 |
| 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 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3078 df-rex 3088 df-reu 3367 df-rab 3414 df-v 3453 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 5546 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 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-dih 42286 |
| This theorem is used by: dihopelvalbN 42295 dih1dimb 42297 dih2dimb 42301 dih2dimbALTN 42302 dihvalcq2 42304 dihlss 42307 dihord6apre 42313 dihord3 42314 dihord5b 42316 dihord5apre 42319 dih0 42337 dihwN 42346 dihglblem3N 42352 dihmeetlem2N 42356 dih1dimatlem 42386 dihjatcclem4 42478 |
| Copyright terms: Public domain | W3C validator |