| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > xrnegcon1d | GIF version | ||
| Description: Contraposition law for extended real unary minus. (Contributed by Jim Kingdon, 2-May-2023.) |
| Ref | Expression |
|---|---|
| xrnegcon1d.a | ⊢ (𝜑 → 𝐴 ∈ ℝ*) |
| xrnegcon1d.b | ⊢ (𝜑 → 𝐵 ∈ ℝ*) |
| Ref | Expression |
|---|---|
| xrnegcon1d | ⊢ (𝜑 → (-𝑒𝐴 = 𝐵 ↔ -𝑒𝐵 = 𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | xrnegcon1d.b | . . . 4 ⊢ (𝜑 → 𝐵 ∈ ℝ*) | |
| 2 | xnegneg 10025 | . . . . 5 ⊢ (𝐵 ∈ ℝ* → -𝑒-𝑒𝐵 = 𝐵) | |
| 3 | 2 | eqeq2d 2241 | . . . 4 ⊢ (𝐵 ∈ ℝ* → (-𝑒𝐴 = -𝑒-𝑒𝐵 ↔ -𝑒𝐴 = 𝐵)) |
| 4 | 1, 3 | syl 14 | . . 3 ⊢ (𝜑 → (-𝑒𝐴 = -𝑒-𝑒𝐵 ↔ -𝑒𝐴 = 𝐵)) |
| 5 | xrnegcon1d.a | . . . 4 ⊢ (𝜑 → 𝐴 ∈ ℝ*) | |
| 6 | 1 | xnegcld 10047 | . . . 4 ⊢ (𝜑 → -𝑒𝐵 ∈ ℝ*) |
| 7 | xneg11 10026 | . . . 4 ⊢ ((𝐴 ∈ ℝ* ∧ -𝑒𝐵 ∈ ℝ*) → (-𝑒𝐴 = -𝑒-𝑒𝐵 ↔ 𝐴 = -𝑒𝐵)) | |
| 8 | 5, 6, 7 | syl2anc 411 | . . 3 ⊢ (𝜑 → (-𝑒𝐴 = -𝑒-𝑒𝐵 ↔ 𝐴 = -𝑒𝐵)) |
| 9 | 4, 8 | bitr3d 190 | . 2 ⊢ (𝜑 → (-𝑒𝐴 = 𝐵 ↔ 𝐴 = -𝑒𝐵)) |
| 10 | eqcom 2231 | . 2 ⊢ (𝐴 = -𝑒𝐵 ↔ -𝑒𝐵 = 𝐴) | |
| 11 | 9, 10 | bitrdi 196 | 1 ⊢ (𝜑 → (-𝑒𝐴 = 𝐵 ↔ -𝑒𝐵 = 𝐴)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ↔ wb 105 = wceq 1395 ∈ wcel 2200 ℝ*cxr 8176 -𝑒cxne 9961 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-sep 4201 ax-pow 4257 ax-pr 4292 ax-un 4523 ax-setind 4628 ax-cnex 8086 ax-resscn 8087 ax-1cn 8088 ax-icn 8090 ax-addcl 8091 ax-addrcl 8092 ax-mulcl 8093 ax-addcom 8095 ax-addass 8097 ax-distr 8099 ax-i2m1 8100 ax-0id 8103 ax-rnegex 8104 ax-cnre 8106 |
| This theorem depends on definitions: df-bi 117 df-3or 1003 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-nel 2496 df-ral 2513 df-rex 2514 df-reu 2515 df-rab 2517 df-v 2801 df-sbc 3029 df-dif 3199 df-un 3201 df-in 3203 df-ss 3210 df-if 3603 df-pw 3651 df-sn 3672 df-pr 3673 df-op 3675 df-uni 3888 df-br 4083 df-opab 4145 df-id 4383 df-xp 4724 df-rel 4725 df-cnv 4726 df-co 4727 df-dm 4728 df-iota 5277 df-fun 5319 df-fv 5325 df-riota 5953 df-ov 6003 df-oprab 6004 df-mpo 6005 df-pnf 8179 df-mnf 8180 df-xr 8181 df-sub 8315 df-neg 8316 df-xneg 9964 |
| This theorem is referenced by: xrminmax 11771 xrmineqinf 11775 |
| Copyright terms: Public domain | W3C validator |