| 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 40984. 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 40896 | . . . 4 ⊢ (𝜑 → ((𝑄 ∨ 𝑅) ∨ 𝑃) = ((𝑃 ∨ 𝑄) ∨ 𝑅)) |
| 7 | 2, 6 | eqtr4id 2817 | . . 3 ⊢ (𝜑 → 𝑌 = ((𝑄 ∨ 𝑅) ∨ 𝑃)) |
| 8 | 7 | adantr 486 | . 2 ⊢ ((𝜑 ∧ 𝑌 = 𝑍) → 𝑌 = ((𝑄 ∨ 𝑅) ∨ 𝑃)) |
| 9 | dalemrot.z | . . . 4 ⊢ 𝑍 = ((𝑆 ∨ 𝑇) ∨ 𝑈) | |
| 10 | 3 | dalemkehl 40871 | . . . . 5 ⊢ (𝜑 → 𝐾 ∈ HL) |
| 11 | 3 | dalemtea 40878 | . . . . 5 ⊢ (𝜑 → 𝑇 ∈ 𝐴) |
| 12 | 3 | dalemuea 40879 | . . . . 5 ⊢ (𝜑 → 𝑈 ∈ 𝐴) |
| 13 | 3 | dalemsea 40877 | . . . . 5 ⊢ (𝜑 → 𝑆 ∈ 𝐴) |
| 14 | 4, 5 | hlatjrot 40621 | . . . . 5 ⊢ ((𝐾 ∈ HL ∧ (𝑇 ∈ 𝐴 ∧ 𝑈 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → ((𝑇 ∨ 𝑈) ∨ 𝑆) = ((𝑆 ∨ 𝑇) ∨ 𝑈)) |
| 15 | 10, 11, 12, 13, 14 | syl13anc 1400 | . . . 4 ⊢ (𝜑 → ((𝑇 ∨ 𝑈) ∨ 𝑆) = ((𝑆 ∨ 𝑇) ∨ 𝑈)) |
| 16 | 9, 15 | eqtr4id 2817 | . . 3 ⊢ (𝜑 → 𝑍 = ((𝑇 ∨ 𝑈) ∨ 𝑆)) |
| 17 | 16 | adantr 486 | . 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 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2147 class class class wbr 5106 ‘cfv 6555 (class class class)co 7440 Basecbs 17413 lecple 17461 joincjn 18511 Atomscatm 40511 HLchlt 40598 |
| 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 5235 ax-sep 5252 ax-nul 5263 ax-pow 5331 ax-pr 5395 ax-un 7772 |
| 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 4839 df-uni 4871 df-iun 4956 df-br 5107 df-opab 5171 df-mpt 5190 df-id 5550 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-iota 6509 df-fun 6557 df-fn 6558 df-f 6559 df-f1 6560 df-fo 6561 df-f1o 6562 df-fv 6563 df-riota 7397 df-ov 7443 df-oprab 7444 df-proset 18494 df-poset 18513 df-lub 18544 df-glb 18545 df-join 18546 df-meet 18547 df-lat 18632 df-ats 40515 df-atl 40546 df-cvlat 40570 df-hlat 40599 |
| This theorem is used by: dalem29 40949 dalem30 40950 dalem31N 40951 dalem32 40952 dalem33 40953 dalem34 40954 dalem35 40955 dalem36 40956 dalem37 40957 dalem40 40960 dalem46 40966 dalem47 40967 dalem58 40978 dalem59 40979 |
| Copyright terms: Public domain | W3C validator |