| 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 37911 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 6885 | . 2 ⊢ (𝐴 = 𝐵 → (+∞ei‘𝐴) = (+∞ei‘𝐵)) | |
| 2 | fveq2 6885 | . . 3 ⊢ ((+∞ei‘𝐴) = (+∞ei‘𝐵) → (1st ‘(+∞ei‘𝐴)) = (1st ‘(+∞ei‘𝐵))) | |
| 3 | bj-inftyexpiinv 37911 | . . . . . . 7 ⊢ (𝐴 ∈ (-π(,]π) → (1st ‘(+∞ei‘𝐴)) = 𝐴) | |
| 4 | 3 | adantr 486 | . . . . . 6 ⊢ ((𝐴 ∈ (-π(,]π) ∧ 𝐵 ∈ (-π(,]π)) → (1st ‘(+∞ei‘𝐴)) = 𝐴) |
| 5 | 4 | eqeq1d 2767 | . . . . 5 ⊢ ((𝐴 ∈ (-π(,]π) ∧ 𝐵 ∈ (-π(,]π)) → ((1st ‘(+∞ei‘𝐴)) = (1st ‘(+∞ei‘𝐵)) ↔ 𝐴 = (1st ‘(+∞ei‘𝐵)))) |
| 6 | 5 | biimpd 232 | . . . 4 ⊢ ((𝐴 ∈ (-π(,]π) ∧ 𝐵 ∈ (-π(,]π)) → ((1st ‘(+∞ei‘𝐴)) = (1st ‘(+∞ei‘𝐵)) → 𝐴 = (1st ‘(+∞ei‘𝐵)))) |
| 7 | bj-inftyexpiinv 37911 | . . . . . 6 ⊢ (𝐵 ∈ (-π(,]π) → (1st ‘(+∞ei‘𝐵)) = 𝐵) | |
| 8 | 7 | adantl 487 | . . . . 5 ⊢ ((𝐴 ∈ (-π(,]π) ∧ 𝐵 ∈ (-π(,]π)) → (1st ‘(+∞ei‘𝐵)) = 𝐵) |
| 9 | 8 | eqeq2d 2776 | . . . 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 2146 ‘cfv 6540 (class class class)co 7419 1st c1st 7990 -cneg 11459 (,]cioc 13391 πcpi 16144 +∞eicinftyexpi 37909 |
| 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 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-sep 5259 ax-nul 5271 ax-pr 5406 ax-un 7742 ax-cnex 11173 |
| 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 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-ral 3082 df-rex 3092 df-rab 3419 df-v 3459 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4287 df-if 4490 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-br 5112 df-opab 5176 df-mpt 5195 df-id 5558 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-iota 6496 df-fun 6542 df-fv 6548 df-1st 7992 df-bj-inftyexpi 37910 |
| This theorem is used by: bj-pinftynminfty 37930 |
| Copyright terms: Public domain | W3C validator |