| Mathbox for BJ |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > bj-inftyexpiinj | Structured version Visualization version GIF version | ||
| Description: Injectivity of the parameterization +∞ei. Remark: a more conceptual proof would use bj-inftyexpiinv 37739 and the fact that a function with a retraction is injective. (Contributed by BJ, 22-Jun-2019.) |
| Ref | Expression |
|---|---|
| bj-inftyexpiinj | ⊢ ((𝐴 ∈ (-π(,]π) ∧ 𝐵 ∈ (-π(,]π)) → (𝐴 = 𝐵 ↔ (+∞ei‘𝐴) = (+∞ei‘𝐵))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fveq2 6882 | . 2 ⊢ (𝐴 = 𝐵 → (+∞ei‘𝐴) = (+∞ei‘𝐵)) | |
| 2 | fveq2 6882 | . . 3 ⊢ ((+∞ei‘𝐴) = (+∞ei‘𝐵) → (1st ‘(+∞ei‘𝐴)) = (1st ‘(+∞ei‘𝐵))) | |
| 3 | bj-inftyexpiinv 37739 | . . . . . . 7 ⊢ (𝐴 ∈ (-π(,]π) → (1st ‘(+∞ei‘𝐴)) = 𝐴) | |
| 4 | 3 | adantr 485 | . . . . . 6 ⊢ ((𝐴 ∈ (-π(,]π) ∧ 𝐵 ∈ (-π(,]π)) → (1st ‘(+∞ei‘𝐴)) = 𝐴) |
| 5 | 4 | eqeq1d 2771 | . . . . 5 ⊢ ((𝐴 ∈ (-π(,]π) ∧ 𝐵 ∈ (-π(,]π)) → ((1st ‘(+∞ei‘𝐴)) = (1st ‘(+∞ei‘𝐵)) ↔ 𝐴 = (1st ‘(+∞ei‘𝐵)))) |
| 6 | 5 | biimpd 232 | . . . 4 ⊢ ((𝐴 ∈ (-π(,]π) ∧ 𝐵 ∈ (-π(,]π)) → ((1st ‘(+∞ei‘𝐴)) = (1st ‘(+∞ei‘𝐵)) → 𝐴 = (1st ‘(+∞ei‘𝐵)))) |
| 7 | bj-inftyexpiinv 37739 | . . . . . 6 ⊢ (𝐵 ∈ (-π(,]π) → (1st ‘(+∞ei‘𝐵)) = 𝐵) | |
| 8 | 7 | adantl 486 | . . . . 5 ⊢ ((𝐴 ∈ (-π(,]π) ∧ 𝐵 ∈ (-π(,]π)) → (1st ‘(+∞ei‘𝐵)) = 𝐵) |
| 9 | 8 | eqeq2d 2780 | . . . 4 ⊢ ((𝐴 ∈ (-π(,]π) ∧ 𝐵 ∈ (-π(,]π)) → (𝐴 = (1st ‘(+∞ei‘𝐵)) ↔ 𝐴 = 𝐵)) |
| 10 | 6, 9 | sylibd 242 | . . 3 ⊢ ((𝐴 ∈ (-π(,]π) ∧ 𝐵 ∈ (-π(,]π)) → ((1st ‘(+∞ei‘𝐴)) = (1st ‘(+∞ei‘𝐵)) → 𝐴 = 𝐵)) |
| 11 | 2, 10 | syl5 35 | . 2 ⊢ ((𝐴 ∈ (-π(,]π) ∧ 𝐵 ∈ (-π(,]π)) → ((+∞ei‘𝐴) = (+∞ei‘𝐵) → 𝐴 = 𝐵)) |
| 12 | 1, 11 | impbid2 229 | 1 ⊢ ((𝐴 ∈ (-π(,]π) ∧ 𝐵 ∈ (-π(,]π)) → (𝐴 = 𝐵 ↔ (+∞ei‘𝐴) = (+∞ei‘𝐵))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 = wceq 1567 ∈ wcel 2149 ‘cfv 6537 (class class class)co 7411 1st c1st 7983 -cneg 11441 (,]cioc 13372 πcpi 16119 +∞eicinftyexpi 37737 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-sep 5261 ax-nul 5271 ax-pr 5405 ax-un 7733 ax-cnex 11155 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-ral 3086 df-rex 3096 df-rab 3424 df-v 3465 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-nul 4295 df-if 4493 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4877 df-br 5114 df-opab 5178 df-mpt 5197 df-id 5557 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-iota 6493 df-fun 6539 df-fv 6545 df-1st 7985 df-bj-inftyexpi 37738 |
| This theorem is referenced by: bj-pinftynminfty 37758 |
| Copyright terms: Public domain | W3C validator |