Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > caovcand | GIF version |
Description: Convert an operation cancellation law to class notation. (Contributed by Mario Carneiro, 30-Dec-2014.) |
Ref | Expression |
---|---|
caovcang.1 | ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑇 ∧ 𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → ((𝑥𝐹𝑦) = (𝑥𝐹𝑧) ↔ 𝑦 = 𝑧)) |
caovcand.2 | ⊢ (𝜑 → 𝐴 ∈ 𝑇) |
caovcand.3 | ⊢ (𝜑 → 𝐵 ∈ 𝑆) |
caovcand.4 | ⊢ (𝜑 → 𝐶 ∈ 𝑆) |
Ref | Expression |
---|---|
caovcand | ⊢ (𝜑 → ((𝐴𝐹𝐵) = (𝐴𝐹𝐶) ↔ 𝐵 = 𝐶)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | id 19 | . 2 ⊢ (𝜑 → 𝜑) | |
2 | caovcand.2 | . 2 ⊢ (𝜑 → 𝐴 ∈ 𝑇) | |
3 | caovcand.3 | . 2 ⊢ (𝜑 → 𝐵 ∈ 𝑆) | |
4 | caovcand.4 | . 2 ⊢ (𝜑 → 𝐶 ∈ 𝑆) | |
5 | caovcang.1 | . . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑇 ∧ 𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → ((𝑥𝐹𝑦) = (𝑥𝐹𝑧) ↔ 𝑦 = 𝑧)) | |
6 | 5 | caovcang 5682 | . 2 ⊢ ((𝜑 ∧ (𝐴 ∈ 𝑇 ∧ 𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆)) → ((𝐴𝐹𝐵) = (𝐴𝐹𝐶) ↔ 𝐵 = 𝐶)) |
7 | 1, 2, 3, 4, 6 | syl13anc 1171 | 1 ⊢ (𝜑 → ((𝐴𝐹𝐵) = (𝐴𝐹𝐶) ↔ 𝐵 = 𝐶)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 102 ↔ wb 103 ∧ w3a 919 = wceq 1284 ∈ wcel 1433 (class class class)co 5532 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 104 ax-ia2 105 ax-ia3 106 ax-io 662 ax-5 1376 ax-7 1377 ax-gen 1378 ax-ie1 1422 ax-ie2 1423 ax-8 1435 ax-10 1436 ax-11 1437 ax-i12 1438 ax-bndl 1439 ax-4 1440 ax-17 1459 ax-i9 1463 ax-ial 1467 ax-i5r 1468 ax-ext 2063 |
This theorem depends on definitions: df-bi 115 df-3an 921 df-tru 1287 df-nf 1390 df-sb 1686 df-clab 2068 df-cleq 2074 df-clel 2077 df-nfc 2208 df-ral 2353 df-rex 2354 df-v 2603 df-un 2977 df-sn 3404 df-pr 3405 df-op 3407 df-uni 3602 df-br 3786 df-iota 4887 df-fv 4930 df-ov 5535 |
This theorem is referenced by: caovcanrd 5684 ecopovtrn 6226 ecopovtrng 6229 |
Copyright terms: Public domain | W3C validator |