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 5519 | . . . 4 ⊢ (𝑥 = 𝐴 → (𝑥𝐹𝑦) = (𝐴𝐹𝑦)) | |
2 | oveq1 5519 | . . . 4 ⊢ (𝑥 = 𝐴 → (𝑥𝐹𝐶) = (𝐴𝐹𝐶)) | |
3 | 1, 2 | eqeq12d 2054 | . . 3 ⊢ (𝑥 = 𝐴 → ((𝑥𝐹𝑦) = (𝑥𝐹𝐶) ↔ (𝐴𝐹𝑦) = (𝐴𝐹𝐶))) |
4 | 3 | imbi1d 220 | . 2 ⊢ (𝑥 = 𝐴 → (((𝑥𝐹𝑦) = (𝑥𝐹𝐶) → 𝑦 = 𝐶) ↔ ((𝐴𝐹𝑦) = (𝐴𝐹𝐶) → 𝑦 = 𝐶))) |
5 | oveq2 5520 | . . . 4 ⊢ (𝑦 = 𝐵 → (𝐴𝐹𝑦) = (𝐴𝐹𝐵)) | |
6 | 5 | eqeq1d 2048 | . . 3 ⊢ (𝑦 = 𝐵 → ((𝐴𝐹𝑦) = (𝐴𝐹𝐶) ↔ (𝐴𝐹𝐵) = (𝐴𝐹𝐶))) |
7 | eqeq1 2046 | . . 3 ⊢ (𝑦 = 𝐵 → (𝑦 = 𝐶 ↔ 𝐵 = 𝐶)) | |
8 | 6, 7 | imbi12d 223 | . 2 ⊢ (𝑦 = 𝐵 → (((𝐴𝐹𝑦) = (𝐴𝐹𝐶) → 𝑦 = 𝐶) ↔ ((𝐴𝐹𝐵) = (𝐴𝐹𝐶) → 𝐵 = 𝐶))) |
9 | caovcan.1 | . . 3 ⊢ 𝐶 ∈ V | |
10 | oveq2 5520 | . . . . . 6 ⊢ (𝑧 = 𝐶 → (𝑥𝐹𝑧) = (𝑥𝐹𝐶)) | |
11 | 10 | eqeq2d 2051 | . . . . 5 ⊢ (𝑧 = 𝐶 → ((𝑥𝐹𝑦) = (𝑥𝐹𝑧) ↔ (𝑥𝐹𝑦) = (𝑥𝐹𝐶))) |
12 | eqeq2 2049 | . . . . 5 ⊢ (𝑧 = 𝐶 → (𝑦 = 𝑧 ↔ 𝑦 = 𝐶)) | |
13 | 11, 12 | imbi12d 223 | . . . 4 ⊢ (𝑧 = 𝐶 → (((𝑥𝐹𝑦) = (𝑥𝐹𝑧) → 𝑦 = 𝑧) ↔ ((𝑥𝐹𝑦) = (𝑥𝐹𝐶) → 𝑦 = 𝐶))) |
14 | 13 | imbi2d 219 | . . 3 ⊢ (𝑧 = 𝐶 → (((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) → ((𝑥𝐹𝑦) = (𝑥𝐹𝑧) → 𝑦 = 𝑧)) ↔ ((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) → ((𝑥𝐹𝑦) = (𝑥𝐹𝐶) → 𝑦 = 𝐶)))) |
15 | caovcan.2 | . . 3 ⊢ ((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) → ((𝑥𝐹𝑦) = (𝑥𝐹𝑧) → 𝑦 = 𝑧)) | |
16 | 9, 14, 15 | vtocl 2608 | . 2 ⊢ ((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) → ((𝑥𝐹𝑦) = (𝑥𝐹𝐶) → 𝑦 = 𝐶)) |
17 | 4, 8, 16 | vtocl2ga 2621 | 1 ⊢ ((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) → ((𝐴𝐹𝐵) = (𝐴𝐹𝐶) → 𝐵 = 𝐶)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 97 = wceq 1243 ∈ wcel 1393 Vcvv 2557 (class class class)co 5512 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 99 ax-ia2 100 ax-ia3 101 ax-io 630 ax-5 1336 ax-7 1337 ax-gen 1338 ax-ie1 1382 ax-ie2 1383 ax-8 1395 ax-10 1396 ax-11 1397 ax-i12 1398 ax-bndl 1399 ax-4 1400 ax-17 1419 ax-i9 1423 ax-ial 1427 ax-i5r 1428 ax-ext 2022 |
This theorem depends on definitions: df-bi 110 df-3an 887 df-tru 1246 df-nf 1350 df-sb 1646 df-clab 2027 df-cleq 2033 df-clel 2036 df-nfc 2167 df-rex 2312 df-v 2559 df-un 2922 df-sn 3381 df-pr 3382 df-op 3384 df-uni 3581 df-br 3765 df-iota 4867 df-fv 4910 df-ov 5515 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |