| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > cdlemg5 | Structured version Visualization version GIF version | ||
| Description: TODO: Is there a simpler more direct proof, that could be placed earlier e.g. near lhpexle 40725? TODO: The ∨ hypothesis is unused. FIX COMMENT. (Contributed by NM, 26-Apr-2013.) |
| Ref | Expression |
|---|---|
| cdlemg5.l | ⊢ ≤ = (le‘𝐾) |
| cdlemg5.j | ⊢ ∨ = (join‘𝐾) |
| cdlemg5.a | ⊢ 𝐴 = (Atoms‘𝐾) |
| cdlemg5.h | ⊢ 𝐻 = (LHyp‘𝐾) |
| Ref | Expression |
|---|---|
| cdlemg5 | ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → ∃𝑞 ∈ 𝐴 (𝑃 ≠ 𝑞 ∧ ¬ 𝑞 ≤ 𝑊)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cdlemg5.l | . . . 4 ⊢ ≤ = (le‘𝐾) | |
| 2 | cdlemg5.a | . . . 4 ⊢ 𝐴 = (Atoms‘𝐾) | |
| 3 | cdlemg5.h | . . . 4 ⊢ 𝐻 = (LHyp‘𝐾) | |
| 4 | 1, 2, 3 | lhpexle 40725 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → ∃𝑟 ∈ 𝐴 𝑟 ≤ 𝑊) |
| 5 | 4 | adantr 485 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → ∃𝑟 ∈ 𝐴 𝑟 ≤ 𝑊) |
| 6 | simpll 778 | . . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ (𝑟 ∈ 𝐴 ∧ 𝑟 ≤ 𝑊)) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻)) | |
| 7 | simpr 489 | . . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ (𝑟 ∈ 𝐴 ∧ 𝑟 ≤ 𝑊)) → (𝑟 ∈ 𝐴 ∧ 𝑟 ≤ 𝑊)) | |
| 8 | simplr 780 | . . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ (𝑟 ∈ 𝐴 ∧ 𝑟 ≤ 𝑊)) → (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) | |
| 9 | cdlemg5.j | . . . . 5 ⊢ ∨ = (join‘𝐾) | |
| 10 | 1, 9, 2, 3 | cdlemf1 41281 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑟 ∈ 𝐴 ∧ 𝑟 ≤ 𝑊) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → ∃𝑞 ∈ 𝐴 (𝑃 ≠ 𝑞 ∧ ¬ 𝑞 ≤ 𝑊 ∧ 𝑟 ≤ (𝑃 ∨ 𝑞))) |
| 11 | 6, 7, 8, 10 | syl3anc 1396 | . . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ (𝑟 ∈ 𝐴 ∧ 𝑟 ≤ 𝑊)) → ∃𝑞 ∈ 𝐴 (𝑃 ≠ 𝑞 ∧ ¬ 𝑞 ≤ 𝑊 ∧ 𝑟 ≤ (𝑃 ∨ 𝑞))) |
| 12 | 3simpa 1164 | . . . 4 ⊢ ((𝑃 ≠ 𝑞 ∧ ¬ 𝑞 ≤ 𝑊 ∧ 𝑟 ≤ (𝑃 ∨ 𝑞)) → (𝑃 ≠ 𝑞 ∧ ¬ 𝑞 ≤ 𝑊)) | |
| 13 | 12 | reximi 3101 | . . 3 ⊢ (∃𝑞 ∈ 𝐴 (𝑃 ≠ 𝑞 ∧ ¬ 𝑞 ≤ 𝑊 ∧ 𝑟 ≤ (𝑃 ∨ 𝑞)) → ∃𝑞 ∈ 𝐴 (𝑃 ≠ 𝑞 ∧ ¬ 𝑞 ≤ 𝑊)) |
| 14 | 11, 13 | syl 18 | . 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ (𝑟 ∈ 𝐴 ∧ 𝑟 ≤ 𝑊)) → ∃𝑞 ∈ 𝐴 (𝑃 ≠ 𝑞 ∧ ¬ 𝑞 ≤ 𝑊)) |
| 15 | 5, 14 | rexlimddv 3170 | 1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → ∃𝑞 ∈ 𝐴 (𝑃 ≠ 𝑞 ∧ ¬ 𝑞 ≤ 𝑊)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 400 ∧ w3a 1101 = wceq 1568 ∈ wcel 2141 ≠ wne 2956 ∃wrex 3087 class class class wbr 5108 ‘cfv 6536 (class class class)co 7410 lecple 17316 joincjn 18366 Atomscatm 39983 HLchlt 40070 LHypclh 40704 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1823 ax-4 1837 ax-5 1938 ax-6 1995 ax-7 2036 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-rep 5237 ax-sep 5256 ax-nul 5268 ax-pow 5336 ax-pr 5404 ax-un 7732 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1571 df-fal 1581 df-ex 1808 df-nf 1812 df-sb 2095 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3078 df-rex 3088 df-rmo 3367 df-reu 3368 df-rab 3415 df-v 3455 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 5556 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 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 7367 df-ov 7413 df-oprab 7414 df-proset 18349 df-poset 18368 df-plt 18383 df-lub 18399 df-glb 18400 df-join 18401 df-meet 18402 df-p0 18478 df-p1 18479 df-lat 18487 df-clat 18554 df-oposet 39896 df-ol 39898 df-oml 39899 df-covers 39986 df-ats 39987 df-atl 40018 df-cvlat 40042 df-hlat 40071 df-lhyp 40708 |
| This theorem is referenced by: cdlemb3 41326 |
| Copyright terms: Public domain | W3C validator |