Theorem isrim0OLD 20498

Description: Obsolete version of isrim0 20500 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 20490	. . . . 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 2825	. . . . 5 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) ∧ (𝑟 = 𝑅 ∧ 𝑠 = 𝑆)) → (◡𝑓 ∈ (𝑠 RingHom 𝑟) ↔ ◡𝑓 ∈ (𝑆 RingHom 𝑅)))
9	4, 8	rabeqbidv 3452	. . . 4 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) ∧ (𝑟 = 𝑅 ∧ 𝑠 = 𝑆)) → {𝑓 ∈ (𝑟 RingHom 𝑠) ∣ ◡𝑓 ∈ (𝑠 RingHom 𝑟)} = {𝑓 ∈ (𝑅 RingHom 𝑆) ∣ ◡𝑓 ∈ (𝑆 RingHom 𝑅)})
10		elex 3499	. . . . 5 ⊢ (𝑅 ∈ 𝑉 → 𝑅 ∈ V)
11	10	adantr 480	. . . 4 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) → 𝑅 ∈ V)
12		elex 3499	. . . . 5 ⊢ (𝑆 ∈ 𝑊 → 𝑆 ∈ V)
13	12	adantl 481	. . . 4 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) → 𝑆 ∈ V)
14		ovex 7464	. . . . . 6 ⊢ (𝑅 RingHom 𝑆) ∈ V
15	14	rabex 5345	. . . . 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 2825	. 2 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) → (𝐹 ∈ (𝑅 RingIso 𝑆) ↔ 𝐹 ∈ {𝑓 ∈ (𝑅 RingHom 𝑆) ∣ ◡𝑓 ∈ (𝑆 RingHom 𝑅)}))
19		cnveq 5887	. . . 4 ⊢ (𝑓 = 𝐹 → ◡𝑓 = ◡𝐹)
20	19	eleq1d 2824	. . 3 ⊢ (𝑓 = 𝐹 → (◡𝑓 ∈ (𝑆 RingHom 𝑅) ↔ ◡𝐹 ∈ (𝑆 RingHom 𝑅)))
21	20	elrab 3695	. 2 ⊢ (𝐹 ∈ {𝑓 ∈ (𝑅 RingHom 𝑆) ∣ ◡𝑓 ∈ (𝑆 RingHom 𝑅)} ↔ (𝐹 ∈ (𝑅 RingHom 𝑆) ∧ ◡𝐹 ∈ (𝑆 RingHom 𝑅)))
22	18, 21	bitrdi 287	1 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) → (𝐹 ∈ (𝑅 RingIso 𝑆) ↔ (𝐹 ∈ (𝑅 RingHom 𝑆) ∧ ◡𝐹 ∈ (𝑆 RingHom 𝑅))))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1537   ∈ wcel 2106  {crab 3433  Vcvv 3478  ^◡ccnv 5688  (class class class)co 7431   ∈ cmpo 7433   RingHom crh 20486   RingIso crs 20487

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-ext 2706  ax-sep 5302  ax-nul 5312  ax-pr 5438

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-nf 1781  df-sb 2063  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2727  df-clel 2814  df-nfc 2890  df-ne 2939  df-ral 3060  df-rex 3069  df-rab 3434  df-v 3480  df-sbc 3792  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-nul 4340  df-if 4532  df-pw 4607  df-sn 4632  df-pr 4634  df-op 4638  df-uni 4913  df-br 5149  df-opab 5211  df-id 5583  df-xp 5695  df-rel 5696  df-cnv 5697  df-co 5698  df-dm 5699  df-iota 6516  df-fun 6565  df-fv 6571  df-ov 7434  df-oprab 7435  df-mpo 7436  df-rim 20490

This theorem is referenced by:  isrimOLD  20510