| 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 41514 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 2761 | . 2 ⊢ (𝑓 ∈ 𝑇 ↦ (℩𝑖 ∈ 𝑇 (𝑖‘𝑃) = ((𝑃 ∨ (𝑅‘𝑓)) ∧ ((𝑁‘𝑃) ∨ (𝑅‘(𝑓 ∘ ◡𝐹)))))) = (𝑓 ∈ 𝑇 ↦ (℩𝑖 ∈ 𝑇 (𝑖‘𝑃) = ((𝑃 ∨ (𝑅‘𝑓)) ∧ ((𝑁‘𝑃) ∨ (𝑅‘(𝑓 ∘ ◡𝐹)))))) | |
| 12 | eqid 2761 | . 2 ⊢ (𝑒 ∈ 𝑇 ↦ (℩𝑗 ∈ 𝑇 (𝑗‘𝑃) = ((𝑃 ∨ (𝑅‘𝑒)) ∧ ((((𝑓 ∈ 𝑇 ↦ (℩𝑖 ∈ 𝑇 (𝑖‘𝑃) = ((𝑃 ∨ (𝑅‘𝑓)) ∧ ((𝑁‘𝑃) ∨ (𝑅‘(𝑓 ∘ ◡𝐹))))))‘𝑏)‘𝑃) ∨ (𝑅‘(𝑒 ∘ ◡𝑏)))))) = (𝑒 ∈ 𝑇 ↦ (℩𝑗 ∈ 𝑇 (𝑗‘𝑃) = ((𝑃 ∨ (𝑅‘𝑒)) ∧ ((((𝑓 ∈ 𝑇 ↦ (℩𝑖 ∈ 𝑇 (𝑖‘𝑃) = ((𝑃 ∨ (𝑅‘𝑓)) ∧ ((𝑁‘𝑃) ∨ (𝑅‘(𝑓 ∘ ◡𝐹))))))‘𝑏)‘𝑃) ∨ (𝑅‘(𝑒 ∘ ◡𝑏)))))) | |
| 13 | 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12 | cdlemk11ta 41514 | 1 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐹 ≠ ( I ↾ 𝐵)) ∧ (𝐺 ∈ 𝑇 ∧ 𝐺 ≠ ( I ↾ 𝐵))) ∧ (𝑁 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑅‘𝐹) = (𝑅‘𝑁)) ∧ (𝑏 ∈ 𝑇 ∧ (𝑏 ≠ ( I ↾ 𝐵) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝐹) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝐺)) ∧ (𝐼 ∈ 𝑇 ∧ 𝐼 ≠ ( I ↾ 𝐵) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝐼)))) → ⦋𝐺 / 𝑔⦌𝑌 ≤ (⦋𝐼 / 𝑔⦌𝑌 ∨ (𝑅‘(𝐼 ∘ ◡𝐺)))) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 399 ∧ w3a 1097 = wceq 1559 ∈ wcel 2141 ≠ wne 2956 ⦋csb 3850 class class class wbr 5097 ↦ cmpt 5178 I cid 5537 ◡ccnv 5642 ↾ cres 5645 ∘ ccom 5647 ‘cfv 6516 ℩crio 7347 (class class class)co 7391 Basecbs 17236 lecple 17284 joincjn 18334 meetcmee 18335 Atomscatm 39848 HLchlt 39935 LHypclh 40569 LTrncltrn 40686 trLctrl 40743 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-rep 5224 ax-sep 5243 ax-nul 5253 ax-pow 5319 ax-pr 5387 ax-un 7713 ax-riotaBAD 39538 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1098 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3076 df-rex 3086 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4580 df-pr 4582 df-op 4586 df-uni 4863 df-iun 4948 df-iin 4949 df-br 5098 df-opab 5160 df-mpt 5179 df-id 5538 df-xp 5649 df-rel 5650 df-cnv 5651 df-co 5652 df-dm 5653 df-rn 5654 df-res 5655 df-ima 5656 df-iota 6472 df-fun 6518 df-fn 6519 df-f 6520 df-f1 6521 df-fo 6522 df-f1o 6523 df-fv 6524 df-riota 7348 df-ov 7394 df-oprab 7395 df-mpo 7396 df-1st 7965 df-2nd 7966 df-undef 8247 df-map 8804 df-proset 18317 df-poset 18336 df-plt 18351 df-lub 18367 df-glb 18368 df-join 18369 df-meet 18370 df-p0 18446 df-p1 18447 df-lat 18455 df-clat 18522 df-oposet 39761 df-ol 39763 df-oml 39764 df-covers 39851 df-ats 39852 df-atl 39883 df-cvlat 39907 df-hlat 39936 df-llines 40083 df-lplanes 40084 df-lvols 40085 df-lines 40086 df-psubsp 40088 df-pmap 40089 df-padd 40381 df-lhyp 40573 df-laut 40574 df-ldil 40689 df-ltrn 40690 df-trl 40744 |
| This theorem is referenced by: cdlemk11tc 41530 |
| Copyright terms: Public domain | W3C validator |