Theorem isrim0 19477

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 19470	. . . . 5 ⊢ RingIso = (𝑟 ∈ V, 𝑠 ∈ V ↦ {𝑓 ∈ (𝑟 RingHom 𝑠) ∣ ◡𝑓 ∈ (𝑠 RingHom 𝑟)})
2	1	a1i 11	. . . 4 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) → RingIso = (𝑟 ∈ V, 𝑠 ∈ V ↦ {𝑓 ∈ (𝑟 RingHom 𝑠) ∣ ◡𝑓 ∈ (𝑠 RingHom 𝑟)}))
3		oveq12 7167	. . . . . 6 ⊢ ((𝑟 = 𝑅 ∧ 𝑠 = 𝑆) → (𝑟 RingHom 𝑠) = (𝑅 RingHom 𝑆))
4	3	adantl 484	. . . . 5 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) ∧ (𝑟 = 𝑅 ∧ 𝑠 = 𝑆)) → (𝑟 RingHom 𝑠) = (𝑅 RingHom 𝑆))
5		oveq12 7167	. . . . . . . 8 ⊢ ((𝑠 = 𝑆 ∧ 𝑟 = 𝑅) → (𝑠 RingHom 𝑟) = (𝑆 RingHom 𝑅))
6	5	ancoms 461	. . . . . . 7 ⊢ ((𝑟 = 𝑅 ∧ 𝑠 = 𝑆) → (𝑠 RingHom 𝑟) = (𝑆 RingHom 𝑅))
7	6	adantl 484	. . . . . 6 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) ∧ (𝑟 = 𝑅 ∧ 𝑠 = 𝑆)) → (𝑠 RingHom 𝑟) = (𝑆 RingHom 𝑅))
8	7	eleq2d 2900	. . . . 5 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) ∧ (𝑟 = 𝑅 ∧ 𝑠 = 𝑆)) → (◡𝑓 ∈ (𝑠 RingHom 𝑟) ↔ ◡𝑓 ∈ (𝑆 RingHom 𝑅)))
9	4, 8	rabeqbidv 3487	. . . 4 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) ∧ (𝑟 = 𝑅 ∧ 𝑠 = 𝑆)) → {𝑓 ∈ (𝑟 RingHom 𝑠) ∣ ◡𝑓 ∈ (𝑠 RingHom 𝑟)} = {𝑓 ∈ (𝑅 RingHom 𝑆) ∣ ◡𝑓 ∈ (𝑆 RingHom 𝑅)})
10		elex 3514	. . . . 5 ⊢ (𝑅 ∈ 𝑉 → 𝑅 ∈ V)
11	10	adantr 483	. . . 4 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) → 𝑅 ∈ V)
12		elex 3514	. . . . 5 ⊢ (𝑆 ∈ 𝑊 → 𝑆 ∈ V)
13	12	adantl 484	. . . 4 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) → 𝑆 ∈ V)
14		ovex 7191	. . . . . 6 ⊢ (𝑅 RingHom 𝑆) ∈ V
15	14	rabex 5237	. . . . 5 ⊢ {𝑓 ∈ (𝑅 RingHom 𝑆) ∣ ◡𝑓 ∈ (𝑆 RingHom 𝑅)} ∈ V
16	15	a1i 11	. . . 4 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) → {𝑓 ∈ (𝑅 RingHom 𝑆) ∣ ◡𝑓 ∈ (𝑆 RingHom 𝑅)} ∈ V)
17	2, 9, 11, 13, 16	ovmpod 7304	. . 3 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) → (𝑅 RingIso 𝑆) = {𝑓 ∈ (𝑅 RingHom 𝑆) ∣ ◡𝑓 ∈ (𝑆 RingHom 𝑅)})
18	17	eleq2d 2900	. 2 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) → (𝐹 ∈ (𝑅 RingIso 𝑆) ↔ 𝐹 ∈ {𝑓 ∈ (𝑅 RingHom 𝑆) ∣ ◡𝑓 ∈ (𝑆 RingHom 𝑅)}))
19		cnveq 5746	. . . 4 ⊢ (𝑓 = 𝐹 → ◡𝑓 = ◡𝐹)
20	19	eleq1d 2899	. . 3 ⊢ (𝑓 = 𝐹 → (◡𝑓 ∈ (𝑆 RingHom 𝑅) ↔ ◡𝐹 ∈ (𝑆 RingHom 𝑅)))
21	20	elrab 3682	. 2 ⊢ (𝐹 ∈ {𝑓 ∈ (𝑅 RingHom 𝑆) ∣ ◡𝑓 ∈ (𝑆 RingHom 𝑅)} ↔ (𝐹 ∈ (𝑅 RingHom 𝑆) ∧ ◡𝐹 ∈ (𝑆 RingHom 𝑅)))
22	18, 21	syl6bb 289	1 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) → (𝐹 ∈ (𝑅 RingIso 𝑆) ↔ (𝐹 ∈ (𝑅 RingHom 𝑆) ∧ ◡𝐹 ∈ (𝑆 RingHom 𝑅))))

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 398   = wceq 1537   ∈ wcel 2114  {crab 3144  Vcvv 3496  ^◡ccnv 5556  (class class class)co 7158   ∈ cmpo 7160   RingHom crh 19466   RingIso crs 19467

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2795  ax-sep 5205  ax-nul 5212  ax-pr 5332

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2802  df-cleq 2816  df-clel 2895  df-nfc 2965  df-ral 3145  df-rex 3146  df-rab 3149  df-v 3498  df-sbc 3775  df-dif 3941  df-un 3943  df-in 3945  df-ss 3954  df-nul 4294  df-if 4470  df-sn 4570  df-pr 4572  df-op 4576  df-uni 4841  df-br 5069  df-opab 5131  df-id 5462  df-xp 5563  df-rel 5564  df-cnv 5565  df-co 5566  df-dm 5567  df-iota 6316  df-fun 6359  df-fv 6365  df-ov 7161  df-oprab 7162  df-mpo 7163  df-rngiso 19470

This theorem is referenced by:  isrim  19487  brric2  19502  ringcinv  44310  ringcinvALTV  44334