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 36688
Description: Injectivity of the parameterization +∞ei. Remark: a more conceptual proof would use bj-inftyexpiinv 36687 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 6897 . 2 (𝐴 = 𝐵 → (+∞ei𝐴) = (+∞ei𝐵))
2 fveq2 6897 . . 3 ((+∞ei𝐴) = (+∞ei𝐵) → (1st ‘(+∞ei𝐴)) = (1st ‘(+∞ei𝐵)))
3 bj-inftyexpiinv 36687 . . . . . . 7 (𝐴 ∈ (-π(,]π) → (1st ‘(+∞ei𝐴)) = 𝐴)
43adantr 480 . . . . . 6 ((𝐴 ∈ (-π(,]π) ∧ 𝐵 ∈ (-π(,]π)) → (1st ‘(+∞ei𝐴)) = 𝐴)
54eqeq1d 2730 . . . . 5 ((𝐴 ∈ (-π(,]π) ∧ 𝐵 ∈ (-π(,]π)) → ((1st ‘(+∞ei𝐴)) = (1st ‘(+∞ei𝐵)) ↔ 𝐴 = (1st ‘(+∞ei𝐵))))
65biimpd 228 . . . 4 ((𝐴 ∈ (-π(,]π) ∧ 𝐵 ∈ (-π(,]π)) → ((1st ‘(+∞ei𝐴)) = (1st ‘(+∞ei𝐵)) → 𝐴 = (1st ‘(+∞ei𝐵))))
7 bj-inftyexpiinv 36687 . . . . . 6 (𝐵 ∈ (-π(,]π) → (1st ‘(+∞ei𝐵)) = 𝐵)
87adantl 481 . . . . 5 ((𝐴 ∈ (-π(,]π) ∧ 𝐵 ∈ (-π(,]π)) → (1st ‘(+∞ei𝐵)) = 𝐵)
98eqeq2d 2739 . . . 4 ((𝐴 ∈ (-π(,]π) ∧ 𝐵 ∈ (-π(,]π)) → (𝐴 = (1st ‘(+∞ei𝐵)) ↔ 𝐴 = 𝐵))
106, 9sylibd 238 . . 3 ((𝐴 ∈ (-π(,]π) ∧ 𝐵 ∈ (-π(,]π)) → ((1st ‘(+∞ei𝐴)) = (1st ‘(+∞ei𝐵)) → 𝐴 = 𝐵))
112, 10syl5 34 . 2 ((𝐴 ∈ (-π(,]π) ∧ 𝐵 ∈ (-π(,]π)) → ((+∞ei𝐴) = (+∞ei𝐵) → 𝐴 = 𝐵))
121, 11impbid2 225 1 ((𝐴 ∈ (-π(,]π) ∧ 𝐵 ∈ (-π(,]π)) → (𝐴 = 𝐵 ↔ (+∞ei𝐴) = (+∞ei𝐵)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 395   = wceq 1534  wcel 2099  cfv 6548  (class class class)co 7420  1st c1st 7991  -cneg 11476  (,]cioc 13358  πcpi 16043  +∞eicinftyexpi 36685
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1906  ax-6 1964  ax-7 2004  ax-8 2101  ax-9 2109  ax-10 2130  ax-11 2147  ax-12 2167  ax-ext 2699  ax-sep 5299  ax-nul 5306  ax-pr 5429  ax-un 7740  ax-cnex 11195
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 847  df-3an 1087  df-tru 1537  df-fal 1547  df-ex 1775  df-nf 1779  df-sb 2061  df-mo 2530  df-eu 2559  df-clab 2706  df-cleq 2720  df-clel 2806  df-nfc 2881  df-ral 3059  df-rex 3068  df-rab 3430  df-v 3473  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-nul 4324  df-if 4530  df-sn 4630  df-pr 4632  df-op 4636  df-uni 4909  df-br 5149  df-opab 5211  df-mpt 5232  df-id 5576  df-xp 5684  df-rel 5685  df-cnv 5686  df-co 5687  df-dm 5688  df-rn 5689  df-iota 6500  df-fun 6550  df-fv 6556  df-1st 7993  df-bj-inftyexpi 36686
This theorem is referenced by:  bj-pinftynminfty  36706
  Copyright terms: Public domain W3C validator