Users' Mathboxes Mathbox for Jeff Madsen < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  rngoisoval Structured version   Visualization version   GIF version

Theorem rngoisoval 33429
Description: The set of ring isomorphisms. (Contributed by Jeff Madsen, 16-Jun-2011.)
Hypotheses
Ref Expression
rngisoval.1 𝐺 = (1st𝑅)
rngisoval.2 𝑋 = ran 𝐺
rngisoval.3 𝐽 = (1st𝑆)
rngisoval.4 𝑌 = ran 𝐽
Assertion
Ref Expression
rngoisoval ((𝑅 ∈ RingOps ∧ 𝑆 ∈ RingOps) → (𝑅 RngIso 𝑆) = {𝑓 ∈ (𝑅 RngHom 𝑆) ∣ 𝑓:𝑋1-1-onto𝑌})
Distinct variable groups:   𝑅,𝑓   𝑆,𝑓   𝑓,𝑋   𝑓,𝑌
Allowed substitution hints:   𝐺(𝑓)   𝐽(𝑓)

Proof of Theorem rngoisoval
Dummy variables 𝑟 𝑠 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 oveq12 6616 . . 3 ((𝑟 = 𝑅𝑠 = 𝑆) → (𝑟 RngHom 𝑠) = (𝑅 RngHom 𝑆))
2 fveq2 6150 . . . . . . . 8 (𝑟 = 𝑅 → (1st𝑟) = (1st𝑅))
3 rngisoval.1 . . . . . . . 8 𝐺 = (1st𝑅)
42, 3syl6eqr 2673 . . . . . . 7 (𝑟 = 𝑅 → (1st𝑟) = 𝐺)
54rneqd 5315 . . . . . 6 (𝑟 = 𝑅 → ran (1st𝑟) = ran 𝐺)
6 rngisoval.2 . . . . . 6 𝑋 = ran 𝐺
75, 6syl6eqr 2673 . . . . 5 (𝑟 = 𝑅 → ran (1st𝑟) = 𝑋)
8 f1oeq2 6087 . . . . 5 (ran (1st𝑟) = 𝑋 → (𝑓:ran (1st𝑟)–1-1-onto→ran (1st𝑠) ↔ 𝑓:𝑋1-1-onto→ran (1st𝑠)))
97, 8syl 17 . . . 4 (𝑟 = 𝑅 → (𝑓:ran (1st𝑟)–1-1-onto→ran (1st𝑠) ↔ 𝑓:𝑋1-1-onto→ran (1st𝑠)))
10 fveq2 6150 . . . . . . . 8 (𝑠 = 𝑆 → (1st𝑠) = (1st𝑆))
11 rngisoval.3 . . . . . . . 8 𝐽 = (1st𝑆)
1210, 11syl6eqr 2673 . . . . . . 7 (𝑠 = 𝑆 → (1st𝑠) = 𝐽)
1312rneqd 5315 . . . . . 6 (𝑠 = 𝑆 → ran (1st𝑠) = ran 𝐽)
14 rngisoval.4 . . . . . 6 𝑌 = ran 𝐽
1513, 14syl6eqr 2673 . . . . 5 (𝑠 = 𝑆 → ran (1st𝑠) = 𝑌)
16 f1oeq3 6088 . . . . 5 (ran (1st𝑠) = 𝑌 → (𝑓:𝑋1-1-onto→ran (1st𝑠) ↔ 𝑓:𝑋1-1-onto𝑌))
1715, 16syl 17 . . . 4 (𝑠 = 𝑆 → (𝑓:𝑋1-1-onto→ran (1st𝑠) ↔ 𝑓:𝑋1-1-onto𝑌))
189, 17sylan9bb 735 . . 3 ((𝑟 = 𝑅𝑠 = 𝑆) → (𝑓:ran (1st𝑟)–1-1-onto→ran (1st𝑠) ↔ 𝑓:𝑋1-1-onto𝑌))
191, 18rabeqbidv 3181 . 2 ((𝑟 = 𝑅𝑠 = 𝑆) → {𝑓 ∈ (𝑟 RngHom 𝑠) ∣ 𝑓:ran (1st𝑟)–1-1-onto→ran (1st𝑠)} = {𝑓 ∈ (𝑅 RngHom 𝑆) ∣ 𝑓:𝑋1-1-onto𝑌})
20 df-rngoiso 33428 . 2 RngIso = (𝑟 ∈ RingOps, 𝑠 ∈ RingOps ↦ {𝑓 ∈ (𝑟 RngHom 𝑠) ∣ 𝑓:ran (1st𝑟)–1-1-onto→ran (1st𝑠)})
21 ovex 6635 . . 3 (𝑅 RngHom 𝑆) ∈ V
2221rabex 4775 . 2 {𝑓 ∈ (𝑅 RngHom 𝑆) ∣ 𝑓:𝑋1-1-onto𝑌} ∈ V
2319, 20, 22ovmpt2a 6747 1 ((𝑅 ∈ RingOps ∧ 𝑆 ∈ RingOps) → (𝑅 RngIso 𝑆) = {𝑓 ∈ (𝑅 RngHom 𝑆) ∣ 𝑓:𝑋1-1-onto𝑌})
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 196  wa 384   = wceq 1480  wcel 1987  {crab 2911  ran crn 5077  1-1-ontowf1o 5848  cfv 5849  (class class class)co 6607  1st c1st 7114  RingOpscrngo 33346   RngHom crnghom 33412   RngIso crngiso 33413
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1719  ax-4 1734  ax-5 1836  ax-6 1885  ax-7 1932  ax-9 1996  ax-10 2016  ax-11 2031  ax-12 2044  ax-13 2245  ax-ext 2601  ax-sep 4743  ax-nul 4751  ax-pr 4869
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1038  df-tru 1483  df-ex 1702  df-nf 1707  df-sb 1878  df-eu 2473  df-mo 2474  df-clab 2608  df-cleq 2614  df-clel 2617  df-nfc 2750  df-ral 2912  df-rex 2913  df-rab 2916  df-v 3188  df-sbc 3419  df-dif 3559  df-un 3561  df-in 3563  df-ss 3570  df-nul 3894  df-if 4061  df-sn 4151  df-pr 4153  df-op 4157  df-uni 4405  df-br 4616  df-opab 4676  df-id 4991  df-xp 5082  df-rel 5083  df-cnv 5084  df-co 5085  df-dm 5086  df-rn 5087  df-iota 5812  df-fun 5851  df-fn 5852  df-f 5853  df-f1 5854  df-fo 5855  df-f1o 5856  df-fv 5857  df-ov 6610  df-oprab 6611  df-mpt2 6612  df-rngoiso 33428
This theorem is referenced by:  isrngoiso  33430
  Copyright terms: Public domain W3C validator