| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > cdlemk19u1 | Structured version Visualization version GIF version | ||
| Description: cdlemk19 41498 with simpler hypotheses. TODO: Clean all this up. (Contributed by NM, 31-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 | ⊢ 𝑌 = ((𝑃 ∨ (𝑅‘𝑔)) ∧ (𝑍 ∨ (𝑅‘(𝑔 ∘ ◡𝑏)))) |
| cdlemk5.x | ⊢ 𝑋 = (℩𝑧 ∈ 𝑇 ∀𝑏 ∈ 𝑇 ((𝑏 ≠ ( I ↾ 𝐵) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝐹) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝑔)) → (𝑧‘𝑃) = 𝑌)) |
| cdlemk5.u | ⊢ 𝑈 = (𝑔 ∈ 𝑇 ↦ if(𝐹 = 𝑁, 𝑔, 𝑋)) |
| Ref | Expression |
|---|---|
| cdlemk19u1 | ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑅‘𝐹) = (𝑅‘𝑁)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐹 ≠ 𝑁 ∧ 𝑁 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → ((𝑈‘𝐹)‘𝑃) = (𝑁‘𝑃)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simp22 1222 | . . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑅‘𝐹) = (𝑅‘𝑁)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐹 ≠ 𝑁 ∧ 𝑁 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → 𝐹 ≠ 𝑁) | |
| 2 | simp21 1221 | . . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑅‘𝐹) = (𝑅‘𝑁)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐹 ≠ 𝑁 ∧ 𝑁 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → 𝐹 ∈ 𝑇) | |
| 3 | cdlemk5.x | . . . . 5 ⊢ 𝑋 = (℩𝑧 ∈ 𝑇 ∀𝑏 ∈ 𝑇 ((𝑏 ≠ ( I ↾ 𝐵) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝐹) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝑔)) → (𝑧‘𝑃) = 𝑌)) | |
| 4 | cdlemk5.u | . . . . 5 ⊢ 𝑈 = (𝑔 ∈ 𝑇 ↦ if(𝐹 = 𝑁, 𝑔, 𝑋)) | |
| 5 | 3, 4 | cdlemk40f 41548 | . . . 4 ⊢ ((𝐹 ≠ 𝑁 ∧ 𝐹 ∈ 𝑇) → (𝑈‘𝐹) = ⦋𝐹 / 𝑔⦌𝑋) |
| 6 | 1, 2, 5 | syl2anc 593 | . . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑅‘𝐹) = (𝑅‘𝑁)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐹 ≠ 𝑁 ∧ 𝑁 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝑈‘𝐹) = ⦋𝐹 / 𝑔⦌𝑋) |
| 7 | 6 | fveq1d 6871 | . 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑅‘𝐹) = (𝑅‘𝑁)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐹 ≠ 𝑁 ∧ 𝑁 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → ((𝑈‘𝐹)‘𝑃) = (⦋𝐹 / 𝑔⦌𝑋‘𝑃)) |
| 8 | simp1l 1212 | . . . . 5 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑅‘𝐹) = (𝑅‘𝑁)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐹 ≠ 𝑁 ∧ 𝑁 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻)) | |
| 9 | simp23 1223 | . . . . 5 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑅‘𝐹) = (𝑅‘𝑁)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐹 ≠ 𝑁 ∧ 𝑁 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → 𝑁 ∈ 𝑇) | |
| 10 | simp1r 1213 | . . . . 5 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑅‘𝐹) = (𝑅‘𝑁)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐹 ≠ 𝑁 ∧ 𝑁 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝑅‘𝐹) = (𝑅‘𝑁)) | |
| 11 | cdlemk5.b | . . . . . 6 ⊢ 𝐵 = (Base‘𝐾) | |
| 12 | cdlemk5.h | . . . . . 6 ⊢ 𝐻 = (LHyp‘𝐾) | |
| 13 | cdlemk5.t | . . . . . 6 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) | |
| 14 | cdlemk5.r | . . . . . 6 ⊢ 𝑅 = ((trL‘𝐾)‘𝑊) | |
| 15 | 11, 12, 13, 14 | trlnid 40808 | . . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ (𝐹 ≠ 𝑁 ∧ (𝑅‘𝐹) = (𝑅‘𝑁))) → 𝐹 ≠ ( I ↾ 𝐵)) |
| 16 | 8, 2, 9, 1, 10, 15 | syl122anc 1400 | . . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑅‘𝐹) = (𝑅‘𝑁)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐹 ≠ 𝑁 ∧ 𝑁 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → 𝐹 ≠ ( I ↾ 𝐵)) |
| 17 | 2, 16, 9 | 3jca 1142 | . . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑅‘𝐹) = (𝑅‘𝑁)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐹 ≠ 𝑁 ∧ 𝑁 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝐹 ∈ 𝑇 ∧ 𝐹 ≠ ( I ↾ 𝐵) ∧ 𝑁 ∈ 𝑇)) |
| 18 | cdlemk5.l | . . . 4 ⊢ ≤ = (le‘𝐾) | |
| 19 | cdlemk5.j | . . . 4 ⊢ ∨ = (join‘𝐾) | |
| 20 | cdlemk5.m | . . . 4 ⊢ ∧ = (meet‘𝐾) | |
| 21 | cdlemk5.a | . . . 4 ⊢ 𝐴 = (Atoms‘𝐾) | |
| 22 | cdlemk5.z | . . . 4 ⊢ 𝑍 = ((𝑃 ∨ (𝑅‘𝑏)) ∧ ((𝑁‘𝑃) ∨ (𝑅‘(𝑏 ∘ ◡𝐹)))) | |
| 23 | cdlemk5.y | . . . 4 ⊢ 𝑌 = ((𝑃 ∨ (𝑅‘𝑔)) ∧ (𝑍 ∨ (𝑅‘(𝑔 ∘ ◡𝑏)))) | |
| 24 | 11, 18, 19, 20, 21, 12, 13, 14, 22, 23, 3 | cdlemk19x 41572 | . . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑅‘𝐹) = (𝑅‘𝑁)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐹 ≠ ( I ↾ 𝐵) ∧ 𝑁 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (⦋𝐹 / 𝑔⦌𝑋‘𝑃) = (𝑁‘𝑃)) |
| 25 | 17, 24 | syld3an2 1432 | . 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑅‘𝐹) = (𝑅‘𝑁)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐹 ≠ 𝑁 ∧ 𝑁 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (⦋𝐹 / 𝑔⦌𝑋‘𝑃) = (𝑁‘𝑃)) |
| 26 | 7, 25 | eqtrd 2799 | 1 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑅‘𝐹) = (𝑅‘𝑁)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐹 ≠ 𝑁 ∧ 𝑁 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → ((𝑈‘𝐹)‘𝑃) = (𝑁‘𝑃)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 399 ∧ w3a 1099 = wceq 1562 ∈ wcel 2144 ≠ wne 2959 ∀wral 3078 ⦋csb 3854 ifcif 4482 class class class wbr 5102 ↦ cmpt 5183 I cid 5543 ◡ccnv 5648 ↾ cres 5651 ∘ ccom 5653 ‘cfv 6523 ℩crio 7354 (class class class)co 7398 Basecbs 17247 lecple 17295 joincjn 18345 meetcmee 18346 Atomscatm 39892 HLchlt 39979 LHypclh 40613 LTrncltrn 40730 trLctrl 40787 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1817 ax-4 1831 ax-5 1932 ax-6 1989 ax-7 2030 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2214 ax-ext 2736 ax-rep 5229 ax-sep 5248 ax-nul 5258 ax-pow 5324 ax-pr 5392 ax-un 7720 ax-riotaBAD 39582 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1100 df-3an 1101 df-tru 1565 df-fal 1575 df-ex 1802 df-nf 1806 df-sb 2093 df-mo 2568 df-eu 2598 df-clab 2743 df-cleq 2756 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3079 df-rex 3089 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3458 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4288 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-iin 4954 df-br 5103 df-opab 5165 df-mpt 5184 df-id 5544 df-xp 5655 df-rel 5656 df-cnv 5657 df-co 5658 df-dm 5659 df-rn 5660 df-res 5661 df-ima 5662 df-iota 6479 df-fun 6525 df-fn 6526 df-f 6527 df-f1 6528 df-fo 6529 df-f1o 6530 df-fv 6531 df-riota 7355 df-ov 7401 df-oprab 7402 df-mpo 7403 df-1st 7972 df-2nd 7973 df-undef 8255 df-map 8812 df-proset 18328 df-poset 18347 df-plt 18362 df-lub 18378 df-glb 18379 df-join 18380 df-meet 18381 df-p0 18457 df-p1 18458 df-lat 18466 df-clat 18533 df-oposet 39805 df-ol 39807 df-oml 39808 df-covers 39895 df-ats 39896 df-atl 39927 df-cvlat 39951 df-hlat 39980 df-llines 40127 df-lplanes 40128 df-lvols 40129 df-lines 40130 df-psubsp 40132 df-pmap 40133 df-padd 40425 df-lhyp 40617 df-laut 40618 df-ldil 40733 df-ltrn 40734 df-trl 40788 |
| This theorem is referenced by: cdlemk19u 41599 |
| Copyright terms: Public domain | W3C validator |