Theorem aprval 14320

Description: Expand Definition df-apr 14319. (Contributed by Jim Kingdon, 17-Feb-2025.)

Hypotheses

Ref	Expression
aprval.b	⊢ (𝜑 → 𝐵 = (Base‘𝑅))
aprval.ap	⊢ (𝜑 → # = (#r‘𝑅))
aprval.s	⊢ (𝜑 → − = (-g‘𝑅))
aprval.u	⊢ (𝜑 → 𝑈 = (Unit‘𝑅))
aprval.r	⊢ (𝜑 → 𝑅 ∈ Ring)
aprval.x	⊢ (𝜑 → 𝑋 ∈ 𝐵)
aprval.y	⊢ (𝜑 → 𝑌 ∈ 𝐵)

Assertion

Ref	Expression
aprval	⊢ (𝜑 → (𝑋 # 𝑌 ↔ (𝑋 − 𝑌) ∈ 𝑈))

Proof of Theorem aprval

Dummy variables 𝑟 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-br 4090	. . 3 ⊢ (𝑋 # 𝑌 ↔ ⟨𝑋, 𝑌⟩ ∈ # )
2		aprval.ap	. . . . . 6 ⊢ (𝜑 → # = (#r‘𝑅))
3		df-apr 14319	. . . . . . 7 ⊢ #r = (𝑟 ∈ V ↦ {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ (Base‘𝑟) ∧ 𝑦 ∈ (Base‘𝑟)) ∧ (𝑥(-g‘𝑟)𝑦) ∈ (Unit‘𝑟))})
4		fveq2 5642	. . . . . . . . . . 11 ⊢ (𝑟 = 𝑅 → (Base‘𝑟) = (Base‘𝑅))
5	4	eleq2d 2300	. . . . . . . . . 10 ⊢ (𝑟 = 𝑅 → (𝑥 ∈ (Base‘𝑟) ↔ 𝑥 ∈ (Base‘𝑅)))
6	4	eleq2d 2300	. . . . . . . . . 10 ⊢ (𝑟 = 𝑅 → (𝑦 ∈ (Base‘𝑟) ↔ 𝑦 ∈ (Base‘𝑅)))
7	5, 6	anbi12d 473	. . . . . . . . 9 ⊢ (𝑟 = 𝑅 → ((𝑥 ∈ (Base‘𝑟) ∧ 𝑦 ∈ (Base‘𝑟)) ↔ (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅))))
8		fveq2 5642	. . . . . . . . . . 11 ⊢ (𝑟 = 𝑅 → (-g‘𝑟) = (-g‘𝑅))
9	8	oveqd 6040	. . . . . . . . . 10 ⊢ (𝑟 = 𝑅 → (𝑥(-g‘𝑟)𝑦) = (𝑥(-g‘𝑅)𝑦))
10		fveq2 5642	. . . . . . . . . 10 ⊢ (𝑟 = 𝑅 → (Unit‘𝑟) = (Unit‘𝑅))
11	9, 10	eleq12d 2301	. . . . . . . . 9 ⊢ (𝑟 = 𝑅 → ((𝑥(-g‘𝑟)𝑦) ∈ (Unit‘𝑟) ↔ (𝑥(-g‘𝑅)𝑦) ∈ (Unit‘𝑅)))
12	7, 11	anbi12d 473	. . . . . . . 8 ⊢ (𝑟 = 𝑅 → (((𝑥 ∈ (Base‘𝑟) ∧ 𝑦 ∈ (Base‘𝑟)) ∧ (𝑥(-g‘𝑟)𝑦) ∈ (Unit‘𝑟)) ↔ ((𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅)) ∧ (𝑥(-g‘𝑅)𝑦) ∈ (Unit‘𝑅))))
13	12	opabbidv 4156	. . . . . . 7 ⊢ (𝑟 = 𝑅 → {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ (Base‘𝑟) ∧ 𝑦 ∈ (Base‘𝑟)) ∧ (𝑥(-g‘𝑟)𝑦) ∈ (Unit‘𝑟))} = {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅)) ∧ (𝑥(-g‘𝑅)𝑦) ∈ (Unit‘𝑅))})
14		aprval.r	. . . . . . . 8 ⊢ (𝜑 → 𝑅 ∈ Ring)
15	14	elexd 2815	. . . . . . 7 ⊢ (𝜑 → 𝑅 ∈ V)
16		basfn 13164	. . . . . . . . . 10 ⊢ Base Fn V
17		funfvex 5659	. . . . . . . . . . 11 ⊢ ((Fun Base ∧ 𝑅 ∈ dom Base) → (Base‘𝑅) ∈ V)
18	17	funfni 5434	. . . . . . . . . 10 ⊢ ((Base Fn V ∧ 𝑅 ∈ V) → (Base‘𝑅) ∈ V)
19	16, 15, 18	sylancr 414	. . . . . . . . 9 ⊢ (𝜑 → (Base‘𝑅) ∈ V)
20		xpexg 4842	. . . . . . . . 9 ⊢ (((Base‘𝑅) ∈ V ∧ (Base‘𝑅) ∈ V) → ((Base‘𝑅) × (Base‘𝑅)) ∈ V)
21	19, 19, 20	syl2anc 411	. . . . . . . 8 ⊢ (𝜑 → ((Base‘𝑅) × (Base‘𝑅)) ∈ V)
22		opabssxp 4802	. . . . . . . . 9 ⊢ {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅)) ∧ (𝑥(-g‘𝑅)𝑦) ∈ (Unit‘𝑅))} ⊆ ((Base‘𝑅) × (Base‘𝑅))
23	22	a1i 9	. . . . . . . 8 ⊢ (𝜑 → {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅)) ∧ (𝑥(-g‘𝑅)𝑦) ∈ (Unit‘𝑅))} ⊆ ((Base‘𝑅) × (Base‘𝑅)))
24	21, 23	ssexd 4230	. . . . . . 7 ⊢ (𝜑 → {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅)) ∧ (𝑥(-g‘𝑅)𝑦) ∈ (Unit‘𝑅))} ∈ V)
25	3, 13, 15, 24	fvmptd3 5743	. . . . . 6 ⊢ (𝜑 → (#r‘𝑅) = {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅)) ∧ (𝑥(-g‘𝑅)𝑦) ∈ (Unit‘𝑅))})
26	2, 25	eqtrd 2263	. . . . 5 ⊢ (𝜑 → # = {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅)) ∧ (𝑥(-g‘𝑅)𝑦) ∈ (Unit‘𝑅))})
27	26	eleq2d 2300	. . . 4 ⊢ (𝜑 → (⟨𝑋, 𝑌⟩ ∈ # ↔ ⟨𝑋, 𝑌⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅)) ∧ (𝑥(-g‘𝑅)𝑦) ∈ (Unit‘𝑅))}))
28		aprval.x	. . . . . 6 ⊢ (𝜑 → 𝑋 ∈ 𝐵)
29		aprval.b	. . . . . 6 ⊢ (𝜑 → 𝐵 = (Base‘𝑅))
30	28, 29	eleqtrd 2309	. . . . 5 ⊢ (𝜑 → 𝑋 ∈ (Base‘𝑅))
31		aprval.y	. . . . . 6 ⊢ (𝜑 → 𝑌 ∈ 𝐵)
32	31, 29	eleqtrd 2309	. . . . 5 ⊢ (𝜑 → 𝑌 ∈ (Base‘𝑅))
33		oveq12 6032	. . . . . . 7 ⊢ ((𝑥 = 𝑋 ∧ 𝑦 = 𝑌) → (𝑥(-g‘𝑅)𝑦) = (𝑋(-g‘𝑅)𝑌))
34	33	eleq1d 2299	. . . . . 6 ⊢ ((𝑥 = 𝑋 ∧ 𝑦 = 𝑌) → ((𝑥(-g‘𝑅)𝑦) ∈ (Unit‘𝑅) ↔ (𝑋(-g‘𝑅)𝑌) ∈ (Unit‘𝑅)))
35	34	opelopab2a 4361	. . . . 5 ⊢ ((𝑋 ∈ (Base‘𝑅) ∧ 𝑌 ∈ (Base‘𝑅)) → (⟨𝑋, 𝑌⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅)) ∧ (𝑥(-g‘𝑅)𝑦) ∈ (Unit‘𝑅))} ↔ (𝑋(-g‘𝑅)𝑌) ∈ (Unit‘𝑅)))
36	30, 32, 35	syl2anc 411	. . . 4 ⊢ (𝜑 → (⟨𝑋, 𝑌⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅)) ∧ (𝑥(-g‘𝑅)𝑦) ∈ (Unit‘𝑅))} ↔ (𝑋(-g‘𝑅)𝑌) ∈ (Unit‘𝑅)))
37	27, 36	bitrd 188	. . 3 ⊢ (𝜑 → (⟨𝑋, 𝑌⟩ ∈ # ↔ (𝑋(-g‘𝑅)𝑌) ∈ (Unit‘𝑅)))
38	1, 37	bitrid 192	. 2 ⊢ (𝜑 → (𝑋 # 𝑌 ↔ (𝑋(-g‘𝑅)𝑌) ∈ (Unit‘𝑅)))
39		aprval.s	. . . 4 ⊢ (𝜑 → − = (-g‘𝑅))
40	39	oveqd 6040	. . 3 ⊢ (𝜑 → (𝑋 − 𝑌) = (𝑋(-g‘𝑅)𝑌))
41		aprval.u	. . 3 ⊢ (𝜑 → 𝑈 = (Unit‘𝑅))
42	40, 41	eleq12d 2301	. 2 ⊢ (𝜑 → ((𝑋 − 𝑌) ∈ 𝑈 ↔ (𝑋(-g‘𝑅)𝑌) ∈ (Unit‘𝑅)))
43	38, 42	bitr4d 191	1 ⊢ (𝜑 → (𝑋 # 𝑌 ↔ (𝑋 − 𝑌) ∈ 𝑈))

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1397   ∈ wcel 2201  Vcvv 2801   ⊆ wss 3199  ⟨cop 3673   class class class wbr 4089  {copab 4150   × cxp 4725   Fn wfn 5323  ‘cfv 5328  (class class class)co 6023  Basecbs 13105  -_gcsg 13608  Ringcrg 14033  Unitcui 14124  #_rcapr 14318

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2203  ax-14 2204  ax-ext 2212  ax-sep 4208  ax-pow 4266  ax-pr 4301  ax-un 4532  ax-cnex 8128  ax-resscn 8129  ax-1re 8131  ax-addrcl 8134

This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1810  df-eu 2081  df-mo 2082  df-clab 2217  df-cleq 2223  df-clel 2226  df-nfc 2362  df-ral 2514  df-rex 2515  df-v 2803  df-sbc 3031  df-csb 3127  df-un 3203  df-in 3205  df-ss 3212  df-pw 3655  df-sn 3676  df-pr 3677  df-op 3679  df-uni 3895  df-int 3930  df-br 4090  df-opab 4152  df-mpt 4153  df-id 4392  df-xp 4733  df-rel 4734  df-cnv 4735  df-co 4736  df-dm 4737  df-rn 4738  df-res 4739  df-iota 5288  df-fun 5330  df-fn 5331  df-fv 5336  df-ov 6026  df-inn 9149  df-ndx 13108  df-slot 13109  df-base 13111  df-apr 14319

This theorem is referenced by:  aprirr  14321  aprsym  14322  aprcotr  14323