| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > dalemrotyz | Structured version Visualization version GIF version | ||
| Description: Lemma for dath 40707. Rotate triangles 𝑌 = 𝑃𝑄𝑅 and 𝑍 = 𝑆𝑇𝑈 to allow reuse of analogous proofs. (Contributed by NM, 19-Aug-2012.) |
| Ref | Expression |
|---|---|
| dalema.ph | ⊢ (𝜑 ↔ (((𝐾 ∈ HL ∧ 𝐶 ∈ (Base‘𝐾)) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑆 ∈ 𝐴 ∧ 𝑇 ∈ 𝐴 ∧ 𝑈 ∈ 𝐴)) ∧ (𝑌 ∈ 𝑂 ∧ 𝑍 ∈ 𝑂) ∧ ((¬ 𝐶 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝐶 ≤ (𝑄 ∨ 𝑅) ∧ ¬ 𝐶 ≤ (𝑅 ∨ 𝑃)) ∧ (¬ 𝐶 ≤ (𝑆 ∨ 𝑇) ∧ ¬ 𝐶 ≤ (𝑇 ∨ 𝑈) ∧ ¬ 𝐶 ≤ (𝑈 ∨ 𝑆)) ∧ (𝐶 ≤ (𝑃 ∨ 𝑆) ∧ 𝐶 ≤ (𝑄 ∨ 𝑇) ∧ 𝐶 ≤ (𝑅 ∨ 𝑈))))) |
| dalemc.l | ⊢ ≤ = (le‘𝐾) |
| dalemc.j | ⊢ ∨ = (join‘𝐾) |
| dalemc.a | ⊢ 𝐴 = (Atoms‘𝐾) |
| dalemrot.y | ⊢ 𝑌 = ((𝑃 ∨ 𝑄) ∨ 𝑅) |
| dalemrot.z | ⊢ 𝑍 = ((𝑆 ∨ 𝑇) ∨ 𝑈) |
| Ref | Expression |
|---|---|
| dalemrotyz | ⊢ ((𝜑 ∧ 𝑌 = 𝑍) → ((𝑄 ∨ 𝑅) ∨ 𝑃) = ((𝑇 ∨ 𝑈) ∨ 𝑆)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpr 490 | . 2 ⊢ ((𝜑 ∧ 𝑌 = 𝑍) → 𝑌 = 𝑍) | |
| 2 | dalemrot.y | . . . 4 ⊢ 𝑌 = ((𝑃 ∨ 𝑄) ∨ 𝑅) | |
| 3 | dalema.ph | . . . . 5 ⊢ (𝜑 ↔ (((𝐾 ∈ HL ∧ 𝐶 ∈ (Base‘𝐾)) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑆 ∈ 𝐴 ∧ 𝑇 ∈ 𝐴 ∧ 𝑈 ∈ 𝐴)) ∧ (𝑌 ∈ 𝑂 ∧ 𝑍 ∈ 𝑂) ∧ ((¬ 𝐶 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝐶 ≤ (𝑄 ∨ 𝑅) ∧ ¬ 𝐶 ≤ (𝑅 ∨ 𝑃)) ∧ (¬ 𝐶 ≤ (𝑆 ∨ 𝑇) ∧ ¬ 𝐶 ≤ (𝑇 ∨ 𝑈) ∧ ¬ 𝐶 ≤ (𝑈 ∨ 𝑆)) ∧ (𝐶 ≤ (𝑃 ∨ 𝑆) ∧ 𝐶 ≤ (𝑄 ∨ 𝑇) ∧ 𝐶 ≤ (𝑅 ∨ 𝑈))))) | |
| 4 | dalemc.j | . . . . 5 ⊢ ∨ = (join‘𝐾) | |
| 5 | dalemc.a | . . . . 5 ⊢ 𝐴 = (Atoms‘𝐾) | |
| 6 | 3, 4, 5 | dalemqrprot 40619 | . . . 4 ⊢ (𝜑 → ((𝑄 ∨ 𝑅) ∨ 𝑃) = ((𝑃 ∨ 𝑄) ∨ 𝑅)) |
| 7 | 2, 6 | eqtr4id 2814 | . . 3 ⊢ (𝜑 → 𝑌 = ((𝑄 ∨ 𝑅) ∨ 𝑃)) |
| 8 | 7 | adantr 486 | . 2 ⊢ ((𝜑 ∧ 𝑌 = 𝑍) → 𝑌 = ((𝑄 ∨ 𝑅) ∨ 𝑃)) |
| 9 | dalemrot.z | . . . 4 ⊢ 𝑍 = ((𝑆 ∨ 𝑇) ∨ 𝑈) | |
| 10 | 3 | dalemkehl 40594 | . . . . 5 ⊢ (𝜑 → 𝐾 ∈ HL) |
| 11 | 3 | dalemtea 40601 | . . . . 5 ⊢ (𝜑 → 𝑇 ∈ 𝐴) |
| 12 | 3 | dalemuea 40602 | . . . . 5 ⊢ (𝜑 → 𝑈 ∈ 𝐴) |
| 13 | 3 | dalemsea 40600 | . . . . 5 ⊢ (𝜑 → 𝑆 ∈ 𝐴) |
| 14 | 4, 5 | hlatjrot 40344 | . . . . 5 ⊢ ((𝐾 ∈ HL ∧ (𝑇 ∈ 𝐴 ∧ 𝑈 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → ((𝑇 ∨ 𝑈) ∨ 𝑆) = ((𝑆 ∨ 𝑇) ∨ 𝑈)) |
| 15 | 10, 11, 12, 13, 14 | syl13anc 1399 | . . . 4 ⊢ (𝜑 → ((𝑇 ∨ 𝑈) ∨ 𝑆) = ((𝑆 ∨ 𝑇) ∨ 𝑈)) |
| 16 | 9, 15 | eqtr4id 2814 | . . 3 ⊢ (𝜑 → 𝑍 = ((𝑇 ∨ 𝑈) ∨ 𝑆)) |
| 17 | 16 | adantr 486 | . 2 ⊢ ((𝜑 ∧ 𝑌 = 𝑍) → 𝑍 = ((𝑇 ∨ 𝑈) ∨ 𝑆)) |
| 18 | 1, 8, 17 | 3eqtr3d 2803 | 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 2145 class class class wbr 5103 ‘cfv 6528 (class class class)co 7409 Basecbs 17334 lecple 17382 joincjn 18432 Atomscatm 40234 HLchlt 40321 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-rep 5232 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7735 |
| 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 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5543 df-xp 5654 df-rel 5655 df-cnv 5656 df-co 5657 df-dm 5658 df-rn 5659 df-res 5660 df-ima 5661 df-iota 6484 df-fun 6530 df-fn 6531 df-f 6532 df-f1 6533 df-fo 6534 df-f1o 6535 df-fv 6536 df-riota 7366 df-ov 7412 df-oprab 7413 df-proset 18415 df-poset 18434 df-lub 18465 df-glb 18466 df-join 18467 df-meet 18468 df-lat 18553 df-ats 40238 df-atl 40269 df-cvlat 40293 df-hlat 40322 |
| This theorem is used by: dalem29 40672 dalem30 40673 dalem31N 40674 dalem32 40675 dalem33 40676 dalem34 40677 dalem35 40678 dalem36 40679 dalem37 40680 dalem40 40683 dalem46 40689 dalem47 40690 dalem58 40701 dalem59 40702 |
| Copyright terms: Public domain | W3C validator |