| 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 1155 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ 𝐵 ∧ (𝑓 ∈ 𝑇 ∧ (𝑅‘𝑓) ≤ (𝑋 ∧ 𝑊))) → (𝑓 ∈ 𝑇 ∧ (𝑅‘𝑓) ≤ (𝑋 ∧ 𝑊))) | |
| 2 | eqidd 2763 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ 𝐵 ∧ (𝑓 ∈ 𝑇 ∧ (𝑅‘𝑓) ≤ (𝑋 ∧ 𝑊))) → 𝑂 = 𝑂) | |
| 3 | simp1 1153 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ 𝐵 ∧ (𝑓 ∈ 𝑇 ∧ (𝑅‘𝑓) ≤ (𝑋 ∧ 𝑊))) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻)) | |
| 4 | simp1l 1215 | . . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ 𝐵 ∧ (𝑓 ∈ 𝑇 ∧ (𝑅‘𝑓) ≤ (𝑋 ∧ 𝑊))) → 𝐾 ∈ HL) | |
| 5 | 4 | hllatd 40166 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ 𝐵 ∧ (𝑓 ∈ 𝑇 ∧ (𝑅‘𝑓) ≤ (𝑋 ∧ 𝑊))) → 𝐾 ∈ Lat) |
| 6 | simp2 1154 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ 𝐵 ∧ (𝑓 ∈ 𝑇 ∧ (𝑅‘𝑓) ≤ (𝑋 ∧ 𝑊))) → 𝑋 ∈ 𝐵) | |
| 7 | simp1r 1216 | . . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ 𝐵 ∧ (𝑓 ∈ 𝑇 ∧ (𝑅‘𝑓) ≤ (𝑋 ∧ 𝑊))) → 𝑊 ∈ 𝐻) | |
| 8 | dihjust.b | . . . . . 6 ⊢ 𝐵 = (Base‘𝐾) | |
| 9 | dihjust.h | . . . . . 6 ⊢ 𝐻 = (LHyp‘𝐾) | |
| 10 | 8, 9 | lhpbase 40800 | . . . . 5 ⊢ (𝑊 ∈ 𝐻 → 𝑊 ∈ 𝐵) |
| 11 | 7, 10 | syl 18 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ 𝐵 ∧ (𝑓 ∈ 𝑇 ∧ (𝑅‘𝑓) ≤ (𝑋 ∧ 𝑊))) → 𝑊 ∈ 𝐵) |
| 12 | dihjust.m | . . . . 5 ⊢ ∧ = (meet‘𝐾) | |
| 13 | 8, 12 | latmcl 18502 | . . . 4 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑊 ∈ 𝐵) → (𝑋 ∧ 𝑊) ∈ 𝐵) |
| 14 | 5, 6, 11, 13 | syl3anc 1397 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ 𝐵 ∧ (𝑓 ∈ 𝑇 ∧ (𝑅‘𝑓) ≤ (𝑋 ∧ 𝑊))) → (𝑋 ∧ 𝑊) ∈ 𝐵) |
| 15 | dihjust.l | . . . . 5 ⊢ ≤ = (le‘𝐾) | |
| 16 | 8, 15, 12 | latmle2 18527 | . . . 4 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑊 ∈ 𝐵) → (𝑋 ∧ 𝑊) ≤ 𝑊) |
| 17 | 5, 6, 11, 16 | syl3anc 1397 | . . 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 41950 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑋 ∧ 𝑊) ∈ 𝐵 ∧ (𝑋 ∧ 𝑊) ≤ 𝑊)) → (〈𝑓, 𝑂〉 ∈ (𝐼‘(𝑋 ∧ 𝑊)) ↔ ((𝑓 ∈ 𝑇 ∧ (𝑅‘𝑓) ≤ (𝑋 ∧ 𝑊)) ∧ 𝑂 = 𝑂))) |
| 23 | 3, 14, 17, 22 | syl12anc 849 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ 𝐵 ∧ (𝑓 ∈ 𝑇 ∧ (𝑅‘𝑓) ≤ (𝑋 ∧ 𝑊))) → (〈𝑓, 𝑂〉 ∈ (𝐼‘(𝑋 ∧ 𝑊)) ↔ ((𝑓 ∈ 𝑇 ∧ (𝑅‘𝑓) ≤ (𝑋 ∧ 𝑊)) ∧ 𝑂 = 𝑂))) |
| 24 | 1, 2, 23 | mpbir2and 725 | 1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ 𝐵 ∧ (𝑓 ∈ 𝑇 ∧ (𝑅‘𝑓) ≤ (𝑋 ∧ 𝑊))) → 〈𝑓, 𝑂〉 ∈ (𝐼‘(𝑋 ∧ 𝑊))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 400 ∧ w3a 1102 = wceq 1569 ∈ wcel 2142 〈cop 4594 class class class wbr 5108 ↦ cmpt 5191 I cid 5554 ↾ cres 5662 ‘cfv 6536 (class class class)co 7412 Basecbs 17275 lecple 17323 joincjn 18373 meetcmee 18374 Latclat 18493 LSSumclsm 19710 Atomscatm 40065 HLchlt 40152 LHypclh 40786 LTrncltrn 40903 trLctrl 40960 DVecHcdvh 41880 DIsoBcdib 41940 DIsoCcdic 41974 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-rep 5237 ax-sep 5256 ax-nul 5268 ax-pow 5335 ax-pr 5403 ax-un 7734 |
| This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1104 df-tru 1572 df-fal 1582 df-ex 1809 df-nf 1813 df-sb 2096 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3079 df-rex 3089 df-rmo 3368 df-reu 3369 df-rab 3416 df-v 3456 df-sbc 3744 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-nul 4286 df-if 4487 df-pw 4563 df-sn 4589 df-pr 4591 df-op 4595 df-uni 4872 df-iun 4957 df-br 5109 df-opab 5173 df-mpt 5192 df-id 5555 df-xp 5666 df-rel 5667 df-cnv 5668 df-co 5669 df-dm 5670 df-rn 5671 df-res 5672 df-ima 5673 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7369 df-ov 7415 df-oprab 7416 df-lub 18406 df-glb 18407 df-join 18408 df-meet 18409 df-lat 18494 df-atl 40100 df-cvlat 40124 df-hlat 40153 df-lhyp 40790 df-disoa 41831 df-dib 41941 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |