![]() |
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 35757. 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 478 | . 2 ⊢ ((𝜑 ∧ 𝑌 = 𝑍) → 𝑌 = 𝑍) | |
2 | dalema.ph | . . . . 5 ⊢ (𝜑 ↔ (((𝐾 ∈ HL ∧ 𝐶 ∈ (Base‘𝐾)) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑆 ∈ 𝐴 ∧ 𝑇 ∈ 𝐴 ∧ 𝑈 ∈ 𝐴)) ∧ (𝑌 ∈ 𝑂 ∧ 𝑍 ∈ 𝑂) ∧ ((¬ 𝐶 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝐶 ≤ (𝑄 ∨ 𝑅) ∧ ¬ 𝐶 ≤ (𝑅 ∨ 𝑃)) ∧ (¬ 𝐶 ≤ (𝑆 ∨ 𝑇) ∧ ¬ 𝐶 ≤ (𝑇 ∨ 𝑈) ∧ ¬ 𝐶 ≤ (𝑈 ∨ 𝑆)) ∧ (𝐶 ≤ (𝑃 ∨ 𝑆) ∧ 𝐶 ≤ (𝑄 ∨ 𝑇) ∧ 𝐶 ≤ (𝑅 ∨ 𝑈))))) | |
3 | dalemc.j | . . . . 5 ⊢ ∨ = (join‘𝐾) | |
4 | dalemc.a | . . . . 5 ⊢ 𝐴 = (Atoms‘𝐾) | |
5 | 2, 3, 4 | dalemqrprot 35669 | . . . 4 ⊢ (𝜑 → ((𝑄 ∨ 𝑅) ∨ 𝑃) = ((𝑃 ∨ 𝑄) ∨ 𝑅)) |
6 | dalemrot.y | . . . 4 ⊢ 𝑌 = ((𝑃 ∨ 𝑄) ∨ 𝑅) | |
7 | 5, 6 | syl6reqr 2852 | . . 3 ⊢ (𝜑 → 𝑌 = ((𝑄 ∨ 𝑅) ∨ 𝑃)) |
8 | 7 | adantr 473 | . 2 ⊢ ((𝜑 ∧ 𝑌 = 𝑍) → 𝑌 = ((𝑄 ∨ 𝑅) ∨ 𝑃)) |
9 | 2 | dalemkehl 35644 | . . . . 5 ⊢ (𝜑 → 𝐾 ∈ HL) |
10 | 2 | dalemtea 35651 | . . . . 5 ⊢ (𝜑 → 𝑇 ∈ 𝐴) |
11 | 2 | dalemuea 35652 | . . . . 5 ⊢ (𝜑 → 𝑈 ∈ 𝐴) |
12 | 2 | dalemsea 35650 | . . . . 5 ⊢ (𝜑 → 𝑆 ∈ 𝐴) |
13 | 3, 4 | hlatjrot 35394 | . . . . 5 ⊢ ((𝐾 ∈ HL ∧ (𝑇 ∈ 𝐴 ∧ 𝑈 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → ((𝑇 ∨ 𝑈) ∨ 𝑆) = ((𝑆 ∨ 𝑇) ∨ 𝑈)) |
14 | 9, 10, 11, 12, 13 | syl13anc 1492 | . . . 4 ⊢ (𝜑 → ((𝑇 ∨ 𝑈) ∨ 𝑆) = ((𝑆 ∨ 𝑇) ∨ 𝑈)) |
15 | dalemrot.z | . . . 4 ⊢ 𝑍 = ((𝑆 ∨ 𝑇) ∨ 𝑈) | |
16 | 14, 15 | syl6reqr 2852 | . . 3 ⊢ (𝜑 → 𝑍 = ((𝑇 ∨ 𝑈) ∨ 𝑆)) |
17 | 16 | adantr 473 | . 2 ⊢ ((𝜑 ∧ 𝑌 = 𝑍) → 𝑍 = ((𝑇 ∨ 𝑈) ∨ 𝑆)) |
18 | 1, 8, 17 | 3eqtr3d 2841 | 1 ⊢ ((𝜑 ∧ 𝑌 = 𝑍) → ((𝑄 ∨ 𝑅) ∨ 𝑃) = ((𝑇 ∨ 𝑈) ∨ 𝑆)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 198 ∧ wa 385 ∧ w3a 1108 = wceq 1653 ∈ wcel 2157 class class class wbr 4843 ‘cfv 6101 (class class class)co 6878 Basecbs 16184 lecple 16274 joincjn 17259 Atomscatm 35284 HLchlt 35371 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1891 ax-4 1905 ax-5 2006 ax-6 2072 ax-7 2107 ax-8 2159 ax-9 2166 ax-10 2185 ax-11 2200 ax-12 2213 ax-13 2377 ax-ext 2777 ax-rep 4964 ax-sep 4975 ax-nul 4983 ax-pow 5035 ax-pr 5097 ax-un 7183 |
This theorem depends on definitions: df-bi 199 df-an 386 df-or 875 df-3an 1110 df-tru 1657 df-ex 1876 df-nf 1880 df-sb 2065 df-mo 2591 df-eu 2609 df-clab 2786 df-cleq 2792 df-clel 2795 df-nfc 2930 df-ne 2972 df-ral 3094 df-rex 3095 df-reu 3096 df-rab 3098 df-v 3387 df-sbc 3634 df-csb 3729 df-dif 3772 df-un 3774 df-in 3776 df-ss 3783 df-nul 4116 df-if 4278 df-pw 4351 df-sn 4369 df-pr 4371 df-op 4375 df-uni 4629 df-iun 4712 df-br 4844 df-opab 4906 df-mpt 4923 df-id 5220 df-xp 5318 df-rel 5319 df-cnv 5320 df-co 5321 df-dm 5322 df-rn 5323 df-res 5324 df-ima 5325 df-iota 6064 df-fun 6103 df-fn 6104 df-f 6105 df-f1 6106 df-fo 6107 df-f1o 6108 df-fv 6109 df-riota 6839 df-ov 6881 df-oprab 6882 df-proset 17243 df-poset 17261 df-lub 17289 df-glb 17290 df-join 17291 df-meet 17292 df-lat 17361 df-ats 35288 df-atl 35319 df-cvlat 35343 df-hlat 35372 |
This theorem is referenced by: dalem29 35722 dalem30 35723 dalem31N 35724 dalem32 35725 dalem33 35726 dalem34 35727 dalem35 35728 dalem36 35729 dalem37 35730 dalem40 35733 dalem46 35739 dalem47 35740 dalem58 35751 dalem59 35752 |
Copyright terms: Public domain | W3C validator |