![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > caovcan | 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 5735 | . . . 4 ⊢ (𝑥 = 𝐴 → (𝑥𝐹𝑦) = (𝐴𝐹𝑦)) | |
2 | oveq1 5735 | . . . 4 ⊢ (𝑥 = 𝐴 → (𝑥𝐹𝐶) = (𝐴𝐹𝐶)) | |
3 | 1, 2 | eqeq12d 2129 | . . 3 ⊢ (𝑥 = 𝐴 → ((𝑥𝐹𝑦) = (𝑥𝐹𝐶) ↔ (𝐴𝐹𝑦) = (𝐴𝐹𝐶))) |
4 | 3 | imbi1d 230 | . 2 ⊢ (𝑥 = 𝐴 → (((𝑥𝐹𝑦) = (𝑥𝐹𝐶) → 𝑦 = 𝐶) ↔ ((𝐴𝐹𝑦) = (𝐴𝐹𝐶) → 𝑦 = 𝐶))) |
5 | oveq2 5736 | . . . 4 ⊢ (𝑦 = 𝐵 → (𝐴𝐹𝑦) = (𝐴𝐹𝐵)) | |
6 | 5 | eqeq1d 2123 | . . 3 ⊢ (𝑦 = 𝐵 → ((𝐴𝐹𝑦) = (𝐴𝐹𝐶) ↔ (𝐴𝐹𝐵) = (𝐴𝐹𝐶))) |
7 | eqeq1 2121 | . . 3 ⊢ (𝑦 = 𝐵 → (𝑦 = 𝐶 ↔ 𝐵 = 𝐶)) | |
8 | 6, 7 | imbi12d 233 | . 2 ⊢ (𝑦 = 𝐵 → (((𝐴𝐹𝑦) = (𝐴𝐹𝐶) → 𝑦 = 𝐶) ↔ ((𝐴𝐹𝐵) = (𝐴𝐹𝐶) → 𝐵 = 𝐶))) |
9 | caovcan.1 | . . 3 ⊢ 𝐶 ∈ V | |
10 | oveq2 5736 | . . . . . 6 ⊢ (𝑧 = 𝐶 → (𝑥𝐹𝑧) = (𝑥𝐹𝐶)) | |
11 | 10 | eqeq2d 2126 | . . . . 5 ⊢ (𝑧 = 𝐶 → ((𝑥𝐹𝑦) = (𝑥𝐹𝑧) ↔ (𝑥𝐹𝑦) = (𝑥𝐹𝐶))) |
12 | eqeq2 2124 | . . . . 5 ⊢ (𝑧 = 𝐶 → (𝑦 = 𝑧 ↔ 𝑦 = 𝐶)) | |
13 | 11, 12 | imbi12d 233 | . . . 4 ⊢ (𝑧 = 𝐶 → (((𝑥𝐹𝑦) = (𝑥𝐹𝑧) → 𝑦 = 𝑧) ↔ ((𝑥𝐹𝑦) = (𝑥𝐹𝐶) → 𝑦 = 𝐶))) |
14 | 13 | imbi2d 229 | . . 3 ⊢ (𝑧 = 𝐶 → (((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) → ((𝑥𝐹𝑦) = (𝑥𝐹𝑧) → 𝑦 = 𝑧)) ↔ ((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) → ((𝑥𝐹𝑦) = (𝑥𝐹𝐶) → 𝑦 = 𝐶)))) |
15 | caovcan.2 | . . 3 ⊢ ((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) → ((𝑥𝐹𝑦) = (𝑥𝐹𝑧) → 𝑦 = 𝑧)) | |
16 | 9, 14, 15 | vtocl 2711 | . 2 ⊢ ((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) → ((𝑥𝐹𝑦) = (𝑥𝐹𝐶) → 𝑦 = 𝐶)) |
17 | 4, 8, 16 | vtocl2ga 2725 | 1 ⊢ ((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) → ((𝐴𝐹𝐵) = (𝐴𝐹𝐶) → 𝐵 = 𝐶)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 = wceq 1314 ∈ wcel 1463 Vcvv 2657 (class class class)co 5728 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-io 681 ax-5 1406 ax-7 1407 ax-gen 1408 ax-ie1 1452 ax-ie2 1453 ax-8 1465 ax-10 1466 ax-11 1467 ax-i12 1468 ax-bndl 1469 ax-4 1470 ax-17 1489 ax-i9 1493 ax-ial 1497 ax-i5r 1498 ax-ext 2097 |
This theorem depends on definitions: df-bi 116 df-3an 947 df-tru 1317 df-nf 1420 df-sb 1719 df-clab 2102 df-cleq 2108 df-clel 2111 df-nfc 2244 df-rex 2396 df-v 2659 df-un 3041 df-sn 3499 df-pr 3500 df-op 3502 df-uni 3703 df-br 3896 df-iota 5046 df-fv 5089 df-ov 5731 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |