| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > caovcang | Structured version Visualization version GIF version | ||
| Description: Convert an operation cancellation law to class notation. (Contributed by NM, 20-Aug-1995.) (Revised by Mario Carneiro, 30-Dec-2014.) |
| Ref | Expression |
|---|---|
| caovcang.1 | ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑇 ∧ 𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → ((𝑥𝐹𝑦) = (𝑥𝐹𝑧) ↔ 𝑦 = 𝑧)) |
| Ref | Expression |
|---|---|
| caovcang | ⊢ ((𝜑 ∧ (𝐴 ∈ 𝑇 ∧ 𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆)) → ((𝐴𝐹𝐵) = (𝐴𝐹𝐶) ↔ 𝐵 = 𝐶)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | caovcang.1 | . . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑇 ∧ 𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → ((𝑥𝐹𝑦) = (𝑥𝐹𝑧) ↔ 𝑦 = 𝑧)) | |
| 2 | 1 | ralrimivvva 3210 | . 2 ⊢ (𝜑 → ∀𝑥 ∈ 𝑇 ∀𝑦 ∈ 𝑆 ∀𝑧 ∈ 𝑆 ((𝑥𝐹𝑦) = (𝑥𝐹𝑧) ↔ 𝑦 = 𝑧)) |
| 3 | oveq1 7405 | . . . . 5 ⊢ (𝑥 = 𝐴 → (𝑥𝐹𝑦) = (𝐴𝐹𝑦)) | |
| 4 | oveq1 7405 | . . . . 5 ⊢ (𝑥 = 𝐴 → (𝑥𝐹𝑧) = (𝐴𝐹𝑧)) | |
| 5 | 3, 4 | eqeq12d 2780 | . . . 4 ⊢ (𝑥 = 𝐴 → ((𝑥𝐹𝑦) = (𝑥𝐹𝑧) ↔ (𝐴𝐹𝑦) = (𝐴𝐹𝑧))) |
| 6 | 5 | bibi1d 345 | . . 3 ⊢ (𝑥 = 𝐴 → (((𝑥𝐹𝑦) = (𝑥𝐹𝑧) ↔ 𝑦 = 𝑧) ↔ ((𝐴𝐹𝑦) = (𝐴𝐹𝑧) ↔ 𝑦 = 𝑧))) |
| 7 | oveq2 7406 | . . . . 5 ⊢ (𝑦 = 𝐵 → (𝐴𝐹𝑦) = (𝐴𝐹𝐵)) | |
| 8 | 7 | eqeq1d 2766 | . . . 4 ⊢ (𝑦 = 𝐵 → ((𝐴𝐹𝑦) = (𝐴𝐹𝑧) ↔ (𝐴𝐹𝐵) = (𝐴𝐹𝑧))) |
| 9 | eqeq1 2768 | . . . 4 ⊢ (𝑦 = 𝐵 → (𝑦 = 𝑧 ↔ 𝐵 = 𝑧)) | |
| 10 | 8, 9 | bibi12d 347 | . . 3 ⊢ (𝑦 = 𝐵 → (((𝐴𝐹𝑦) = (𝐴𝐹𝑧) ↔ 𝑦 = 𝑧) ↔ ((𝐴𝐹𝐵) = (𝐴𝐹𝑧) ↔ 𝐵 = 𝑧))) |
| 11 | oveq2 7406 | . . . . 5 ⊢ (𝑧 = 𝐶 → (𝐴𝐹𝑧) = (𝐴𝐹𝐶)) | |
| 12 | 11 | eqeq2d 2775 | . . . 4 ⊢ (𝑧 = 𝐶 → ((𝐴𝐹𝐵) = (𝐴𝐹𝑧) ↔ (𝐴𝐹𝐵) = (𝐴𝐹𝐶))) |
| 13 | eqeq2 2776 | . . . 4 ⊢ (𝑧 = 𝐶 → (𝐵 = 𝑧 ↔ 𝐵 = 𝐶)) | |
| 14 | 12, 13 | bibi12d 347 | . . 3 ⊢ (𝑧 = 𝐶 → (((𝐴𝐹𝐵) = (𝐴𝐹𝑧) ↔ 𝐵 = 𝑧) ↔ ((𝐴𝐹𝐵) = (𝐴𝐹𝐶) ↔ 𝐵 = 𝐶))) |
| 15 | 6, 10, 14 | rspc3v 3599 | . 2 ⊢ ((𝐴 ∈ 𝑇 ∧ 𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆) → (∀𝑥 ∈ 𝑇 ∀𝑦 ∈ 𝑆 ∀𝑧 ∈ 𝑆 ((𝑥𝐹𝑦) = (𝑥𝐹𝑧) ↔ 𝑦 = 𝑧) → ((𝐴𝐹𝐵) = (𝐴𝐹𝐶) ↔ 𝐵 = 𝐶))) |
| 16 | 2, 15 | mpan9 514 | 1 ⊢ ((𝜑 ∧ (𝐴 ∈ 𝑇 ∧ 𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆)) → ((𝐴𝐹𝐵) = (𝐴𝐹𝐶) ↔ 𝐵 = 𝐶)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 ∧ wa 399 ∧ w3a 1099 = wceq 1562 ∈ wcel 2144 ∀wral 3078 (class class class)co 7398 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1817 ax-4 1831 ax-5 1932 ax-6 1989 ax-7 2030 ax-8 2146 ax-9 2154 ax-ext 2736 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1101 df-tru 1565 df-fal 1575 df-ex 1802 df-sb 2093 df-clab 2743 df-cleq 2756 df-clel 2839 df-ral 3079 df-rab 3417 df-v 3458 df-dif 3909 df-un 3911 df-ss 3923 df-nul 4288 df-if 4483 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5103 df-iota 6479 df-fv 6531 df-ov 7401 |
| This theorem is referenced by: caovcand 7600 caofcan 44904 |
| Copyright terms: Public domain | W3C validator |