Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > caovcanrd | Structured version Visualization version GIF version |
Description: Commute the arguments of an operation cancellation law. (Contributed by Mario Carneiro, 30-Dec-2014.) |
Ref | Expression |
---|---|
caovcang.1 | ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑇 ∧ 𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → ((𝑥𝐹𝑦) = (𝑥𝐹𝑧) ↔ 𝑦 = 𝑧)) |
caovcand.2 | ⊢ (𝜑 → 𝐴 ∈ 𝑇) |
caovcand.3 | ⊢ (𝜑 → 𝐵 ∈ 𝑆) |
caovcand.4 | ⊢ (𝜑 → 𝐶 ∈ 𝑆) |
caovcanrd.5 | ⊢ (𝜑 → 𝐴 ∈ 𝑆) |
caovcanrd.6 | ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥𝐹𝑦) = (𝑦𝐹𝑥)) |
Ref | Expression |
---|---|
caovcanrd | ⊢ (𝜑 → ((𝐵𝐹𝐴) = (𝐶𝐹𝐴) ↔ 𝐵 = 𝐶)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | caovcanrd.6 | . . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥𝐹𝑦) = (𝑦𝐹𝑥)) | |
2 | caovcanrd.5 | . . . 4 ⊢ (𝜑 → 𝐴 ∈ 𝑆) | |
3 | caovcand.3 | . . . 4 ⊢ (𝜑 → 𝐵 ∈ 𝑆) | |
4 | 1, 2, 3 | caovcomd 6830 | . . 3 ⊢ (𝜑 → (𝐴𝐹𝐵) = (𝐵𝐹𝐴)) |
5 | caovcand.4 | . . . 4 ⊢ (𝜑 → 𝐶 ∈ 𝑆) | |
6 | 1, 2, 5 | caovcomd 6830 | . . 3 ⊢ (𝜑 → (𝐴𝐹𝐶) = (𝐶𝐹𝐴)) |
7 | 4, 6 | eqeq12d 2637 | . 2 ⊢ (𝜑 → ((𝐴𝐹𝐵) = (𝐴𝐹𝐶) ↔ (𝐵𝐹𝐴) = (𝐶𝐹𝐴))) |
8 | caovcang.1 | . . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑇 ∧ 𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → ((𝑥𝐹𝑦) = (𝑥𝐹𝑧) ↔ 𝑦 = 𝑧)) | |
9 | caovcand.2 | . . 3 ⊢ (𝜑 → 𝐴 ∈ 𝑇) | |
10 | 8, 9, 3, 5 | caovcand 6836 | . 2 ⊢ (𝜑 → ((𝐴𝐹𝐵) = (𝐴𝐹𝐶) ↔ 𝐵 = 𝐶)) |
11 | 7, 10 | bitr3d 270 | 1 ⊢ (𝜑 → ((𝐵𝐹𝐴) = (𝐶𝐹𝐴) ↔ 𝐵 = 𝐶)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 196 ∧ wa 384 ∧ w3a 1037 = wceq 1483 ∈ wcel 1990 (class class class)co 6650 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ral 2917 df-rex 2918 df-rab 2921 df-v 3202 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-nul 3916 df-if 4087 df-sn 4178 df-pr 4180 df-op 4184 df-uni 4437 df-br 4654 df-iota 5851 df-fv 5896 df-ov 6653 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |