![]() |
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 34040. 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 33928 | . . . . . 6 ⊢ (𝜑 → 𝐾 ∈ Lat) |
3 | dalemc.a | . . . . . . 7 ⊢ 𝐴 = (Atoms‘𝐾) | |
4 | 1, 3 | dalemseb 33946 | . . . . . 6 ⊢ (𝜑 → 𝑆 ∈ (Base‘𝐾)) |
5 | dalemc.j | . . . . . . 7 ⊢ ∨ = (join‘𝐾) | |
6 | 1, 5, 3 | dalemtjueb 33951 | . . . . . 6 ⊢ (𝜑 → (𝑇 ∨ 𝑈) ∈ (Base‘𝐾)) |
7 | eqid 2610 | . . . . . . 7 ⊢ (Base‘𝐾) = (Base‘𝐾) | |
8 | dalemc.l | . . . . . . 7 ⊢ ≤ = (le‘𝐾) | |
9 | 7, 8, 5 | latlej1 16883 | . . . . . 6 ⊢ ((𝐾 ∈ Lat ∧ 𝑆 ∈ (Base‘𝐾) ∧ (𝑇 ∨ 𝑈) ∈ (Base‘𝐾)) → 𝑆 ≤ (𝑆 ∨ (𝑇 ∨ 𝑈))) |
10 | 2, 4, 6, 9 | syl3anc 1318 | . . . . 5 ⊢ (𝜑 → 𝑆 ≤ (𝑆 ∨ (𝑇 ∨ 𝑈))) |
11 | 1 | dalemkehl 33927 | . . . . . 6 ⊢ (𝜑 → 𝐾 ∈ HL) |
12 | 1 | dalemsea 33933 | . . . . . 6 ⊢ (𝜑 → 𝑆 ∈ 𝐴) |
13 | 1 | dalemtea 33934 | . . . . . 6 ⊢ (𝜑 → 𝑇 ∈ 𝐴) |
14 | 1 | dalemuea 33935 | . . . . . 6 ⊢ (𝜑 → 𝑈 ∈ 𝐴) |
15 | 5, 3 | hlatjass 33674 | . . . . . 6 ⊢ ((𝐾 ∈ HL ∧ (𝑆 ∈ 𝐴 ∧ 𝑇 ∈ 𝐴 ∧ 𝑈 ∈ 𝐴)) → ((𝑆 ∨ 𝑇) ∨ 𝑈) = (𝑆 ∨ (𝑇 ∨ 𝑈))) |
16 | 11, 12, 13, 14, 15 | syl13anc 1320 | . . . . 5 ⊢ (𝜑 → ((𝑆 ∨ 𝑇) ∨ 𝑈) = (𝑆 ∨ (𝑇 ∨ 𝑈))) |
17 | 10, 16 | breqtrrd 4611 | . . . 4 ⊢ (𝜑 → 𝑆 ≤ ((𝑆 ∨ 𝑇) ∨ 𝑈)) |
18 | dalemsly.z | . . . 4 ⊢ 𝑍 = ((𝑆 ∨ 𝑇) ∨ 𝑈) | |
19 | 17, 18 | syl6breqr 4625 | . . 3 ⊢ (𝜑 → 𝑆 ≤ 𝑍) |
20 | 19 | adantr 480 | . 2 ⊢ ((𝜑 ∧ 𝑌 = 𝑍) → 𝑆 ≤ 𝑍) |
21 | simpr 476 | . 2 ⊢ ((𝜑 ∧ 𝑌 = 𝑍) → 𝑌 = 𝑍) | |
22 | 20, 21 | breqtrrd 4611 | 1 ⊢ ((𝜑 ∧ 𝑌 = 𝑍) → 𝑆 ≤ 𝑌) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 195 ∧ wa 383 ∧ w3a 1031 = wceq 1475 ∈ wcel 1977 class class class wbr 4583 ‘cfv 5804 (class class class)co 6549 Basecbs 15695 lecple 15775 joincjn 16767 Latclat 16868 Atomscatm 33568 HLchlt 33655 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-rep 4699 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-un 6847 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-ral 2901 df-rex 2902 df-reu 2903 df-rab 2905 df-v 3175 df-sbc 3403 df-csb 3500 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-nul 3875 df-if 4037 df-pw 4110 df-sn 4126 df-pr 4128 df-op 4132 df-uni 4373 df-iun 4457 df-br 4584 df-opab 4644 df-mpt 4645 df-id 4953 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-iota 5768 df-fun 5806 df-fn 5807 df-f 5808 df-f1 5809 df-fo 5810 df-f1o 5811 df-fv 5812 df-riota 6511 df-ov 6552 df-oprab 6553 df-preset 16751 df-poset 16769 df-lub 16797 df-glb 16798 df-join 16799 df-meet 16800 df-lat 16869 df-ats 33572 df-atl 33603 df-cvlat 33627 df-hlat 33656 |
This theorem is referenced by: dalem21 33998 dalem23 34000 dalem24 34001 dalem25 34002 |
Copyright terms: Public domain | W3C validator |