| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > caovcan | Structured version Visualization version GIF version | ||
| Description: Convert an operation cancellation law to class notation. (Contributed by NM, 20-Aug-1995.) |
| Ref | Expression |
|---|---|
| caovcan.1 | ⊢ 𝐶 ∈ V |
| caovcan.2 | ⊢ ((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) → ((𝑥𝐹𝑦) = (𝑥𝐹𝑧) → 𝑦 = 𝑧)) |
| Ref | Expression |
|---|---|
| caovcan | ⊢ ((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) → ((𝐴𝐹𝐵) = (𝐴𝐹𝐶) → 𝐵 = 𝐶)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | oveq1 7420 | . . . 4 ⊢ (𝑥 = 𝐴 → (𝑥𝐹𝑦) = (𝐴𝐹𝑦)) | |
| 2 | oveq1 7420 | . . . 4 ⊢ (𝑥 = 𝐴 → (𝑥𝐹𝐶) = (𝐴𝐹𝐶)) | |
| 3 | 1, 2 | eqeq12d 2776 | . . 3 ⊢ (𝑥 = 𝐴 → ((𝑥𝐹𝑦) = (𝑥𝐹𝐶) ↔ (𝐴𝐹𝑦) = (𝐴𝐹𝐶))) |
| 4 | 3 | imbi1d 344 | . 2 ⊢ (𝑥 = 𝐴 → (((𝑥𝐹𝑦) = (𝑥𝐹𝐶) → 𝑦 = 𝐶) ↔ ((𝐴𝐹𝑦) = (𝐴𝐹𝐶) → 𝑦 = 𝐶))) |
| 5 | oveq2 7421 | . . . 4 ⊢ (𝑦 = 𝐵 → (𝐴𝐹𝑦) = (𝐴𝐹𝐵)) | |
| 6 | 5 | eqeq1d 2762 | . . 3 ⊢ (𝑦 = 𝐵 → ((𝐴𝐹𝑦) = (𝐴𝐹𝐶) ↔ (𝐴𝐹𝐵) = (𝐴𝐹𝐶))) |
| 7 | eqeq1 2764 | . . 3 ⊢ (𝑦 = 𝐵 → (𝑦 = 𝐶 ↔ 𝐵 = 𝐶)) | |
| 8 | 6, 7 | imbi12d 347 | . 2 ⊢ (𝑦 = 𝐵 → (((𝐴𝐹𝑦) = (𝐴𝐹𝐶) → 𝑦 = 𝐶) ↔ ((𝐴𝐹𝐵) = (𝐴𝐹𝐶) → 𝐵 = 𝐶))) |
| 9 | caovcan.1 | . . 3 ⊢ 𝐶 ∈ V | |
| 10 | oveq2 7421 | . . . . . 6 ⊢ (𝑧 = 𝐶 → (𝑥𝐹𝑧) = (𝑥𝐹𝐶)) | |
| 11 | 10 | eqeq2d 2771 | . . . . 5 ⊢ (𝑧 = 𝐶 → ((𝑥𝐹𝑦) = (𝑥𝐹𝑧) ↔ (𝑥𝐹𝑦) = (𝑥𝐹𝐶))) |
| 12 | eqeq2 2772 | . . . . 5 ⊢ (𝑧 = 𝐶 → (𝑦 = 𝑧 ↔ 𝑦 = 𝐶)) | |
| 13 | 11, 12 | imbi12d 347 | . . . 4 ⊢ (𝑧 = 𝐶 → (((𝑥𝐹𝑦) = (𝑥𝐹𝑧) → 𝑦 = 𝑧) ↔ ((𝑥𝐹𝑦) = (𝑥𝐹𝐶) → 𝑦 = 𝐶))) |
| 14 | 13 | imbi2d 343 | . . 3 ⊢ (𝑧 = 𝐶 → (((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) → ((𝑥𝐹𝑦) = (𝑥𝐹𝑧) → 𝑦 = 𝑧)) ↔ ((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) → ((𝑥𝐹𝑦) = (𝑥𝐹𝐶) → 𝑦 = 𝐶)))) |
| 15 | caovcan.2 | . . 3 ⊢ ((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) → ((𝑥𝐹𝑦) = (𝑥𝐹𝑧) → 𝑦 = 𝑧)) | |
| 16 | 9, 14, 15 | vtocl 3520 | . 2 ⊢ ((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) → ((𝑥𝐹𝑦) = (𝑥𝐹𝐶) → 𝑦 = 𝐶)) |
| 17 | 4, 8, 16 | vtocl2ga 3537 | 1 ⊢ ((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) → ((𝐴𝐹𝐵) = (𝐴𝐹𝐶) → 𝐵 = 𝐶)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 Vcvv 3450 (class class class)co 7413 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-ext 2732 |
| 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 2100 df-clab 2739 df-cleq 2752 df-clel 2835 df-rab 3413 df-v 3452 df-dif 3902 df-un 3904 df-ss 3916 df-nul 4280 df-if 4483 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5104 df-iota 6489 df-fv 6541 df-ov 7416 |
| This theorem is used by: ecopovtrn 8820 |
| Copyright terms: Public domain | W3C validator |