| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > cdlemk11tb | Structured version Visualization version GIF version | ||
| Description: Part of proof of Lemma K of [Crawley] p. 118. Lemma for Eq. 5, p. 119. 𝐺, 𝐼 stand for g, h. cdlemk11ta 41588 with hypotheses removed. TODO: Can this be proved directly with no quantification? (Contributed by NM, 21-Jul-2013.) |
| Ref | Expression |
|---|---|
| cdlemk5.b | ⊢ 𝐵 = (Base‘𝐾) |
| cdlemk5.l | ⊢ ≤ = (le‘𝐾) |
| cdlemk5.j | ⊢ ∨ = (join‘𝐾) |
| cdlemk5.m | ⊢ ∧ = (meet‘𝐾) |
| cdlemk5.a | ⊢ 𝐴 = (Atoms‘𝐾) |
| cdlemk5.h | ⊢ 𝐻 = (LHyp‘𝐾) |
| cdlemk5.t | ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) |
| cdlemk5.r | ⊢ 𝑅 = ((trL‘𝐾)‘𝑊) |
| cdlemk5.z | ⊢ 𝑍 = ((𝑃 ∨ (𝑅‘𝑏)) ∧ ((𝑁‘𝑃) ∨ (𝑅‘(𝑏 ∘ ◡𝐹)))) |
| cdlemk5.y | ⊢ 𝑌 = ((𝑃 ∨ (𝑅‘𝑔)) ∧ (𝑍 ∨ (𝑅‘(𝑔 ∘ ◡𝑏)))) |
| Ref | Expression |
|---|---|
| cdlemk11tb | ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐹 ≠ ( I ↾ 𝐵)) ∧ (𝐺 ∈ 𝑇 ∧ 𝐺 ≠ ( I ↾ 𝐵))) ∧ (𝑁 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑅‘𝐹) = (𝑅‘𝑁)) ∧ (𝑏 ∈ 𝑇 ∧ (𝑏 ≠ ( I ↾ 𝐵) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝐹) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝐺)) ∧ (𝐼 ∈ 𝑇 ∧ 𝐼 ≠ ( I ↾ 𝐵) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝐼)))) → ⦋𝐺 / 𝑔⦌𝑌 ≤ (⦋𝐼 / 𝑔⦌𝑌 ∨ (𝑅‘(𝐼 ∘ ◡𝐺)))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cdlemk5.b | . 2 ⊢ 𝐵 = (Base‘𝐾) | |
| 2 | cdlemk5.l | . 2 ⊢ ≤ = (le‘𝐾) | |
| 3 | cdlemk5.j | . 2 ⊢ ∨ = (join‘𝐾) | |
| 4 | cdlemk5.m | . 2 ⊢ ∧ = (meet‘𝐾) | |
| 5 | cdlemk5.a | . 2 ⊢ 𝐴 = (Atoms‘𝐾) | |
| 6 | cdlemk5.h | . 2 ⊢ 𝐻 = (LHyp‘𝐾) | |
| 7 | cdlemk5.t | . 2 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) | |
| 8 | cdlemk5.r | . 2 ⊢ 𝑅 = ((trL‘𝐾)‘𝑊) | |
| 9 | cdlemk5.z | . 2 ⊢ 𝑍 = ((𝑃 ∨ (𝑅‘𝑏)) ∧ ((𝑁‘𝑃) ∨ (𝑅‘(𝑏 ∘ ◡𝐹)))) | |
| 10 | cdlemk5.y | . 2 ⊢ 𝑌 = ((𝑃 ∨ (𝑅‘𝑔)) ∧ (𝑍 ∨ (𝑅‘(𝑔 ∘ ◡𝑏)))) | |
| 11 | eqid 2769 | . 2 ⊢ (𝑓 ∈ 𝑇 ↦ (℩𝑖 ∈ 𝑇 (𝑖‘𝑃) = ((𝑃 ∨ (𝑅‘𝑓)) ∧ ((𝑁‘𝑃) ∨ (𝑅‘(𝑓 ∘ ◡𝐹)))))) = (𝑓 ∈ 𝑇 ↦ (℩𝑖 ∈ 𝑇 (𝑖‘𝑃) = ((𝑃 ∨ (𝑅‘𝑓)) ∧ ((𝑁‘𝑃) ∨ (𝑅‘(𝑓 ∘ ◡𝐹)))))) | |
| 12 | eqid 2769 | . 2 ⊢ (𝑒 ∈ 𝑇 ↦ (℩𝑗 ∈ 𝑇 (𝑗‘𝑃) = ((𝑃 ∨ (𝑅‘𝑒)) ∧ ((((𝑓 ∈ 𝑇 ↦ (℩𝑖 ∈ 𝑇 (𝑖‘𝑃) = ((𝑃 ∨ (𝑅‘𝑓)) ∧ ((𝑁‘𝑃) ∨ (𝑅‘(𝑓 ∘ ◡𝐹))))))‘𝑏)‘𝑃) ∨ (𝑅‘(𝑒 ∘ ◡𝑏)))))) = (𝑒 ∈ 𝑇 ↦ (℩𝑗 ∈ 𝑇 (𝑗‘𝑃) = ((𝑃 ∨ (𝑅‘𝑒)) ∧ ((((𝑓 ∈ 𝑇 ↦ (℩𝑖 ∈ 𝑇 (𝑖‘𝑃) = ((𝑃 ∨ (𝑅‘𝑓)) ∧ ((𝑁‘𝑃) ∨ (𝑅‘(𝑓 ∘ ◡𝐹))))))‘𝑏)‘𝑃) ∨ (𝑅‘(𝑒 ∘ ◡𝑏)))))) | |
| 13 | 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12 | cdlemk11ta 41588 | 1 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐹 ≠ ( I ↾ 𝐵)) ∧ (𝐺 ∈ 𝑇 ∧ 𝐺 ≠ ( I ↾ 𝐵))) ∧ (𝑁 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑅‘𝐹) = (𝑅‘𝑁)) ∧ (𝑏 ∈ 𝑇 ∧ (𝑏 ≠ ( I ↾ 𝐵) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝐹) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝐺)) ∧ (𝐼 ∈ 𝑇 ∧ 𝐼 ≠ ( I ↾ 𝐵) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝐼)))) → ⦋𝐺 / 𝑔⦌𝑌 ≤ (⦋𝐼 / 𝑔⦌𝑌 ∨ (𝑅‘(𝐼 ∘ ◡𝐺)))) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 400 ∧ w3a 1101 = wceq 1567 ∈ wcel 2149 ≠ wne 2964 ⦋csb 3861 class class class wbr 5110 ↦ cmpt 5193 I cid 5553 ◡ccnv 5658 ↾ cres 5661 ∘ ccom 5663 ‘cfv 6533 ℩crio 7364 (class class class)co 7408 Basecbs 17265 lecple 17313 joincjn 18363 meetcmee 18364 Atomscatm 39922 HLchlt 40009 LHypclh 40643 LTrncltrn 40760 trLctrl 40817 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-rep 5239 ax-sep 5258 ax-nul 5268 ax-pow 5334 ax-pr 5402 ax-un 7730 ax-riotaBAD 39612 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-ral 3086 df-rex 3096 df-rmo 3376 df-reu 3377 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-nul 4295 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4874 df-iun 4959 df-iin 4960 df-br 5111 df-opab 5175 df-mpt 5194 df-id 5554 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 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 7365 df-ov 7411 df-oprab 7412 df-mpo 7413 df-1st 7982 df-2nd 7983 df-undef 8265 df-map 8822 df-proset 18346 df-poset 18365 df-plt 18380 df-lub 18396 df-glb 18397 df-join 18398 df-meet 18399 df-p0 18475 df-p1 18476 df-lat 18484 df-clat 18551 df-oposet 39835 df-ol 39837 df-oml 39838 df-covers 39925 df-ats 39926 df-atl 39957 df-cvlat 39981 df-hlat 40010 df-llines 40157 df-lplanes 40158 df-lvols 40159 df-lines 40160 df-psubsp 40162 df-pmap 40163 df-padd 40455 df-lhyp 40647 df-laut 40648 df-ldil 40763 df-ltrn 40764 df-trl 40818 |
| This theorem is referenced by: cdlemk11tc 41604 |
| Copyright terms: Public domain | W3C validator |