Theorem isrim0 19967

Description: An isomorphism of rings is a homomorphism whose converse is also a homomorphism . (Contributed by AV, 22-Oct-2019.)

Assertion

Ref	Expression
isrim0	⊢ ((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) → (𝐹 ∈ (𝑅 RingIso 𝑆) ↔ (𝐹 ∈ (𝑅 RingHom 𝑆) ∧ ◡𝐹 ∈ (𝑆 RingHom 𝑅))))

Proof of Theorem isrim0

Dummy variables 𝑓 𝑟 𝑠 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-rngiso 19960	. . . . 5 ⊢ RingIso = (𝑟 ∈ V, 𝑠 ∈ V ↦ {𝑓 ∈ (𝑟 RingHom 𝑠) ∣ ◡𝑓 ∈ (𝑠 RingHom 𝑟)})
2	1	a1i 11	. . . 4 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) → RingIso = (𝑟 ∈ V, 𝑠 ∈ V ↦ {𝑓 ∈ (𝑟 RingHom 𝑠) ∣ ◡𝑓 ∈ (𝑠 RingHom 𝑟)}))
3		oveq12 7284	. . . . . 6 ⊢ ((𝑟 = 𝑅 ∧ 𝑠 = 𝑆) → (𝑟 RingHom 𝑠) = (𝑅 RingHom 𝑆))
4	3	adantl 482	. . . . 5 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) ∧ (𝑟 = 𝑅 ∧ 𝑠 = 𝑆)) → (𝑟 RingHom 𝑠) = (𝑅 RingHom 𝑆))
5		oveq12 7284	. . . . . . . 8 ⊢ ((𝑠 = 𝑆 ∧ 𝑟 = 𝑅) → (𝑠 RingHom 𝑟) = (𝑆 RingHom 𝑅))
6	5	ancoms 459	. . . . . . 7 ⊢ ((𝑟 = 𝑅 ∧ 𝑠 = 𝑆) → (𝑠 RingHom 𝑟) = (𝑆 RingHom 𝑅))
7	6	adantl 482	. . . . . 6 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) ∧ (𝑟 = 𝑅 ∧ 𝑠 = 𝑆)) → (𝑠 RingHom 𝑟) = (𝑆 RingHom 𝑅))
8	7	eleq2d 2824	. . . . 5 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) ∧ (𝑟 = 𝑅 ∧ 𝑠 = 𝑆)) → (◡𝑓 ∈ (𝑠 RingHom 𝑟) ↔ ◡𝑓 ∈ (𝑆 RingHom 𝑅)))
9	4, 8	rabeqbidv 3420	. . . 4 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) ∧ (𝑟 = 𝑅 ∧ 𝑠 = 𝑆)) → {𝑓 ∈ (𝑟 RingHom 𝑠) ∣ ◡𝑓 ∈ (𝑠 RingHom 𝑟)} = {𝑓 ∈ (𝑅 RingHom 𝑆) ∣ ◡𝑓 ∈ (𝑆 RingHom 𝑅)})
10		elex 3450	. . . . 5 ⊢ (𝑅 ∈ 𝑉 → 𝑅 ∈ V)
11	10	adantr 481	. . . 4 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) → 𝑅 ∈ V)
12		elex 3450	. . . . 5 ⊢ (𝑆 ∈ 𝑊 → 𝑆 ∈ V)
13	12	adantl 482	. . . 4 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) → 𝑆 ∈ V)
14		ovex 7308	. . . . . 6 ⊢ (𝑅 RingHom 𝑆) ∈ V
15	14	rabex 5256	. . . . 5 ⊢ {𝑓 ∈ (𝑅 RingHom 𝑆) ∣ ◡𝑓 ∈ (𝑆 RingHom 𝑅)} ∈ V
16	15	a1i 11	. . . 4 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) → {𝑓 ∈ (𝑅 RingHom 𝑆) ∣ ◡𝑓 ∈ (𝑆 RingHom 𝑅)} ∈ V)
17	2, 9, 11, 13, 16	ovmpod 7425	. . 3 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) → (𝑅 RingIso 𝑆) = {𝑓 ∈ (𝑅 RingHom 𝑆) ∣ ◡𝑓 ∈ (𝑆 RingHom 𝑅)})
18	17	eleq2d 2824	. 2 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) → (𝐹 ∈ (𝑅 RingIso 𝑆) ↔ 𝐹 ∈ {𝑓 ∈ (𝑅 RingHom 𝑆) ∣ ◡𝑓 ∈ (𝑆 RingHom 𝑅)}))
19		cnveq 5782	. . . 4 ⊢ (𝑓 = 𝐹 → ◡𝑓 = ◡𝐹)
20	19	eleq1d 2823	. . 3 ⊢ (𝑓 = 𝐹 → (◡𝑓 ∈ (𝑆 RingHom 𝑅) ↔ ◡𝐹 ∈ (𝑆 RingHom 𝑅)))
21	20	elrab 3624	. 2 ⊢ (𝐹 ∈ {𝑓 ∈ (𝑅 RingHom 𝑆) ∣ ◡𝑓 ∈ (𝑆 RingHom 𝑅)} ↔ (𝐹 ∈ (𝑅 RingHom 𝑆) ∧ ◡𝐹 ∈ (𝑆 RingHom 𝑅)))
22	18, 21	bitrdi 287	1 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) → (𝐹 ∈ (𝑅 RingIso 𝑆) ↔ (𝐹 ∈ (𝑅 RingHom 𝑆) ∧ ◡𝐹 ∈ (𝑆 RingHom 𝑅))))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 396   = wceq 1539   ∈ wcel 2106  {crab 3068  Vcvv 3432  ^◡ccnv 5588  (class class class)co 7275   ∈ cmpo 7277   RingHom crh 19956   RingIso crs 19957

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-sep 5223  ax-nul 5230  ax-pr 5352

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ral 3069  df-rex 3070  df-rab 3073  df-v 3434  df-sbc 3717  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-nul 4257  df-if 4460  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-br 5075  df-opab 5137  df-id 5489  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-iota 6391  df-fun 6435  df-fv 6441  df-ov 7278  df-oprab 7279  df-mpo 7280  df-rngiso 19960

This theorem is referenced by:  isrim  19977  brric2  19989  ringcinv  45590  ringcinvALTV  45614