Theorem isrim0OLD 20481

Description: Obsolete version of isrim0 20483 as of 12-Jan-2025. (Contributed by AV, 22-Oct-2019.) (Proof modification is discouraged.) (New usage is discouraged.)

Assertion

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

Proof of Theorem isrim0OLD

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

Step	Hyp	Ref	Expression
1		df-rim 20473	. . . . 5 ⊢ RingIso = (𝑟 ∈ V, 𝑠 ∈ V ↦ {𝑓 ∈ (𝑟 RingHom 𝑠) ∣ ◡𝑓 ∈ (𝑠 RingHom 𝑟)})
2	1	a1i 11	. . . 4 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) → RingIso = (𝑟 ∈ V, 𝑠 ∈ V ↦ {𝑓 ∈ (𝑟 RingHom 𝑠) ∣ ◡𝑓 ∈ (𝑠 RingHom 𝑟)}))
3		oveq12 7440	. . . . . 6 ⊢ ((𝑟 = 𝑅 ∧ 𝑠 = 𝑆) → (𝑟 RingHom 𝑠) = (𝑅 RingHom 𝑆))
4	3	adantl 481	. . . . 5 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) ∧ (𝑟 = 𝑅 ∧ 𝑠 = 𝑆)) → (𝑟 RingHom 𝑠) = (𝑅 RingHom 𝑆))
5		oveq12 7440	. . . . . . . 8 ⊢ ((𝑠 = 𝑆 ∧ 𝑟 = 𝑅) → (𝑠 RingHom 𝑟) = (𝑆 RingHom 𝑅))
6	5	ancoms 458	. . . . . . 7 ⊢ ((𝑟 = 𝑅 ∧ 𝑠 = 𝑆) → (𝑠 RingHom 𝑟) = (𝑆 RingHom 𝑅))
7	6	adantl 481	. . . . . 6 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) ∧ (𝑟 = 𝑅 ∧ 𝑠 = 𝑆)) → (𝑠 RingHom 𝑟) = (𝑆 RingHom 𝑅))
8	7	eleq2d 2827	. . . . 5 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) ∧ (𝑟 = 𝑅 ∧ 𝑠 = 𝑆)) → (◡𝑓 ∈ (𝑠 RingHom 𝑟) ↔ ◡𝑓 ∈ (𝑆 RingHom 𝑅)))
9	4, 8	rabeqbidv 3455	. . . 4 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) ∧ (𝑟 = 𝑅 ∧ 𝑠 = 𝑆)) → {𝑓 ∈ (𝑟 RingHom 𝑠) ∣ ◡𝑓 ∈ (𝑠 RingHom 𝑟)} = {𝑓 ∈ (𝑅 RingHom 𝑆) ∣ ◡𝑓 ∈ (𝑆 RingHom 𝑅)})
10		elex 3501	. . . . 5 ⊢ (𝑅 ∈ 𝑉 → 𝑅 ∈ V)
11	10	adantr 480	. . . 4 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) → 𝑅 ∈ V)
12		elex 3501	. . . . 5 ⊢ (𝑆 ∈ 𝑊 → 𝑆 ∈ V)
13	12	adantl 481	. . . 4 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) → 𝑆 ∈ V)
14		ovex 7464	. . . . . 6 ⊢ (𝑅 RingHom 𝑆) ∈ V
15	14	rabex 5339	. . . . 5 ⊢ {𝑓 ∈ (𝑅 RingHom 𝑆) ∣ ◡𝑓 ∈ (𝑆 RingHom 𝑅)} ∈ V
16	15	a1i 11	. . . 4 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) → {𝑓 ∈ (𝑅 RingHom 𝑆) ∣ ◡𝑓 ∈ (𝑆 RingHom 𝑅)} ∈ V)
17	2, 9, 11, 13, 16	ovmpod 7585	. . 3 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) → (𝑅 RingIso 𝑆) = {𝑓 ∈ (𝑅 RingHom 𝑆) ∣ ◡𝑓 ∈ (𝑆 RingHom 𝑅)})
18	17	eleq2d 2827	. 2 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) → (𝐹 ∈ (𝑅 RingIso 𝑆) ↔ 𝐹 ∈ {𝑓 ∈ (𝑅 RingHom 𝑆) ∣ ◡𝑓 ∈ (𝑆 RingHom 𝑅)}))
19		cnveq 5884	. . . 4 ⊢ (𝑓 = 𝐹 → ◡𝑓 = ◡𝐹)
20	19	eleq1d 2826	. . 3 ⊢ (𝑓 = 𝐹 → (◡𝑓 ∈ (𝑆 RingHom 𝑅) ↔ ◡𝐹 ∈ (𝑆 RingHom 𝑅)))
21	20	elrab 3692	. 2 ⊢ (𝐹 ∈ {𝑓 ∈ (𝑅 RingHom 𝑆) ∣ ◡𝑓 ∈ (𝑆 RingHom 𝑅)} ↔ (𝐹 ∈ (𝑅 RingHom 𝑆) ∧ ◡𝐹 ∈ (𝑆 RingHom 𝑅)))
22	18, 21	bitrdi 287	1 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) → (𝐹 ∈ (𝑅 RingIso 𝑆) ↔ (𝐹 ∈ (𝑅 RingHom 𝑆) ∧ ◡𝐹 ∈ (𝑆 RingHom 𝑅))))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1540   ∈ wcel 2108  {crab 3436  Vcvv 3480  ^◡ccnv 5684  (class class class)co 7431   ∈ cmpo 7433   RingHom crh 20469   RingIso crs 20470

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 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2708  ax-sep 5296  ax-nul 5306  ax-pr 5432

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2540  df-eu 2569  df-clab 2715  df-cleq 2729  df-clel 2816  df-nfc 2892  df-ne 2941  df-ral 3062  df-rex 3071  df-rab 3437  df-v 3482  df-sbc 3789  df-dif 3954  df-un 3956  df-in 3958  df-ss 3968  df-nul 4334  df-if 4526  df-pw 4602  df-sn 4627  df-pr 4629  df-op 4633  df-uni 4908  df-br 5144  df-opab 5206  df-id 5578  df-xp 5691  df-rel 5692  df-cnv 5693  df-co 5694  df-dm 5695  df-iota 6514  df-fun 6563  df-fv 6569  df-ov 7434  df-oprab 7435  df-mpo 7436  df-rim 20473

This theorem is referenced by:  isrimOLD  20493