Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > dalemsly | Structured version Visualization version GIF version |
Description: Lemma for dath 35022. Frequently-used utility lemma. (Contributed by NM, 15-Aug-2012.) |
Ref | Expression |
---|---|
dalema.ph | ⊢ (𝜑 ↔ (((𝐾 ∈ HL ∧ 𝐶 ∈ (Base‘𝐾)) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑆 ∈ 𝐴 ∧ 𝑇 ∈ 𝐴 ∧ 𝑈 ∈ 𝐴)) ∧ (𝑌 ∈ 𝑂 ∧ 𝑍 ∈ 𝑂) ∧ ((¬ 𝐶 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝐶 ≤ (𝑄 ∨ 𝑅) ∧ ¬ 𝐶 ≤ (𝑅 ∨ 𝑃)) ∧ (¬ 𝐶 ≤ (𝑆 ∨ 𝑇) ∧ ¬ 𝐶 ≤ (𝑇 ∨ 𝑈) ∧ ¬ 𝐶 ≤ (𝑈 ∨ 𝑆)) ∧ (𝐶 ≤ (𝑃 ∨ 𝑆) ∧ 𝐶 ≤ (𝑄 ∨ 𝑇) ∧ 𝐶 ≤ (𝑅 ∨ 𝑈))))) |
dalemc.l | ⊢ ≤ = (le‘𝐾) |
dalemc.j | ⊢ ∨ = (join‘𝐾) |
dalemc.a | ⊢ 𝐴 = (Atoms‘𝐾) |
dalemsly.z | ⊢ 𝑍 = ((𝑆 ∨ 𝑇) ∨ 𝑈) |
Ref | Expression |
---|---|
dalemsly | ⊢ ((𝜑 ∧ 𝑌 = 𝑍) → 𝑆 ≤ 𝑌) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | dalema.ph | . . . . . . 7 ⊢ (𝜑 ↔ (((𝐾 ∈ HL ∧ 𝐶 ∈ (Base‘𝐾)) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑆 ∈ 𝐴 ∧ 𝑇 ∈ 𝐴 ∧ 𝑈 ∈ 𝐴)) ∧ (𝑌 ∈ 𝑂 ∧ 𝑍 ∈ 𝑂) ∧ ((¬ 𝐶 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝐶 ≤ (𝑄 ∨ 𝑅) ∧ ¬ 𝐶 ≤ (𝑅 ∨ 𝑃)) ∧ (¬ 𝐶 ≤ (𝑆 ∨ 𝑇) ∧ ¬ 𝐶 ≤ (𝑇 ∨ 𝑈) ∧ ¬ 𝐶 ≤ (𝑈 ∨ 𝑆)) ∧ (𝐶 ≤ (𝑃 ∨ 𝑆) ∧ 𝐶 ≤ (𝑄 ∨ 𝑇) ∧ 𝐶 ≤ (𝑅 ∨ 𝑈))))) | |
2 | 1 | dalemkelat 34910 | . . . . . 6 ⊢ (𝜑 → 𝐾 ∈ Lat) |
3 | dalemc.a | . . . . . . 7 ⊢ 𝐴 = (Atoms‘𝐾) | |
4 | 1, 3 | dalemseb 34928 | . . . . . 6 ⊢ (𝜑 → 𝑆 ∈ (Base‘𝐾)) |
5 | dalemc.j | . . . . . . 7 ⊢ ∨ = (join‘𝐾) | |
6 | 1, 5, 3 | dalemtjueb 34933 | . . . . . 6 ⊢ (𝜑 → (𝑇 ∨ 𝑈) ∈ (Base‘𝐾)) |
7 | eqid 2622 | . . . . . . 7 ⊢ (Base‘𝐾) = (Base‘𝐾) | |
8 | dalemc.l | . . . . . . 7 ⊢ ≤ = (le‘𝐾) | |
9 | 7, 8, 5 | latlej1 17060 | . . . . . 6 ⊢ ((𝐾 ∈ Lat ∧ 𝑆 ∈ (Base‘𝐾) ∧ (𝑇 ∨ 𝑈) ∈ (Base‘𝐾)) → 𝑆 ≤ (𝑆 ∨ (𝑇 ∨ 𝑈))) |
10 | 2, 4, 6, 9 | syl3anc 1326 | . . . . 5 ⊢ (𝜑 → 𝑆 ≤ (𝑆 ∨ (𝑇 ∨ 𝑈))) |
11 | 1 | dalemkehl 34909 | . . . . . 6 ⊢ (𝜑 → 𝐾 ∈ HL) |
12 | 1 | dalemsea 34915 | . . . . . 6 ⊢ (𝜑 → 𝑆 ∈ 𝐴) |
13 | 1 | dalemtea 34916 | . . . . . 6 ⊢ (𝜑 → 𝑇 ∈ 𝐴) |
14 | 1 | dalemuea 34917 | . . . . . 6 ⊢ (𝜑 → 𝑈 ∈ 𝐴) |
15 | 5, 3 | hlatjass 34656 | . . . . . 6 ⊢ ((𝐾 ∈ HL ∧ (𝑆 ∈ 𝐴 ∧ 𝑇 ∈ 𝐴 ∧ 𝑈 ∈ 𝐴)) → ((𝑆 ∨ 𝑇) ∨ 𝑈) = (𝑆 ∨ (𝑇 ∨ 𝑈))) |
16 | 11, 12, 13, 14, 15 | syl13anc 1328 | . . . . 5 ⊢ (𝜑 → ((𝑆 ∨ 𝑇) ∨ 𝑈) = (𝑆 ∨ (𝑇 ∨ 𝑈))) |
17 | 10, 16 | breqtrrd 4681 | . . . 4 ⊢ (𝜑 → 𝑆 ≤ ((𝑆 ∨ 𝑇) ∨ 𝑈)) |
18 | dalemsly.z | . . . 4 ⊢ 𝑍 = ((𝑆 ∨ 𝑇) ∨ 𝑈) | |
19 | 17, 18 | syl6breqr 4695 | . . 3 ⊢ (𝜑 → 𝑆 ≤ 𝑍) |
20 | 19 | adantr 481 | . 2 ⊢ ((𝜑 ∧ 𝑌 = 𝑍) → 𝑆 ≤ 𝑍) |
21 | simpr 477 | . 2 ⊢ ((𝜑 ∧ 𝑌 = 𝑍) → 𝑌 = 𝑍) | |
22 | 20, 21 | breqtrrd 4681 | 1 ⊢ ((𝜑 ∧ 𝑌 = 𝑍) → 𝑆 ≤ 𝑌) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 196 ∧ wa 384 ∧ w3a 1037 = wceq 1483 ∈ wcel 1990 class class class wbr 4653 ‘cfv 5888 (class class class)co 6650 Basecbs 15857 lecple 15948 joincjn 16944 Latclat 17045 Atomscatm 34550 HLchlt 34637 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-8 1992 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-rep 4771 ax-sep 4781 ax-nul 4789 ax-pow 4843 ax-pr 4906 ax-un 6949 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-ral 2917 df-rex 2918 df-reu 2919 df-rab 2921 df-v 3202 df-sbc 3436 df-csb 3534 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-nul 3916 df-if 4087 df-pw 4160 df-sn 4178 df-pr 4180 df-op 4184 df-uni 4437 df-iun 4522 df-br 4654 df-opab 4713 df-mpt 4730 df-id 5024 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-rn 5125 df-res 5126 df-ima 5127 df-iota 5851 df-fun 5890 df-fn 5891 df-f 5892 df-f1 5893 df-fo 5894 df-f1o 5895 df-fv 5896 df-riota 6611 df-ov 6653 df-oprab 6654 df-preset 16928 df-poset 16946 df-lub 16974 df-glb 16975 df-join 16976 df-meet 16977 df-lat 17046 df-ats 34554 df-atl 34585 df-cvlat 34609 df-hlat 34638 |
This theorem is referenced by: dalem21 34980 dalem23 34982 dalem24 34983 dalem25 34984 |
Copyright terms: Public domain | W3C validator |