| Mathbox for Stefan O'Rear |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > acongeq12d | Structured version Visualization version GIF version | ||
| Description: Substitution deduction for alternating congruence. (Contributed by Stefan O'Rear, 3-Oct-2014.) |
| Ref | Expression |
|---|---|
| acongeq12d.1 | ⊢ (𝜑 → 𝐵 = 𝐶) |
| acongeq12d.2 | ⊢ (𝜑 → 𝐷 = 𝐸) |
| Ref | Expression |
|---|---|
| acongeq12d | ⊢ (𝜑 → ((𝐴 ∥ (𝐵 − 𝐷) ∨ 𝐴 ∥ (𝐵 − -𝐷)) ↔ (𝐴 ∥ (𝐶 − 𝐸) ∨ 𝐴 ∥ (𝐶 − -𝐸)))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | acongeq12d.1 | . . . 4 ⊢ (𝜑 → 𝐵 = 𝐶) | |
| 2 | acongeq12d.2 | . . . 4 ⊢ (𝜑 → 𝐷 = 𝐸) | |
| 3 | 1, 2 | oveq12d 7469 | . . 3 ⊢ (𝜑 → (𝐵 − 𝐷) = (𝐶 − 𝐸)) |
| 4 | 3 | breq2d 5120 | . 2 ⊢ (𝜑 → (𝐴 ∥ (𝐵 − 𝐷) ↔ 𝐴 ∥ (𝐶 − 𝐸))) |
| 5 | 2 | negeqd 11590 | . . . 4 ⊢ (𝜑 → -𝐷 = -𝐸) |
| 6 | 1, 5 | oveq12d 7469 | . . 3 ⊢ (𝜑 → (𝐵 − -𝐷) = (𝐶 − -𝐸)) |
| 7 | 6 | breq2d 5120 | . 2 ⊢ (𝜑 → (𝐴 ∥ (𝐵 − -𝐷) ↔ 𝐴 ∥ (𝐶 − -𝐸))) |
| 8 | 4, 7 | orbi12d 932 | 1 ⊢ (𝜑 → ((𝐴 ∥ (𝐵 − 𝐷) ∨ 𝐴 ∥ (𝐵 − -𝐷)) ↔ (𝐴 ∥ (𝐶 − 𝐸) ∨ 𝐴 ∥ (𝐶 − -𝐸)))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∨ wo 861 = wceq 1570 class class class wbr 5108 (class class class)co 7451 − cmin 11580 -cneg 11581 ∥ cdvds 16466 |
| 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-ext 2735 |
| 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-sb 2102 df-clab 2742 df-cleq 2755 df-clel 2839 df-rab 3417 df-v 3456 df-ss 3901 df-dif 4050 df-un 4154 df-nul 4282 df-if 4486 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-br 5109 df-iota 6520 df-fv 6574 df-ov 7454 df-neg 11583 |
| This theorem is used by: acongrep 44253 jm2.26a 44273 jm2.26 44275 |
| Copyright terms: Public domain | W3C validator |