![]() |
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 39693. 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 39581 | . . . 4 ⊢ (𝜑 → 𝐾 ∈ Lat) |
3 | dalemc.a | . . . . 5 ⊢ 𝐴 = (Atoms‘𝐾) | |
4 | 1, 3 | dalempeb 39596 | . . . 4 ⊢ (𝜑 → 𝑃 ∈ (Base‘𝐾)) |
5 | 1 | dalemkehl 39580 | . . . . 5 ⊢ (𝜑 → 𝐾 ∈ HL) |
6 | 1 | dalemqea 39584 | . . . . 5 ⊢ (𝜑 → 𝑄 ∈ 𝐴) |
7 | 1 | dalemrea 39585 | . . . . 5 ⊢ (𝜑 → 𝑅 ∈ 𝐴) |
8 | eqid 2740 | . . . . . 6 ⊢ (Base‘𝐾) = (Base‘𝐾) | |
9 | dalemc.j | . . . . . 6 ⊢ ∨ = (join‘𝐾) | |
10 | 8, 9, 3 | hlatjcl 39323 | . . . . 5 ⊢ ((𝐾 ∈ HL ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) → (𝑄 ∨ 𝑅) ∈ (Base‘𝐾)) |
11 | 5, 6, 7, 10 | syl3anc 1371 | . . . 4 ⊢ (𝜑 → (𝑄 ∨ 𝑅) ∈ (Base‘𝐾)) |
12 | dalemc.l | . . . . 5 ⊢ ≤ = (le‘𝐾) | |
13 | 8, 12, 9 | latlej1 18518 | . . . 4 ⊢ ((𝐾 ∈ Lat ∧ 𝑃 ∈ (Base‘𝐾) ∧ (𝑄 ∨ 𝑅) ∈ (Base‘𝐾)) → 𝑃 ≤ (𝑃 ∨ (𝑄 ∨ 𝑅))) |
14 | 2, 4, 11, 13 | syl3anc 1371 | . . 3 ⊢ (𝜑 → 𝑃 ≤ (𝑃 ∨ (𝑄 ∨ 𝑅))) |
15 | 1 | dalempea 39583 | . . . 4 ⊢ (𝜑 → 𝑃 ∈ 𝐴) |
16 | 9, 3 | hlatjass 39326 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴)) → ((𝑃 ∨ 𝑄) ∨ 𝑅) = (𝑃 ∨ (𝑄 ∨ 𝑅))) |
17 | 5, 15, 6, 7, 16 | syl13anc 1372 | . . 3 ⊢ (𝜑 → ((𝑃 ∨ 𝑄) ∨ 𝑅) = (𝑃 ∨ (𝑄 ∨ 𝑅))) |
18 | 14, 17 | breqtrrd 5194 | . 2 ⊢ (𝜑 → 𝑃 ≤ ((𝑃 ∨ 𝑄) ∨ 𝑅)) |
19 | dalempnes.y | . 2 ⊢ 𝑌 = ((𝑃 ∨ 𝑄) ∨ 𝑅) | |
20 | 18, 19 | breqtrrdi 5208 | 1 ⊢ (𝜑 → 𝑃 ≤ 𝑌) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1087 = wceq 1537 ∈ wcel 2108 class class class wbr 5166 ‘cfv 6573 (class class class)co 7448 Basecbs 17258 lecple 17318 joincjn 18381 Latclat 18501 Atomscatm 39219 HLchlt 39306 LPlanesclpl 39449 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2158 ax-12 2178 ax-ext 2711 ax-rep 5303 ax-sep 5317 ax-nul 5324 ax-pow 5383 ax-pr 5447 ax-un 7770 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2065 df-mo 2543 df-eu 2572 df-clab 2718 df-cleq 2732 df-clel 2819 df-nfc 2895 df-ne 2947 df-ral 3068 df-rex 3077 df-rmo 3388 df-reu 3389 df-rab 3444 df-v 3490 df-sbc 3805 df-csb 3922 df-dif 3979 df-un 3981 df-in 3983 df-ss 3993 df-nul 4353 df-if 4549 df-pw 4624 df-sn 4649 df-pr 4651 df-op 4655 df-uni 4932 df-iun 5017 df-br 5167 df-opab 5229 df-mpt 5250 df-id 5593 df-xp 5706 df-rel 5707 df-cnv 5708 df-co 5709 df-dm 5710 df-rn 5711 df-res 5712 df-ima 5713 df-iota 6525 df-fun 6575 df-fn 6576 df-f 6577 df-f1 6578 df-fo 6579 df-f1o 6580 df-fv 6581 df-riota 7404 df-ov 7451 df-oprab 7452 df-proset 18365 df-poset 18383 df-lub 18416 df-glb 18417 df-join 18418 df-meet 18419 df-lat 18502 df-ats 39223 df-atl 39254 df-cvlat 39278 df-hlat 39307 |
This theorem is referenced by: dalem21 39651 dalem23 39653 dalem24 39654 dalem27 39656 |
Copyright terms: Public domain | W3C validator |