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 36866. 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 487 | . 2 ⊢ ((𝜑 ∧ 𝑌 = 𝑍) → 𝑌 = 𝑍) | |
2 | dalema.ph | . . . . 5 ⊢ (𝜑 ↔ (((𝐾 ∈ HL ∧ 𝐶 ∈ (Base‘𝐾)) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑆 ∈ 𝐴 ∧ 𝑇 ∈ 𝐴 ∧ 𝑈 ∈ 𝐴)) ∧ (𝑌 ∈ 𝑂 ∧ 𝑍 ∈ 𝑂) ∧ ((¬ 𝐶 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝐶 ≤ (𝑄 ∨ 𝑅) ∧ ¬ 𝐶 ≤ (𝑅 ∨ 𝑃)) ∧ (¬ 𝐶 ≤ (𝑆 ∨ 𝑇) ∧ ¬ 𝐶 ≤ (𝑇 ∨ 𝑈) ∧ ¬ 𝐶 ≤ (𝑈 ∨ 𝑆)) ∧ (𝐶 ≤ (𝑃 ∨ 𝑆) ∧ 𝐶 ≤ (𝑄 ∨ 𝑇) ∧ 𝐶 ≤ (𝑅 ∨ 𝑈))))) | |
3 | dalemc.j | . . . . 5 ⊢ ∨ = (join‘𝐾) | |
4 | dalemc.a | . . . . 5 ⊢ 𝐴 = (Atoms‘𝐾) | |
5 | 2, 3, 4 | dalemqrprot 36778 | . . . 4 ⊢ (𝜑 → ((𝑄 ∨ 𝑅) ∨ 𝑃) = ((𝑃 ∨ 𝑄) ∨ 𝑅)) |
6 | dalemrot.y | . . . 4 ⊢ 𝑌 = ((𝑃 ∨ 𝑄) ∨ 𝑅) | |
7 | 5, 6 | syl6reqr 2875 | . . 3 ⊢ (𝜑 → 𝑌 = ((𝑄 ∨ 𝑅) ∨ 𝑃)) |
8 | 7 | adantr 483 | . 2 ⊢ ((𝜑 ∧ 𝑌 = 𝑍) → 𝑌 = ((𝑄 ∨ 𝑅) ∨ 𝑃)) |
9 | 2 | dalemkehl 36753 | . . . . 5 ⊢ (𝜑 → 𝐾 ∈ HL) |
10 | 2 | dalemtea 36760 | . . . . 5 ⊢ (𝜑 → 𝑇 ∈ 𝐴) |
11 | 2 | dalemuea 36761 | . . . . 5 ⊢ (𝜑 → 𝑈 ∈ 𝐴) |
12 | 2 | dalemsea 36759 | . . . . 5 ⊢ (𝜑 → 𝑆 ∈ 𝐴) |
13 | 3, 4 | hlatjrot 36503 | . . . . 5 ⊢ ((𝐾 ∈ HL ∧ (𝑇 ∈ 𝐴 ∧ 𝑈 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → ((𝑇 ∨ 𝑈) ∨ 𝑆) = ((𝑆 ∨ 𝑇) ∨ 𝑈)) |
14 | 9, 10, 11, 12, 13 | syl13anc 1368 | . . . 4 ⊢ (𝜑 → ((𝑇 ∨ 𝑈) ∨ 𝑆) = ((𝑆 ∨ 𝑇) ∨ 𝑈)) |
15 | dalemrot.z | . . . 4 ⊢ 𝑍 = ((𝑆 ∨ 𝑇) ∨ 𝑈) | |
16 | 14, 15 | syl6reqr 2875 | . . 3 ⊢ (𝜑 → 𝑍 = ((𝑇 ∨ 𝑈) ∨ 𝑆)) |
17 | 16 | adantr 483 | . 2 ⊢ ((𝜑 ∧ 𝑌 = 𝑍) → 𝑍 = ((𝑇 ∨ 𝑈) ∨ 𝑆)) |
18 | 1, 8, 17 | 3eqtr3d 2864 | 1 ⊢ ((𝜑 ∧ 𝑌 = 𝑍) → ((𝑄 ∨ 𝑅) ∨ 𝑃) = ((𝑇 ∨ 𝑈) ∨ 𝑆)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 208 ∧ wa 398 ∧ w3a 1083 = wceq 1533 ∈ wcel 2110 class class class wbr 5058 ‘cfv 6349 (class class class)co 7150 Basecbs 16477 lecple 16566 joincjn 17548 Atomscatm 36393 HLchlt 36480 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-rep 5182 ax-sep 5195 ax-nul 5202 ax-pow 5258 ax-pr 5321 ax-un 7455 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-ral 3143 df-rex 3144 df-reu 3145 df-rab 3147 df-v 3496 df-sbc 3772 df-csb 3883 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-nul 4291 df-if 4467 df-pw 4540 df-sn 4561 df-pr 4563 df-op 4567 df-uni 4832 df-iun 4913 df-br 5059 df-opab 5121 df-mpt 5139 df-id 5454 df-xp 5555 df-rel 5556 df-cnv 5557 df-co 5558 df-dm 5559 df-rn 5560 df-res 5561 df-ima 5562 df-iota 6308 df-fun 6351 df-fn 6352 df-f 6353 df-f1 6354 df-fo 6355 df-f1o 6356 df-fv 6357 df-riota 7108 df-ov 7153 df-oprab 7154 df-proset 17532 df-poset 17550 df-lub 17578 df-glb 17579 df-join 17580 df-meet 17581 df-lat 17650 df-ats 36397 df-atl 36428 df-cvlat 36452 df-hlat 36481 |
This theorem is referenced by: dalem29 36831 dalem30 36832 dalem31N 36833 dalem32 36834 dalem33 36835 dalem34 36836 dalem35 36837 dalem36 36838 dalem37 36839 dalem40 36842 dalem46 36848 dalem47 36849 dalem58 36860 dalem59 36861 |
Copyright terms: Public domain | W3C validator |