| 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 3217 | . 2 ⊢ (𝜑 → ∀𝑥 ∈ 𝑇 ∀𝑦 ∈ 𝑆 ∀𝑧 ∈ 𝑆 ((𝑥𝐹𝑦) = (𝑥𝐹𝑧) ↔ 𝑦 = 𝑧)) |
| 3 | oveq1 7418 | . . . . 5 ⊢ (𝑥 = 𝐴 → (𝑥𝐹𝑦) = (𝐴𝐹𝑦)) | |
| 4 | oveq1 7418 | . . . . 5 ⊢ (𝑥 = 𝐴 → (𝑥𝐹𝑧) = (𝐴𝐹𝑧)) | |
| 5 | 3, 4 | eqeq12d 2785 | . . . 4 ⊢ (𝑥 = 𝐴 → ((𝑥𝐹𝑦) = (𝑥𝐹𝑧) ↔ (𝐴𝐹𝑦) = (𝐴𝐹𝑧))) |
| 6 | 5 | bibi1d 346 | . . 3 ⊢ (𝑥 = 𝐴 → (((𝑥𝐹𝑦) = (𝑥𝐹𝑧) ↔ 𝑦 = 𝑧) ↔ ((𝐴𝐹𝑦) = (𝐴𝐹𝑧) ↔ 𝑦 = 𝑧))) |
| 7 | oveq2 7419 | . . . . 5 ⊢ (𝑦 = 𝐵 → (𝐴𝐹𝑦) = (𝐴𝐹𝐵)) | |
| 8 | 7 | eqeq1d 2771 | . . . 4 ⊢ (𝑦 = 𝐵 → ((𝐴𝐹𝑦) = (𝐴𝐹𝑧) ↔ (𝐴𝐹𝐵) = (𝐴𝐹𝑧))) |
| 9 | eqeq1 2773 | . . . 4 ⊢ (𝑦 = 𝐵 → (𝑦 = 𝑧 ↔ 𝐵 = 𝑧)) | |
| 10 | 8, 9 | bibi12d 348 | . . 3 ⊢ (𝑦 = 𝐵 → (((𝐴𝐹𝑦) = (𝐴𝐹𝑧) ↔ 𝑦 = 𝑧) ↔ ((𝐴𝐹𝐵) = (𝐴𝐹𝑧) ↔ 𝐵 = 𝑧))) |
| 11 | oveq2 7419 | . . . . 5 ⊢ (𝑧 = 𝐶 → (𝐴𝐹𝑧) = (𝐴𝐹𝐶)) | |
| 12 | 11 | eqeq2d 2780 | . . . 4 ⊢ (𝑧 = 𝐶 → ((𝐴𝐹𝐵) = (𝐴𝐹𝑧) ↔ (𝐴𝐹𝐵) = (𝐴𝐹𝐶))) |
| 13 | eqeq2 2781 | . . . 4 ⊢ (𝑧 = 𝐶 → (𝐵 = 𝑧 ↔ 𝐵 = 𝐶)) | |
| 14 | 12, 13 | bibi12d 348 | . . 3 ⊢ (𝑧 = 𝐶 → (((𝐴𝐹𝐵) = (𝐴𝐹𝑧) ↔ 𝐵 = 𝑧) ↔ ((𝐴𝐹𝐵) = (𝐴𝐹𝐶) ↔ 𝐵 = 𝐶))) |
| 15 | 6, 10, 14 | rspc3v 3604 | . 2 ⊢ ((𝐴 ∈ 𝑇 ∧ 𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆) → (∀𝑥 ∈ 𝑇 ∀𝑦 ∈ 𝑆 ∀𝑧 ∈ 𝑆 ((𝑥𝐹𝑦) = (𝑥𝐹𝑧) ↔ 𝑦 = 𝑧) → ((𝐴𝐹𝐵) = (𝐴𝐹𝐶) ↔ 𝐵 = 𝐶))) |
| 16 | 2, 15 | mpan9 515 | 1 ⊢ ((𝜑 ∧ (𝐴 ∈ 𝑇 ∧ 𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆)) → ((𝐴𝐹𝐵) = (𝐴𝐹𝐶) ↔ 𝐵 = 𝐶)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 ∧ w3a 1101 = wceq 1567 ∈ wcel 2149 ∀wral 3085 (class class class)co 7411 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-ext 2741 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-sb 2098 df-clab 2748 df-cleq 2761 df-clel 2844 df-ral 3086 df-rab 3423 df-v 3463 df-dif 3914 df-un 3916 df-ss 3928 df-nul 4293 df-if 4491 df-sn 4593 df-pr 4595 df-op 4599 df-uni 4875 df-br 5112 df-iota 6493 df-fv 6545 df-ov 7414 |
| This theorem is referenced by: caovcand 7613 caofcan 44960 |
| Copyright terms: Public domain | W3C validator |