Users' Mathboxes Mathbox for BJ < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  bj-inftyexpiinj Structured version   Visualization version   GIF version

Theorem bj-inftyexpiinj 37232
Description: Injectivity of the parameterization +∞ei. Remark: a more conceptual proof would use bj-inftyexpiinv 37231 and the fact that a function with a retraction is injective. (Contributed by BJ, 22-Jun-2019.)
Assertion
Ref Expression
bj-inftyexpiinj ((𝐴 ∈ (-π(,]π) ∧ 𝐵 ∈ (-π(,]π)) → (𝐴 = 𝐵 ↔ (+∞ei𝐴) = (+∞ei𝐵)))

Proof of Theorem bj-inftyexpiinj
StepHypRef Expression
1 fveq2 6881 . 2 (𝐴 = 𝐵 → (+∞ei𝐴) = (+∞ei𝐵))
2 fveq2 6881 . . 3 ((+∞ei𝐴) = (+∞ei𝐵) → (1st ‘(+∞ei𝐴)) = (1st ‘(+∞ei𝐵)))
3 bj-inftyexpiinv 37231 . . . . . . 7 (𝐴 ∈ (-π(,]π) → (1st ‘(+∞ei𝐴)) = 𝐴)
43adantr 480 . . . . . 6 ((𝐴 ∈ (-π(,]π) ∧ 𝐵 ∈ (-π(,]π)) → (1st ‘(+∞ei𝐴)) = 𝐴)
54eqeq1d 2738 . . . . 5 ((𝐴 ∈ (-π(,]π) ∧ 𝐵 ∈ (-π(,]π)) → ((1st ‘(+∞ei𝐴)) = (1st ‘(+∞ei𝐵)) ↔ 𝐴 = (1st ‘(+∞ei𝐵))))
65biimpd 229 . . . 4 ((𝐴 ∈ (-π(,]π) ∧ 𝐵 ∈ (-π(,]π)) → ((1st ‘(+∞ei𝐴)) = (1st ‘(+∞ei𝐵)) → 𝐴 = (1st ‘(+∞ei𝐵))))
7 bj-inftyexpiinv 37231 . . . . . 6 (𝐵 ∈ (-π(,]π) → (1st ‘(+∞ei𝐵)) = 𝐵)
87adantl 481 . . . . 5 ((𝐴 ∈ (-π(,]π) ∧ 𝐵 ∈ (-π(,]π)) → (1st ‘(+∞ei𝐵)) = 𝐵)
98eqeq2d 2747 . . . 4 ((𝐴 ∈ (-π(,]π) ∧ 𝐵 ∈ (-π(,]π)) → (𝐴 = (1st ‘(+∞ei𝐵)) ↔ 𝐴 = 𝐵))
106, 9sylibd 239 . . 3 ((𝐴 ∈ (-π(,]π) ∧ 𝐵 ∈ (-π(,]π)) → ((1st ‘(+∞ei𝐴)) = (1st ‘(+∞ei𝐵)) → 𝐴 = 𝐵))
112, 10syl5 34 . 2 ((𝐴 ∈ (-π(,]π) ∧ 𝐵 ∈ (-π(,]π)) → ((+∞ei𝐴) = (+∞ei𝐵) → 𝐴 = 𝐵))
121, 11impbid2 226 1 ((𝐴 ∈ (-π(,]π) ∧ 𝐵 ∈ (-π(,]π)) → (𝐴 = 𝐵 ↔ (+∞ei𝐴) = (+∞ei𝐵)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1540  wcel 2109  cfv 6536  (class class class)co 7410  1st c1st 7991  -cneg 11472  (,]cioc 13368  πcpi 16087  +∞eicinftyexpi 37229
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2708  ax-sep 5271  ax-nul 5281  ax-pr 5407  ax-un 7734  ax-cnex 11190
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2540  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2810  df-nfc 2886  df-ral 3053  df-rex 3062  df-rab 3421  df-v 3466  df-dif 3934  df-un 3936  df-in 3938  df-ss 3948  df-nul 4314  df-if 4506  df-sn 4607  df-pr 4609  df-op 4613  df-uni 4889  df-br 5125  df-opab 5187  df-mpt 5207  df-id 5553  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-iota 6489  df-fun 6538  df-fv 6544  df-1st 7993  df-bj-inftyexpi 37230
This theorem is referenced by:  bj-pinftynminfty  37250
  Copyright terms: Public domain W3C validator