| 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 40538. 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 489 | . 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 40450 | . . . 4 ⊢ (𝜑 → ((𝑄 ∨ 𝑅) ∨ 𝑃) = ((𝑃 ∨ 𝑄) ∨ 𝑅)) |
| 7 | 2, 6 | eqtr4id 2817 | . . 3 ⊢ (𝜑 → 𝑌 = ((𝑄 ∨ 𝑅) ∨ 𝑃)) |
| 8 | 7 | adantr 485 | . 2 ⊢ ((𝜑 ∧ 𝑌 = 𝑍) → 𝑌 = ((𝑄 ∨ 𝑅) ∨ 𝑃)) |
| 9 | dalemrot.z | . . . 4 ⊢ 𝑍 = ((𝑆 ∨ 𝑇) ∨ 𝑈) | |
| 10 | 3 | dalemkehl 40425 | . . . . 5 ⊢ (𝜑 → 𝐾 ∈ HL) |
| 11 | 3 | dalemtea 40432 | . . . . 5 ⊢ (𝜑 → 𝑇 ∈ 𝐴) |
| 12 | 3 | dalemuea 40433 | . . . . 5 ⊢ (𝜑 → 𝑈 ∈ 𝐴) |
| 13 | 3 | dalemsea 40431 | . . . . 5 ⊢ (𝜑 → 𝑆 ∈ 𝐴) |
| 14 | 4, 5 | hlatjrot 40175 | . . . . 5 ⊢ ((𝐾 ∈ HL ∧ (𝑇 ∈ 𝐴 ∧ 𝑈 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → ((𝑇 ∨ 𝑈) ∨ 𝑆) = ((𝑆 ∨ 𝑇) ∨ 𝑈)) |
| 15 | 10, 11, 12, 13, 14 | syl13anc 1399 | . . . 4 ⊢ (𝜑 → ((𝑇 ∨ 𝑈) ∨ 𝑆) = ((𝑆 ∨ 𝑇) ∨ 𝑈)) |
| 16 | 9, 15 | eqtr4id 2817 | . . 3 ⊢ (𝜑 → 𝑍 = ((𝑇 ∨ 𝑈) ∨ 𝑆)) |
| 17 | 16 | adantr 485 | . 2 ⊢ ((𝜑 ∧ 𝑌 = 𝑍) → 𝑍 = ((𝑇 ∨ 𝑈) ∨ 𝑆)) |
| 18 | 1, 8, 17 | 3eqtr3d 2806 | 1 ⊢ ((𝜑 ∧ 𝑌 = 𝑍) → ((𝑄 ∨ 𝑅) ∨ 𝑃) = ((𝑇 ∨ 𝑈) ∨ 𝑆)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 400 ∧ w3a 1103 = wceq 1570 ∈ wcel 2143 class class class wbr 5109 ‘cfv 6536 (class class class)co 7410 Basecbs 17273 lecple 17321 joincjn 18371 Atomscatm 40065 HLchlt 40152 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-rep 5238 ax-sep 5257 ax-nul 5269 ax-pow 5336 ax-pr 5404 ax-un 7732 |
| This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-ral 3080 df-rex 3090 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3745 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-nul 4287 df-if 4488 df-pw 4564 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4873 df-iun 4958 df-br 5110 df-opab 5174 df-mpt 5193 df-id 5556 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7367 df-ov 7413 df-oprab 7414 df-proset 18354 df-poset 18373 df-lub 18404 df-glb 18405 df-join 18406 df-meet 18407 df-lat 18492 df-ats 40069 df-atl 40100 df-cvlat 40124 df-hlat 40153 |
| This theorem is used by: dalem29 40503 dalem30 40504 dalem31N 40505 dalem32 40506 dalem33 40507 dalem34 40508 dalem35 40509 dalem36 40510 dalem37 40511 dalem40 40514 dalem46 40520 dalem47 40521 dalem58 40532 dalem59 40533 |
| Copyright terms: Public domain | W3C validator |