| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > dalemrotps | Structured version Visualization version GIF version | ||
| Description: Lemma for dath 41059. Rotate triangles 𝑌 = 𝑃𝑄𝑅 and 𝑍 = 𝑆𝑇𝑈 to allow reuse of analogous proofs. (Contributed by NM, 15-Aug-2012.) |
| Ref | Expression |
|---|---|
| dalem.ph | ⊢ (𝜑 ↔ (((𝐾 ∈ HL ∧ 𝐶 ∈ (Base‘𝐾)) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑆 ∈ 𝐴 ∧ 𝑇 ∈ 𝐴 ∧ 𝑈 ∈ 𝐴)) ∧ (𝑌 ∈ 𝑂 ∧ 𝑍 ∈ 𝑂) ∧ ((¬ 𝐶 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝐶 ≤ (𝑄 ∨ 𝑅) ∧ ¬ 𝐶 ≤ (𝑅 ∨ 𝑃)) ∧ (¬ 𝐶 ≤ (𝑆 ∨ 𝑇) ∧ ¬ 𝐶 ≤ (𝑇 ∨ 𝑈) ∧ ¬ 𝐶 ≤ (𝑈 ∨ 𝑆)) ∧ (𝐶 ≤ (𝑃 ∨ 𝑆) ∧ 𝐶 ≤ (𝑄 ∨ 𝑇) ∧ 𝐶 ≤ (𝑅 ∨ 𝑈))))) |
| dalem.l | ⊢ ≤ = (le‘𝐾) |
| dalem.j | ⊢ ∨ = (join‘𝐾) |
| dalem.a | ⊢ 𝐴 = (Atoms‘𝐾) |
| dalem.ps | ⊢ (𝜓 ↔ ((𝑐 ∈ 𝐴 ∧ 𝑑 ∈ 𝐴) ∧ ¬ 𝑐 ≤ 𝑌 ∧ (𝑑 ≠ 𝑐 ∧ ¬ 𝑑 ≤ 𝑌 ∧ 𝐶 ≤ (𝑐 ∨ 𝑑)))) |
| dalemrotps.y | ⊢ 𝑌 = ((𝑃 ∨ 𝑄) ∨ 𝑅) |
| Ref | Expression |
|---|---|
| dalemrotps | ⊢ ((𝜑 ∧ 𝜓) → ((𝑐 ∈ 𝐴 ∧ 𝑑 ∈ 𝐴) ∧ ¬ 𝑐 ≤ ((𝑄 ∨ 𝑅) ∨ 𝑃) ∧ (𝑑 ≠ 𝑐 ∧ ¬ 𝑑 ≤ ((𝑄 ∨ 𝑅) ∨ 𝑃) ∧ 𝐶 ≤ (𝑐 ∨ 𝑑)))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dalem.ps | . . . . 5 ⊢ (𝜓 ↔ ((𝑐 ∈ 𝐴 ∧ 𝑑 ∈ 𝐴) ∧ ¬ 𝑐 ≤ 𝑌 ∧ (𝑑 ≠ 𝑐 ∧ ¬ 𝑑 ≤ 𝑌 ∧ 𝐶 ≤ (𝑐 ∨ 𝑑)))) | |
| 2 | 1 | dalemccea 41006 | . . . 4 ⊢ (𝜓 → 𝑐 ∈ 𝐴) |
| 3 | 1 | dalemddea 41007 | . . . 4 ⊢ (𝜓 → 𝑑 ∈ 𝐴) |
| 4 | 2, 3 | jca 521 | . . 3 ⊢ (𝜓 → (𝑐 ∈ 𝐴 ∧ 𝑑 ∈ 𝐴)) |
| 5 | 4 | adantl 487 | . 2 ⊢ ((𝜑 ∧ 𝜓) → (𝑐 ∈ 𝐴 ∧ 𝑑 ∈ 𝐴)) |
| 6 | 1 | dalem-ccly 41008 | . . . 4 ⊢ (𝜓 → ¬ 𝑐 ≤ 𝑌) |
| 7 | 6 | adantl 487 | . . 3 ⊢ ((𝜑 ∧ 𝜓) → ¬ 𝑐 ≤ 𝑌) |
| 8 | dalemrotps.y | . . . . . 6 ⊢ 𝑌 = ((𝑃 ∨ 𝑄) ∨ 𝑅) | |
| 9 | dalem.ph | . . . . . . 7 ⊢ (𝜑 ↔ (((𝐾 ∈ HL ∧ 𝐶 ∈ (Base‘𝐾)) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑆 ∈ 𝐴 ∧ 𝑇 ∈ 𝐴 ∧ 𝑈 ∈ 𝐴)) ∧ (𝑌 ∈ 𝑂 ∧ 𝑍 ∈ 𝑂) ∧ ((¬ 𝐶 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝐶 ≤ (𝑄 ∨ 𝑅) ∧ ¬ 𝐶 ≤ (𝑅 ∨ 𝑃)) ∧ (¬ 𝐶 ≤ (𝑆 ∨ 𝑇) ∧ ¬ 𝐶 ≤ (𝑇 ∨ 𝑈) ∧ ¬ 𝐶 ≤ (𝑈 ∨ 𝑆)) ∧ (𝐶 ≤ (𝑃 ∨ 𝑆) ∧ 𝐶 ≤ (𝑄 ∨ 𝑇) ∧ 𝐶 ≤ (𝑅 ∨ 𝑈))))) | |
| 10 | dalem.j | . . . . . . 7 ⊢ ∨ = (join‘𝐾) | |
| 11 | dalem.a | . . . . . . 7 ⊢ 𝐴 = (Atoms‘𝐾) | |
| 12 | 9, 10, 11 | dalemqrprot 40971 | . . . . . 6 ⊢ (𝜑 → ((𝑄 ∨ 𝑅) ∨ 𝑃) = ((𝑃 ∨ 𝑄) ∨ 𝑅)) |
| 13 | 8, 12 | eqtr4id 2817 | . . . . 5 ⊢ (𝜑 → 𝑌 = ((𝑄 ∨ 𝑅) ∨ 𝑃)) |
| 14 | 13 | breq2d 5120 | . . . 4 ⊢ (𝜑 → (𝑐 ≤ 𝑌 ↔ 𝑐 ≤ ((𝑄 ∨ 𝑅) ∨ 𝑃))) |
| 15 | 14 | adantr 486 | . . 3 ⊢ ((𝜑 ∧ 𝜓) → (𝑐 ≤ 𝑌 ↔ 𝑐 ≤ ((𝑄 ∨ 𝑅) ∨ 𝑃))) |
| 16 | 7, 15 | mtbid 327 | . 2 ⊢ ((𝜑 ∧ 𝜓) → ¬ 𝑐 ≤ ((𝑄 ∨ 𝑅) ∨ 𝑃)) |
| 17 | 1 | dalemccnedd 41010 | . . . . 5 ⊢ (𝜓 → 𝑐 ≠ 𝑑) |
| 18 | 17 | necomd 3014 | . . . 4 ⊢ (𝜓 → 𝑑 ≠ 𝑐) |
| 19 | 18 | adantl 487 | . . 3 ⊢ ((𝜑 ∧ 𝜓) → 𝑑 ≠ 𝑐) |
| 20 | 1 | dalem-ddly 41009 | . . . . 5 ⊢ (𝜓 → ¬ 𝑑 ≤ 𝑌) |
| 21 | 20 | adantl 487 | . . . 4 ⊢ ((𝜑 ∧ 𝜓) → ¬ 𝑑 ≤ 𝑌) |
| 22 | 13 | breq2d 5120 | . . . . 5 ⊢ (𝜑 → (𝑑 ≤ 𝑌 ↔ 𝑑 ≤ ((𝑄 ∨ 𝑅) ∨ 𝑃))) |
| 23 | 22 | adantr 486 | . . . 4 ⊢ ((𝜑 ∧ 𝜓) → (𝑑 ≤ 𝑌 ↔ 𝑑 ≤ ((𝑄 ∨ 𝑅) ∨ 𝑃))) |
| 24 | 21, 23 | mtbid 327 | . . 3 ⊢ ((𝜑 ∧ 𝜓) → ¬ 𝑑 ≤ ((𝑄 ∨ 𝑅) ∨ 𝑃)) |
| 25 | 1 | dalemclccjdd 41011 | . . . 4 ⊢ (𝜓 → 𝐶 ≤ (𝑐 ∨ 𝑑)) |
| 26 | 25 | adantl 487 | . . 3 ⊢ ((𝜑 ∧ 𝜓) → 𝐶 ≤ (𝑐 ∨ 𝑑)) |
| 27 | 19, 24, 26 | 3jca 1146 | . 2 ⊢ ((𝜑 ∧ 𝜓) → (𝑑 ≠ 𝑐 ∧ ¬ 𝑑 ≤ ((𝑄 ∨ 𝑅) ∨ 𝑃) ∧ 𝐶 ≤ (𝑐 ∨ 𝑑))) |
| 28 | 5, 16, 27 | 3jca 1146 | 1 ⊢ ((𝜑 ∧ 𝜓) → ((𝑐 ∈ 𝐴 ∧ 𝑑 ∈ 𝐴) ∧ ¬ 𝑐 ≤ ((𝑄 ∨ 𝑅) ∨ 𝑃) ∧ (𝑑 ≠ 𝑐 ∧ ¬ 𝑑 ≤ ((𝑄 ∨ 𝑅) ∨ 𝑃) ∧ 𝐶 ≤ (𝑐 ∨ 𝑑)))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2147 ≠ wne 2959 class class class wbr 5108 ‘cfv 6566 (class class class)co 7451 Basecbs 17431 lecple 17479 joincjn 18535 Atomscatm 40586 HLchlt 40673 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5238 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-id 5553 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-riota 7408 df-ov 7454 df-oprab 7455 df-proset 18518 df-poset 18537 df-lub 18568 df-glb 18569 df-join 18570 df-meet 18571 df-lat 18656 df-ats 40590 df-atl 40621 df-cvlat 40645 df-hlat 40674 |
| This theorem is used by: dalem29 41024 dalem30 41025 dalem31N 41026 dalem32 41027 dalem33 41028 dalem34 41029 dalem35 41030 dalem36 41031 dalem37 41032 dalem40 41035 dalem46 41041 dalem47 41042 dalem49 41044 dalem50 41045 dalem58 41053 dalem59 41054 |
| Copyright terms: Public domain | W3C validator |