![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > subcl | GIF version |
Description: Closure law for subtraction. (Contributed by NM, 10-May-1999.) (Revised by Mario Carneiro, 21-Dec-2013.) |
Ref | Expression |
---|---|
subcl | ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 − 𝐵) ∈ ℂ) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | subval 7300 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 − 𝐵) = (℩𝑥 ∈ ℂ (𝐵 + 𝑥) = 𝐴)) | |
2 | negeu 7299 | . . . 4 ⊢ ((𝐵 ∈ ℂ ∧ 𝐴 ∈ ℂ) → ∃!𝑥 ∈ ℂ (𝐵 + 𝑥) = 𝐴) | |
3 | 2 | ancoms 264 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ∃!𝑥 ∈ ℂ (𝐵 + 𝑥) = 𝐴) |
4 | riotacl 5502 | . . 3 ⊢ (∃!𝑥 ∈ ℂ (𝐵 + 𝑥) = 𝐴 → (℩𝑥 ∈ ℂ (𝐵 + 𝑥) = 𝐴) ∈ ℂ) | |
5 | 3, 4 | syl 14 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (℩𝑥 ∈ ℂ (𝐵 + 𝑥) = 𝐴) ∈ ℂ) |
6 | 1, 5 | eqeltrd 2155 | 1 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 − 𝐵) ∈ ℂ) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 102 = wceq 1284 ∈ wcel 1433 ∃!wreu 2350 ℩crio 5487 (class class class)co 5532 ℂcc 6979 + caddc 6984 − cmin 7279 |
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-in1 576 ax-in2 577 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-14 1445 ax-17 1459 ax-i9 1463 ax-ial 1467 ax-i5r 1468 ax-ext 2063 ax-sep 3896 ax-pow 3948 ax-pr 3964 ax-setind 4280 ax-resscn 7068 ax-1cn 7069 ax-icn 7071 ax-addcl 7072 ax-addrcl 7073 ax-mulcl 7074 ax-addcom 7076 ax-addass 7078 ax-distr 7080 ax-i2m1 7081 ax-0id 7084 ax-rnegex 7085 ax-cnre 7087 |
This theorem depends on definitions: df-bi 115 df-3an 921 df-tru 1287 df-fal 1290 df-nf 1390 df-sb 1686 df-eu 1944 df-mo 1945 df-clab 2068 df-cleq 2074 df-clel 2077 df-nfc 2208 df-ne 2246 df-ral 2353 df-rex 2354 df-reu 2355 df-rab 2357 df-v 2603 df-sbc 2816 df-dif 2975 df-un 2977 df-in 2979 df-ss 2986 df-pw 3384 df-sn 3404 df-pr 3405 df-op 3407 df-uni 3602 df-br 3786 df-opab 3840 df-id 4048 df-xp 4369 df-rel 4370 df-cnv 4371 df-co 4372 df-dm 4373 df-iota 4887 df-fun 4924 df-fv 4930 df-riota 5488 df-ov 5535 df-oprab 5536 df-mpt2 5537 df-sub 7281 |
This theorem is referenced by: negcl 7308 subf 7310 pncan3 7316 npcan 7317 addsubass 7318 addsub 7319 addsub12 7321 addsubeq4 7323 npncan 7329 nppcan 7330 nnpcan 7331 nppcan3 7332 subcan2 7333 subsub2 7336 subsub4 7341 nnncan 7343 nnncan1 7344 nnncan2 7345 npncan3 7346 addsub4 7351 subadd4 7352 peano2cnm 7374 subcli 7384 subcld 7419 subeqrev 7480 subdi 7489 subdir 7490 mulsub2 7506 recextlem1 7741 recexap 7743 cju 8038 halfaddsubcl 8264 halfaddsub 8265 iccf1o 9026 isersub 9464 sqsubswap 9536 subsq 9581 subsq2 9582 bcn2 9691 shftval2 9714 2shfti 9719 sqabssub 9942 abssub 9987 abs3dif 9991 abs2dif 9992 abs2difabs 9994 climuni 10132 cjcn2 10154 recn2 10155 imcn2 10156 climsub 10166 fzocongeq 10258 odd2np1 10272 |
Copyright terms: Public domain | W3C validator |