| 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 7381 | . . 3 ⊢ (𝜑 → (𝐵 − 𝐷) = (𝐶 − 𝐸)) |
| 4 | 3 | breq2d 5091 | . 2 ⊢ (𝜑 → (𝐴 ∥ (𝐵 − 𝐷) ↔ 𝐴 ∥ (𝐶 − 𝐸))) |
| 5 | 2 | negeqd 11385 | . . . 4 ⊢ (𝜑 → -𝐷 = -𝐸) |
| 6 | 1, 5 | oveq12d 7381 | . . 3 ⊢ (𝜑 → (𝐵 − -𝐷) = (𝐶 − -𝐸)) |
| 7 | 6 | breq2d 5091 | . 2 ⊢ (𝜑 → (𝐴 ∥ (𝐵 − -𝐷) ↔ 𝐴 ∥ (𝐶 − -𝐸))) |
| 8 | 4, 7 | orbi12d 924 | 1 ⊢ (𝜑 → ((𝐴 ∥ (𝐵 − 𝐷) ∨ 𝐴 ∥ (𝐵 − -𝐷)) ↔ (𝐴 ∥ (𝐶 − 𝐸) ∨ 𝐴 ∥ (𝐶 − -𝐸)))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 207 ∨ wo 853 = wceq 1547 class class class wbr 5079 (class class class)co 7363 − cmin 11375 -cneg 11376 ∥ cdvds 16219 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-ext 2712 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-sb 2074 df-clab 2719 df-cleq 2732 df-clel 2815 df-rab 3393 df-v 3434 df-dif 3893 df-un 3895 df-ss 3907 df-nul 4269 df-if 4462 df-sn 4563 df-pr 4565 df-op 4569 df-uni 4846 df-br 5080 df-iota 6448 df-fv 6500 df-ov 7366 df-neg 11378 |
| This theorem is referenced by: acongrep 43432 jm2.26a 43452 jm2.26 43454 |
| Copyright terms: Public domain | W3C validator |