| 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 37961 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 6879 | . 2 ⊢ (𝐴 = 𝐵 → (+∞ei‘𝐴) = (+∞ei‘𝐵)) | |
| 2 | fveq2 6879 | . . 3 ⊢ ((+∞ei‘𝐴) = (+∞ei‘𝐵) → (1st ‘(+∞ei‘𝐴)) = (1st ‘(+∞ei‘𝐵))) | |
| 3 | bj-inftyexpiinv 37961 | . . . . . . 7 ⊢ (𝐴 ∈ (-π(,]π) → (1st ‘(+∞ei‘𝐴)) = 𝐴) | |
| 4 | 3 | adantr 486 | . . . . . 6 ⊢ ((𝐴 ∈ (-π(,]π) ∧ 𝐵 ∈ (-π(,]π)) → (1st ‘(+∞ei‘𝐴)) = 𝐴) |
| 5 | 4 | eqeq1d 2762 | . . . . 5 ⊢ ((𝐴 ∈ (-π(,]π) ∧ 𝐵 ∈ (-π(,]π)) → ((1st ‘(+∞ei‘𝐴)) = (1st ‘(+∞ei‘𝐵)) ↔ 𝐴 = (1st ‘(+∞ei‘𝐵)))) |
| 6 | 5 | biimpd 232 | . . . 4 ⊢ ((𝐴 ∈ (-π(,]π) ∧ 𝐵 ∈ (-π(,]π)) → ((1st ‘(+∞ei‘𝐴)) = (1st ‘(+∞ei‘𝐵)) → 𝐴 = (1st ‘(+∞ei‘𝐵)))) |
| 7 | bj-inftyexpiinv 37961 | . . . . . 6 ⊢ (𝐵 ∈ (-π(,]π) → (1st ‘(+∞ei‘𝐵)) = 𝐵) | |
| 8 | 7 | adantl 487 | . . . . 5 ⊢ ((𝐴 ∈ (-π(,]π) ∧ 𝐵 ∈ (-π(,]π)) → (1st ‘(+∞ei‘𝐵)) = 𝐵) |
| 9 | 8 | eqeq2d 2771 | . . . 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 |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ‘cfv 6533 (class class class)co 7414 1st c1st 7985 -cneg 11467 (,]cioc 13400 πcpi 16153 +∞eicinftyexpi 37959 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-sep 5251 ax-nul 5263 ax-pr 5398 ax-un 7737 ax-cnex 11181 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5550 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-iota 6489 df-fun 6535 df-fv 6541 df-1st 7987 df-bj-inftyexpi 37960 |
| This theorem is used by: bj-pinftynminfty 37980 |
| Copyright terms: Public domain | W3C validator |