| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > dihord2cN | Structured version Visualization version GIF version | ||
| Description: Part of proof after Lemma N of [Crawley] p. 122. Reverse ordering property. TODO: needed? shorten other proof with it? (Contributed by NM, 3-Mar-2014.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| dihjust.b | ⊢ 𝐵 = (Base‘𝐾) |
| dihjust.l | ⊢ ≤ = (le‘𝐾) |
| dihjust.j | ⊢ ∨ = (join‘𝐾) |
| dihjust.m | ⊢ ∧ = (meet‘𝐾) |
| dihjust.a | ⊢ 𝐴 = (Atoms‘𝐾) |
| dihjust.h | ⊢ 𝐻 = (LHyp‘𝐾) |
| dihjust.i | ⊢ 𝐼 = ((DIsoB‘𝐾)‘𝑊) |
| dihjust.J | ⊢ 𝐽 = ((DIsoC‘𝐾)‘𝑊) |
| dihjust.u | ⊢ 𝑈 = ((DVecH‘𝐾)‘𝑊) |
| dihjust.s | ⊢ ⊕ = (LSSum‘𝑈) |
| dihord2c.t | ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) |
| dihord2c.r | ⊢ 𝑅 = ((trL‘𝐾)‘𝑊) |
| dihord2c.o | ⊢ 𝑂 = (ℎ ∈ 𝑇 ↦ ( I ↾ 𝐵)) |
| Ref | Expression |
|---|---|
| dihord2cN | ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ 𝐵 ∧ (𝑓 ∈ 𝑇 ∧ (𝑅‘𝑓) ≤ (𝑋 ∧ 𝑊))) → 〈𝑓, 𝑂〉 ∈ (𝐼‘(𝑋 ∧ 𝑊))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simp3 1156 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ 𝐵 ∧ (𝑓 ∈ 𝑇 ∧ (𝑅‘𝑓) ≤ (𝑋 ∧ 𝑊))) → (𝑓 ∈ 𝑇 ∧ (𝑅‘𝑓) ≤ (𝑋 ∧ 𝑊))) | |
| 2 | eqidd 2761 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ 𝐵 ∧ (𝑓 ∈ 𝑇 ∧ (𝑅‘𝑓) ≤ (𝑋 ∧ 𝑊))) → 𝑂 = 𝑂) | |
| 3 | simp1 1154 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ 𝐵 ∧ (𝑓 ∈ 𝑇 ∧ (𝑅‘𝑓) ≤ (𝑋 ∧ 𝑊))) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻)) | |
| 4 | simp1l 1216 | . . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ 𝐵 ∧ (𝑓 ∈ 𝑇 ∧ (𝑅‘𝑓) ≤ (𝑋 ∧ 𝑊))) → 𝐾 ∈ HL) | |
| 5 | 4 | hllatd 40341 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ 𝐵 ∧ (𝑓 ∈ 𝑇 ∧ (𝑅‘𝑓) ≤ (𝑋 ∧ 𝑊))) → 𝐾 ∈ Lat) |
| 6 | simp2 1155 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ 𝐵 ∧ (𝑓 ∈ 𝑇 ∧ (𝑅‘𝑓) ≤ (𝑋 ∧ 𝑊))) → 𝑋 ∈ 𝐵) | |
| 7 | simp1r 1217 | . . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ 𝐵 ∧ (𝑓 ∈ 𝑇 ∧ (𝑅‘𝑓) ≤ (𝑋 ∧ 𝑊))) → 𝑊 ∈ 𝐻) | |
| 8 | dihjust.b | . . . . . 6 ⊢ 𝐵 = (Base‘𝐾) | |
| 9 | dihjust.h | . . . . . 6 ⊢ 𝐻 = (LHyp‘𝐾) | |
| 10 | 8, 9 | lhpbase 40975 | . . . . 5 ⊢ (𝑊 ∈ 𝐻 → 𝑊 ∈ 𝐵) |
| 11 | 7, 10 | syl 18 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ 𝐵 ∧ (𝑓 ∈ 𝑇 ∧ (𝑅‘𝑓) ≤ (𝑋 ∧ 𝑊))) → 𝑊 ∈ 𝐵) |
| 12 | dihjust.m | . . . . 5 ⊢ ∧ = (meet‘𝐾) | |
| 13 | 8, 12 | latmcl 18575 | . . . 4 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑊 ∈ 𝐵) → (𝑋 ∧ 𝑊) ∈ 𝐵) |
| 14 | 5, 6, 11, 13 | syl3anc 1398 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ 𝐵 ∧ (𝑓 ∈ 𝑇 ∧ (𝑅‘𝑓) ≤ (𝑋 ∧ 𝑊))) → (𝑋 ∧ 𝑊) ∈ 𝐵) |
| 15 | dihjust.l | . . . . 5 ⊢ ≤ = (le‘𝐾) | |
| 16 | 8, 15, 12 | latmle2 18600 | . . . 4 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑊 ∈ 𝐵) → (𝑋 ∧ 𝑊) ≤ 𝑊) |
| 17 | 5, 6, 11, 16 | syl3anc 1398 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ 𝐵 ∧ (𝑓 ∈ 𝑇 ∧ (𝑅‘𝑓) ≤ (𝑋 ∧ 𝑊))) → (𝑋 ∧ 𝑊) ≤ 𝑊) |
| 18 | dihord2c.t | . . . 4 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) | |
| 19 | dihord2c.r | . . . 4 ⊢ 𝑅 = ((trL‘𝐾)‘𝑊) | |
| 20 | dihord2c.o | . . . 4 ⊢ 𝑂 = (ℎ ∈ 𝑇 ↦ ( I ↾ 𝐵)) | |
| 21 | dihjust.i | . . . 4 ⊢ 𝐼 = ((DIsoB‘𝐾)‘𝑊) | |
| 22 | 8, 15, 9, 18, 19, 20, 21 | dibopelval3 42125 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑋 ∧ 𝑊) ∈ 𝐵 ∧ (𝑋 ∧ 𝑊) ≤ 𝑊)) → (〈𝑓, 𝑂〉 ∈ (𝐼‘(𝑋 ∧ 𝑊)) ↔ ((𝑓 ∈ 𝑇 ∧ (𝑅‘𝑓) ≤ (𝑋 ∧ 𝑊)) ∧ 𝑂 = 𝑂))) |
| 23 | 3, 14, 17, 22 | syl12anc 850 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ 𝐵 ∧ (𝑓 ∈ 𝑇 ∧ (𝑅‘𝑓) ≤ (𝑋 ∧ 𝑊))) → (〈𝑓, 𝑂〉 ∈ (𝐼‘(𝑋 ∧ 𝑊)) ↔ ((𝑓 ∈ 𝑇 ∧ (𝑅‘𝑓) ≤ (𝑋 ∧ 𝑊)) ∧ 𝑂 = 𝑂))) |
| 24 | 1, 2, 23 | mpbir2and 726 | 1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ 𝐵 ∧ (𝑓 ∈ 𝑇 ∧ (𝑅‘𝑓) ≤ (𝑋 ∧ 𝑊))) → 〈𝑓, 𝑂〉 ∈ (𝐼‘(𝑋 ∧ 𝑊))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 〈cop 4589 class class class wbr 5102 ↦ cmpt 5185 I cid 5541 ↾ cres 5649 ‘cfv 6527 (class class class)co 7408 Basecbs 17348 lecple 17396 joincjn 18446 meetcmee 18447 Latclat 18566 LSSumclsm 19809 Atomscatm 40240 HLchlt 40327 LHypclh 40961 LTrncltrn 41078 trLctrl 41135 DVecHcdvh 42055 DIsoBcdib 42115 DIsoCcdic 42149 |
| 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 5231 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7734 |
| 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-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-id 5542 df-xp 5653 df-rel 5654 df-cnv 5655 df-co 5656 df-dm 5657 df-rn 5658 df-res 5659 df-ima 5660 df-iota 6483 df-fun 6529 df-fn 6530 df-f 6531 df-f1 6532 df-fo 6533 df-f1o 6534 df-fv 6535 df-riota 7365 df-ov 7411 df-oprab 7412 df-lub 18479 df-glb 18480 df-join 18481 df-meet 18482 df-lat 18567 df-atl 40275 df-cvlat 40299 df-hlat 40328 df-lhyp 40965 df-disoa 42006 df-dib 42116 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |