| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > dalemply | Structured version Visualization version GIF version | ||
| Description: Lemma for dath 40538. Frequently-used utility lemma. (Contributed by NM, 13-Aug-2012.) |
| Ref | Expression |
|---|---|
| dalema.ph | ⊢ (𝜑 ↔ (((𝐾 ∈ HL ∧ 𝐶 ∈ (Base‘𝐾)) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑆 ∈ 𝐴 ∧ 𝑇 ∈ 𝐴 ∧ 𝑈 ∈ 𝐴)) ∧ (𝑌 ∈ 𝑂 ∧ 𝑍 ∈ 𝑂) ∧ ((¬ 𝐶 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝐶 ≤ (𝑄 ∨ 𝑅) ∧ ¬ 𝐶 ≤ (𝑅 ∨ 𝑃)) ∧ (¬ 𝐶 ≤ (𝑆 ∨ 𝑇) ∧ ¬ 𝐶 ≤ (𝑇 ∨ 𝑈) ∧ ¬ 𝐶 ≤ (𝑈 ∨ 𝑆)) ∧ (𝐶 ≤ (𝑃 ∨ 𝑆) ∧ 𝐶 ≤ (𝑄 ∨ 𝑇) ∧ 𝐶 ≤ (𝑅 ∨ 𝑈))))) |
| dalemc.l | ⊢ ≤ = (le‘𝐾) |
| dalemc.j | ⊢ ∨ = (join‘𝐾) |
| dalemc.a | ⊢ 𝐴 = (Atoms‘𝐾) |
| dalempnes.o | ⊢ 𝑂 = (LPlanes‘𝐾) |
| dalempnes.y | ⊢ 𝑌 = ((𝑃 ∨ 𝑄) ∨ 𝑅) |
| Ref | Expression |
|---|---|
| dalemply | ⊢ (𝜑 → 𝑃 ≤ 𝑌) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dalema.ph | . . . . 5 ⊢ (𝜑 ↔ (((𝐾 ∈ HL ∧ 𝐶 ∈ (Base‘𝐾)) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑆 ∈ 𝐴 ∧ 𝑇 ∈ 𝐴 ∧ 𝑈 ∈ 𝐴)) ∧ (𝑌 ∈ 𝑂 ∧ 𝑍 ∈ 𝑂) ∧ ((¬ 𝐶 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝐶 ≤ (𝑄 ∨ 𝑅) ∧ ¬ 𝐶 ≤ (𝑅 ∨ 𝑃)) ∧ (¬ 𝐶 ≤ (𝑆 ∨ 𝑇) ∧ ¬ 𝐶 ≤ (𝑇 ∨ 𝑈) ∧ ¬ 𝐶 ≤ (𝑈 ∨ 𝑆)) ∧ (𝐶 ≤ (𝑃 ∨ 𝑆) ∧ 𝐶 ≤ (𝑄 ∨ 𝑇) ∧ 𝐶 ≤ (𝑅 ∨ 𝑈))))) | |
| 2 | 1 | dalemkelat 40426 | . . . 4 ⊢ (𝜑 → 𝐾 ∈ Lat) |
| 3 | dalemc.a | . . . . 5 ⊢ 𝐴 = (Atoms‘𝐾) | |
| 4 | 1, 3 | dalempeb 40441 | . . . 4 ⊢ (𝜑 → 𝑃 ∈ (Base‘𝐾)) |
| 5 | 1 | dalemkehl 40425 | . . . . 5 ⊢ (𝜑 → 𝐾 ∈ HL) |
| 6 | 1 | dalemqea 40429 | . . . . 5 ⊢ (𝜑 → 𝑄 ∈ 𝐴) |
| 7 | 1 | dalemrea 40430 | . . . . 5 ⊢ (𝜑 → 𝑅 ∈ 𝐴) |
| 8 | eqid 2762 | . . . . . 6 ⊢ (Base‘𝐾) = (Base‘𝐾) | |
| 9 | dalemc.j | . . . . . 6 ⊢ ∨ = (join‘𝐾) | |
| 10 | 8, 9, 3 | hlatjcl 40169 | . . . . 5 ⊢ ((𝐾 ∈ HL ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) → (𝑄 ∨ 𝑅) ∈ (Base‘𝐾)) |
| 11 | 5, 6, 7, 10 | syl3anc 1397 | . . . 4 ⊢ (𝜑 → (𝑄 ∨ 𝑅) ∈ (Base‘𝐾)) |
| 12 | dalemc.l | . . . . 5 ⊢ ≤ = (le‘𝐾) | |
| 13 | 8, 12, 9 | latlej1 18510 | . . . 4 ⊢ ((𝐾 ∈ Lat ∧ 𝑃 ∈ (Base‘𝐾) ∧ (𝑄 ∨ 𝑅) ∈ (Base‘𝐾)) → 𝑃 ≤ (𝑃 ∨ (𝑄 ∨ 𝑅))) |
| 14 | 2, 4, 11, 13 | syl3anc 1397 | . . 3 ⊢ (𝜑 → 𝑃 ≤ (𝑃 ∨ (𝑄 ∨ 𝑅))) |
| 15 | 1 | dalempea 40428 | . . . 4 ⊢ (𝜑 → 𝑃 ∈ 𝐴) |
| 16 | 9, 3 | hlatjass 40172 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴)) → ((𝑃 ∨ 𝑄) ∨ 𝑅) = (𝑃 ∨ (𝑄 ∨ 𝑅))) |
| 17 | 5, 15, 6, 7, 16 | syl13anc 1398 | . . 3 ⊢ (𝜑 → ((𝑃 ∨ 𝑄) ∨ 𝑅) = (𝑃 ∨ (𝑄 ∨ 𝑅))) |
| 18 | 14, 17 | breqtrrd 5138 | . 2 ⊢ (𝜑 → 𝑃 ≤ ((𝑃 ∨ 𝑄) ∨ 𝑅)) |
| 19 | dalempnes.y | . 2 ⊢ 𝑌 = ((𝑃 ∨ 𝑄) ∨ 𝑅) | |
| 20 | 18, 19 | breqtrrdi 5152 | 1 ⊢ (𝜑 → 𝑃 ≤ 𝑌) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 400 ∧ w3a 1102 = wceq 1569 ∈ wcel 2142 class class class wbr 5108 ‘cfv 6536 (class class class)co 7412 Basecbs 17275 lecple 17323 joincjn 18373 Latclat 18493 Atomscatm 40065 HLchlt 40152 LPlanesclpl 40294 |
| 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-proset 18356 df-poset 18375 df-lub 18406 df-glb 18407 df-join 18408 df-meet 18409 df-lat 18494 df-ats 40069 df-atl 40100 df-cvlat 40124 df-hlat 40153 |
| This theorem is used by: dalem21 40496 dalem23 40498 dalem24 40499 dalem27 40501 |
| Copyright terms: Public domain | W3C validator |