pzriprnglem10 - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > pzriprnglem10		Structured version Visualization version GIF version

Theorem pzriprnglem10 21695

Description: Lemma 10 for pzriprng 21702: The equivalence classes of 𝑅 modulo 𝐽. (Contributed by AV, 22-Mar-2025.)

**Hypotheses**
Ref	Expression
pzriprng.r	⊢ 𝑅 = (ℤ_ring ×_s ℤ_ring)
pzriprng.i	⊢ 𝐼 = (ℤ × {0})
pzriprng.j	⊢ 𝐽 = (𝑅 ↾_s 𝐼)
pzriprng.1	⊢ 1 = (1_r‘𝐽)
pzriprng.g	⊢ ∼ = (𝑅 ~_QG 𝐼)

**Assertion**
Ref	Expression
pzriprnglem10	⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → [⟨𝑋, 𝑌⟩] ∼ = (ℤ × {𝑌}))

Proof of Theorem pzriprnglem10 Dummy variables 𝑥 𝑦 𝑎 𝑏 𝑐 𝑒 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		pzriprng.r	. . . . 5 ⊢ 𝑅 = (ℤ_ring ×_s ℤ_ring)
2	1	pzriprnglem1 21686	. . . 4 ⊢ 𝑅 ∈ Rng
3		rnggrp 20285	. . . 4 ⊢ (𝑅 ∈ Rng → 𝑅 ∈ Grp)
4	2, 3	ax-mp 5	. . 3 ⊢ 𝑅 ∈ Grp
5		pzriprng.i	. . . . 5 ⊢ 𝐼 = (ℤ × {0})
6		0z 12622	. . . . . 6 ⊢ 0 ∈ ℤ
7		snssi 4753	. . . . . 6 ⊢ (0 ∈ ℤ → {0} ⊆ ℤ)
8		xpss2 5683	. . . . . 6 ⊢ ({0} ⊆ ℤ → (ℤ × {0}) ⊆ (ℤ × ℤ))
9	6, 7, 8	mp2b 10	. . . . 5 ⊢ (ℤ × {0}) ⊆ (ℤ × ℤ)
10	5, 9	eqsstri 3984	. . . 4 ⊢ 𝐼 ⊆ (ℤ × ℤ)
11	10	a1i 11	. . 3 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → 𝐼 ⊆ (ℤ × ℤ))
12		opelxpi 5700	. . 3 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → ⟨𝑋, 𝑌⟩ ∈ (ℤ × ℤ))
13	1	pzriprnglem2 21687	. . . . 5 ⊢ (Base‘𝑅) = (ℤ × ℤ)
14	13	eqcomi 2774	. . . 4 ⊢ (ℤ × ℤ) = (Base‘𝑅)
15		pzriprng.g	. . . 4 ⊢ ∼ = (𝑅 ~_QG 𝐼)
16		eqid 2765	. . . 4 ⊢ (+_g‘𝑅) = (+_g‘𝑅)
17	14, 15, 16	eqglact 19296	. . 3 ⊢ ((𝑅 ∈ Grp ∧ 𝐼 ⊆ (ℤ × ℤ) ∧ ⟨𝑋, 𝑌⟩ ∈ (ℤ × ℤ)) → [⟨𝑋, 𝑌⟩] ∼ = ((𝑥 ∈ (ℤ × ℤ) ↦ (⟨𝑋, 𝑌⟩(+_g‘𝑅)𝑥)) “ 𝐼))
18	4, 11, 12, 17	mp3an2i 1495	. 2 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → [⟨𝑋, 𝑌⟩] ∼ = ((𝑥 ∈ (ℤ × ℤ) ↦ (⟨𝑋, 𝑌⟩(+_g‘𝑅)𝑥)) “ 𝐼))
19	11	mptimass 6077	. 2 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → ((𝑥 ∈ (ℤ × ℤ) ↦ (⟨𝑋, 𝑌⟩(+_g‘𝑅)𝑥)) “ 𝐼) = ran (𝑥 ∈ 𝐼 ↦ (⟨𝑋, 𝑌⟩(+_g‘𝑅)𝑥)))
20		eqid 2765	. . . . 5 ⊢ (𝑥 ∈ 𝐼 ↦ (⟨𝑋, 𝑌⟩(+_g‘𝑅)𝑥)) = (𝑥 ∈ 𝐼 ↦ (⟨𝑋, 𝑌⟩(+_g‘𝑅)𝑥))
21	20	rnmpt 5949	. . . 4 ⊢ ran (𝑥 ∈ 𝐼 ↦ (⟨𝑋, 𝑌⟩(+_g‘𝑅)𝑥)) = {𝑒 ∣ ∃𝑥 ∈ 𝐼 𝑒 = (⟨𝑋, 𝑌⟩(+_g‘𝑅)𝑥)}
22	21	a1i 11	. . 3 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → ran (𝑥 ∈ 𝐼 ↦ (⟨𝑋, 𝑌⟩(+_g‘𝑅)𝑥)) = {𝑒 ∣ ∃𝑥 ∈ 𝐼 𝑒 = (⟨𝑋, 𝑌⟩(+_g‘𝑅)𝑥)})
23	5	rexeqi 3324	. . . . . 6 ⊢ (∃𝑥 ∈ 𝐼 𝑒 = (⟨𝑋, 𝑌⟩(+_g‘𝑅)𝑥) ↔ ∃𝑥 ∈ (ℤ × {0})𝑒 = (⟨𝑋, 𝑌⟩(+_g‘𝑅)𝑥))
24		oveq2 7428	. . . . . . . 8 ⊢ (𝑥 = ⟨𝑎, 𝑏⟩ → (⟨𝑋, 𝑌⟩(+_g‘𝑅)𝑥) = (⟨𝑋, 𝑌⟩(+_g‘𝑅)⟨𝑎, 𝑏⟩))
25	24	eqeq2d 2776	. . . . . . 7 ⊢ (𝑥 = ⟨𝑎, 𝑏⟩ → (𝑒 = (⟨𝑋, 𝑌⟩(+_g‘𝑅)𝑥) ↔ 𝑒 = (⟨𝑋, 𝑌⟩(+_g‘𝑅)⟨𝑎, 𝑏⟩)))
26	25	rexxp 5830	. . . . . 6 ⊢ (∃𝑥 ∈ (ℤ × {0})𝑒 = (⟨𝑋, 𝑌⟩(+_g‘𝑅)𝑥) ↔ ∃𝑎 ∈ ℤ ∃𝑏 ∈ {0}𝑒 = (⟨𝑋, 𝑌⟩(+_g‘𝑅)⟨𝑎, 𝑏⟩))
27	23, 26	bitri 278	. . . . 5 ⊢ (∃𝑥 ∈ 𝐼 𝑒 = (⟨𝑋, 𝑌⟩(+_g‘𝑅)𝑥) ↔ ∃𝑎 ∈ ℤ ∃𝑏 ∈ {0}𝑒 = (⟨𝑋, 𝑌⟩(+_g‘𝑅)⟨𝑎, 𝑏⟩))
28	27	a1i 11	. . . 4 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → (∃𝑥 ∈ 𝐼 𝑒 = (⟨𝑋, 𝑌⟩(+_g‘𝑅)𝑥) ↔ ∃𝑎 ∈ ℤ ∃𝑏 ∈ {0}𝑒 = (⟨𝑋, 𝑌⟩(+_g‘𝑅)⟨𝑎, 𝑏⟩)))
29	28	abbidv 2831	. . 3 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → {𝑒 ∣ ∃𝑥 ∈ 𝐼 𝑒 = (⟨𝑋, 𝑌⟩(+_g‘𝑅)𝑥)} = {𝑒 ∣ ∃𝑎 ∈ ℤ ∃𝑏 ∈ {0}𝑒 = (⟨𝑋, 𝑌⟩(+_g‘𝑅)⟨𝑎, 𝑏⟩)})
30		c0ex 11220	. . . . . . . 8 ⊢ 0 ∈ V
31		opeq2 4841	. . . . . . . . . 10 ⊢ (𝑏 = 0 → ⟨𝑎, 𝑏⟩ = ⟨𝑎, 0⟩)
32	31	oveq2d 7436	. . . . . . . . 9 ⊢ (𝑏 = 0 → (⟨𝑋, 𝑌⟩(+_g‘𝑅)⟨𝑎, 𝑏⟩) = (⟨𝑋, 𝑌⟩(+_g‘𝑅)⟨𝑎, 0⟩))
33	32	eqeq2d 2776	. . . . . . . 8 ⊢ (𝑏 = 0 → (𝑒 = (⟨𝑋, 𝑌⟩(+_g‘𝑅)⟨𝑎, 𝑏⟩) ↔ 𝑒 = (⟨𝑋, 𝑌⟩(+_g‘𝑅)⟨𝑎, 0⟩)))
34	30, 33	rexsn 4650	. . . . . . 7 ⊢ (∃𝑏 ∈ {0}𝑒 = (⟨𝑋, 𝑌⟩(+_g‘𝑅)⟨𝑎, 𝑏⟩) ↔ 𝑒 = (⟨𝑋, 𝑌⟩(+_g‘𝑅)⟨𝑎, 0⟩))
35		zringbas 21658	. . . . . . . . 9 ⊢ ℤ = (Base‘ℤ_ring)
36		zringring 21654	. . . . . . . . . 10 ⊢ ℤ_ring ∈ Ring
37	36	a1i 11	. . . . . . . . 9 ⊢ (((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑎 ∈ ℤ) → ℤ_ring ∈ Ring)
38		simpll 779	. . . . . . . . 9 ⊢ (((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑎 ∈ ℤ) → 𝑋 ∈ ℤ)
39		simplr 781	. . . . . . . . 9 ⊢ (((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑎 ∈ ℤ) → 𝑌 ∈ ℤ)
40		simpr 490	. . . . . . . . 9 ⊢ (((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑎 ∈ ℤ) → 𝑎 ∈ ℤ)
41		0zd 12623	. . . . . . . . 9 ⊢ (((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑎 ∈ ℤ) → 0 ∈ ℤ)
42	38, 40	zaddcld 12725	. . . . . . . . 9 ⊢ (((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑎 ∈ ℤ) → (𝑋 + 𝑎) ∈ ℤ)
43		simpr 490	. . . . . . . . . . 11 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → 𝑌 ∈ ℤ)
44		0zd 12623	. . . . . . . . . . 11 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → 0 ∈ ℤ)
45	43, 44	zaddcld 12725	. . . . . . . . . 10 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → (𝑌 + 0) ∈ ℤ)
46	45	adantr 486	. . . . . . . . 9 ⊢ (((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑎 ∈ ℤ) → (𝑌 + 0) ∈ ℤ)
47		zringplusg 21659	. . . . . . . . 9 ⊢ + = (+_g‘ℤ_ring)
48	1, 35, 35, 37, 37, 38, 39, 40, 41, 42, 46, 47, 47, 16	xpsadd 17655	. . . . . . . 8 ⊢ (((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑎 ∈ ℤ) → (⟨𝑋, 𝑌⟩(+_g‘𝑅)⟨𝑎, 0⟩) = ⟨(𝑋 + 𝑎), (𝑌 + 0)⟩)
49	48	eqeq2d 2776	. . . . . . 7 ⊢ (((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑎 ∈ ℤ) → (𝑒 = (⟨𝑋, 𝑌⟩(+_g‘𝑅)⟨𝑎, 0⟩) ↔ 𝑒 = ⟨(𝑋 + 𝑎), (𝑌 + 0)⟩))
50	34, 49	bitrid 286	. . . . . 6 ⊢ (((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑎 ∈ ℤ) → (∃𝑏 ∈ {0}𝑒 = (⟨𝑋, 𝑌⟩(+_g‘𝑅)⟨𝑎, 𝑏⟩) ↔ 𝑒 = ⟨(𝑋 + 𝑎), (𝑌 + 0)⟩))
51	50	rexbidva 3189	. . . . 5 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → (∃𝑎 ∈ ℤ ∃𝑏 ∈ {0}𝑒 = (⟨𝑋, 𝑌⟩(+_g‘𝑅)⟨𝑎, 𝑏⟩) ↔ ∃𝑎 ∈ ℤ 𝑒 = ⟨(𝑋 + 𝑎), (𝑌 + 0)⟩))
52	51	abbidv 2831	. . . 4 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → {𝑒 ∣ ∃𝑎 ∈ ℤ ∃𝑏 ∈ {0}𝑒 = (⟨𝑋, 𝑌⟩(+_g‘𝑅)⟨𝑎, 𝑏⟩)} = {𝑒 ∣ ∃𝑎 ∈ ℤ 𝑒 = ⟨(𝑋 + 𝑎), (𝑌 + 0)⟩})
53		iunab 5018	. . . . . 6 ⊢ ∪ 𝑎 ∈ ℤ {𝑒 ∣ 𝑒 = ⟨(𝑋 + 𝑎), (𝑌 + 0)⟩} = {𝑒 ∣ ∃𝑎 ∈ ℤ 𝑒 = ⟨(𝑋 + 𝑎), (𝑌 + 0)⟩}
54	53	eqcomi 2774	. . . . 5 ⊢ {𝑒 ∣ ∃𝑎 ∈ ℤ 𝑒 = ⟨(𝑋 + 𝑎), (𝑌 + 0)⟩} = ∪ 𝑎 ∈ ℤ {𝑒 ∣ 𝑒 = ⟨(𝑋 + 𝑎), (𝑌 + 0)⟩}
55	54	a1i 11	. . . 4 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → {𝑒 ∣ ∃𝑎 ∈ ℤ 𝑒 = ⟨(𝑋 + 𝑎), (𝑌 + 0)⟩} = ∪ 𝑎 ∈ ℤ {𝑒 ∣ 𝑒 = ⟨(𝑋 + 𝑎), (𝑌 + 0)⟩})
56		zcn 12616	. . . . . . . . . . 11 ⊢ (𝑌 ∈ ℤ → 𝑌 ∈ ℂ)
57	56	adantl 487	. . . . . . . . . 10 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → 𝑌 ∈ ℂ)
58	57	addridd 11430	. . . . . . . . 9 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → (𝑌 + 0) = 𝑌)
59	58	opeq2d 4847	. . . . . . . 8 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → ⟨(𝑋 + 𝑎), (𝑌 + 0)⟩ = ⟨(𝑋 + 𝑎), 𝑌⟩)
60	59	eqeq2d 2776	. . . . . . 7 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → (𝑒 = ⟨(𝑋 + 𝑎), (𝑌 + 0)⟩ ↔ 𝑒 = ⟨(𝑋 + 𝑎), 𝑌⟩))
61	60	abbidv 2831	. . . . . 6 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → {𝑒 ∣ 𝑒 = ⟨(𝑋 + 𝑎), (𝑌 + 0)⟩} = {𝑒 ∣ 𝑒 = ⟨(𝑋 + 𝑎), 𝑌⟩})
62	61	iuneq2d 4989	. . . . 5 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → ∪ 𝑎 ∈ ℤ {𝑒 ∣ 𝑒 = ⟨(𝑋 + 𝑎), (𝑌 + 0)⟩} = ∪ 𝑎 ∈ ℤ {𝑒 ∣ 𝑒 = ⟨(𝑋 + 𝑎), 𝑌⟩})
63		df-sn 4592	. . . . . . . . 9 ⊢ {⟨(𝑋 + 𝑎), 𝑌⟩} = {𝑒 ∣ 𝑒 = ⟨(𝑋 + 𝑎), 𝑌⟩}
64	63	eqcomi 2774	. . . . . . . 8 ⊢ {𝑒 ∣ 𝑒 = ⟨(𝑋 + 𝑎), 𝑌⟩} = {⟨(𝑋 + 𝑎), 𝑌⟩}
65	64	a1i 11	. . . . . . 7 ⊢ (𝑎 ∈ ℤ → {𝑒 ∣ 𝑒 = ⟨(𝑋 + 𝑎), 𝑌⟩} = {⟨(𝑋 + 𝑎), 𝑌⟩})
66	65	iuneq2i 4980	. . . . . 6 ⊢ ∪ 𝑎 ∈ ℤ {𝑒 ∣ 𝑒 = ⟨(𝑋 + 𝑎), 𝑌⟩} = ∪ 𝑎 ∈ ℤ {⟨(𝑋 + 𝑎), 𝑌⟩}
67	66	a1i 11	. . . . 5 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → ∪ 𝑎 ∈ ℤ {𝑒 ∣ 𝑒 = ⟨(𝑋 + 𝑎), 𝑌⟩} = ∪ 𝑎 ∈ ℤ {⟨(𝑋 + 𝑎), 𝑌⟩})
68		velsn 4607	. . . . . . . . . 10 ⊢ (𝑦 ∈ {⟨(𝑋 + 𝑎), 𝑌⟩} ↔ 𝑦 = ⟨(𝑋 + 𝑎), 𝑌⟩)
69	68	rexbii 3114	. . . . . . . . 9 ⊢ (∃𝑎 ∈ ℤ 𝑦 ∈ {⟨(𝑋 + 𝑎), 𝑌⟩} ↔ ∃𝑎 ∈ ℤ 𝑦 = ⟨(𝑋 + 𝑎), 𝑌⟩)
70	42	adantr 486	. . . . . . . . . . . . 13 ⊢ ((((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑎 ∈ ℤ) ∧ 𝑦 = ⟨(𝑋 + 𝑎), 𝑌⟩) → (𝑋 + 𝑎) ∈ ℤ)
71		simplr 781	. . . . . . . . . . . . . 14 ⊢ (((((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑎 ∈ ℤ) ∧ 𝑦 = ⟨(𝑋 + 𝑎), 𝑌⟩) ∧ 𝑏 = (𝑋 + 𝑎)) → 𝑦 = ⟨(𝑋 + 𝑎), 𝑌⟩)
72		opeq1 4840	. . . . . . . . . . . . . . 15 ⊢ (𝑏 = (𝑋 + 𝑎) → ⟨𝑏, 𝑌⟩ = ⟨(𝑋 + 𝑎), 𝑌⟩)
73	72	adantl 487	. . . . . . . . . . . . . 14 ⊢ (((((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑎 ∈ ℤ) ∧ 𝑦 = ⟨(𝑋 + 𝑎), 𝑌⟩) ∧ 𝑏 = (𝑋 + 𝑎)) → ⟨𝑏, 𝑌⟩ = ⟨(𝑋 + 𝑎), 𝑌⟩)
74	71, 73	eqeq12d 2781	. . . . . . . . . . . . 13 ⊢ (((((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑎 ∈ ℤ) ∧ 𝑦 = ⟨(𝑋 + 𝑎), 𝑌⟩) ∧ 𝑏 = (𝑋 + 𝑎)) → (𝑦 = ⟨𝑏, 𝑌⟩ ↔ ⟨(𝑋 + 𝑎), 𝑌⟩ = ⟨(𝑋 + 𝑎), 𝑌⟩))
75		eqidd 2766	. . . . . . . . . . . . 13 ⊢ ((((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑎 ∈ ℤ) ∧ 𝑦 = ⟨(𝑋 + 𝑎), 𝑌⟩) → ⟨(𝑋 + 𝑎), 𝑌⟩ = ⟨(𝑋 + 𝑎), 𝑌⟩)
76	70, 74, 75	rspcedvd 3585	. . . . . . . . . . . 12 ⊢ ((((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑎 ∈ ℤ) ∧ 𝑦 = ⟨(𝑋 + 𝑎), 𝑌⟩) → ∃𝑏 ∈ ℤ 𝑦 = ⟨𝑏, 𝑌⟩)
77	76	ex 418	. . . . . . . . . . 11 ⊢ (((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑎 ∈ ℤ) → (𝑦 = ⟨(𝑋 + 𝑎), 𝑌⟩ → ∃𝑏 ∈ ℤ 𝑦 = ⟨𝑏, 𝑌⟩))
78	77	rexlimdva 3168	. . . . . . . . . 10 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → (∃𝑎 ∈ ℤ 𝑦 = ⟨(𝑋 + 𝑎), 𝑌⟩ → ∃𝑏 ∈ ℤ 𝑦 = ⟨𝑏, 𝑌⟩))
79		simpr 490	. . . . . . . . . . . . . . 15 ⊢ (((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑏 ∈ ℤ) → 𝑏 ∈ ℤ)
80		simpll 779	. . . . . . . . . . . . . . 15 ⊢ (((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑏 ∈ ℤ) → 𝑋 ∈ ℤ)
81	79, 80	zsubcld 12726	. . . . . . . . . . . . . 14 ⊢ (((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑏 ∈ ℤ) → (𝑏 − 𝑋) ∈ ℤ)
82	81	adantr 486	. . . . . . . . . . . . 13 ⊢ ((((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑏 ∈ ℤ) ∧ 𝑦 = ⟨𝑏, 𝑌⟩) → (𝑏 − 𝑋) ∈ ℤ)
83		simplr 781	. . . . . . . . . . . . . 14 ⊢ (((((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑏 ∈ ℤ) ∧ 𝑦 = ⟨𝑏, 𝑌⟩) ∧ 𝑎 = (𝑏 − 𝑋)) → 𝑦 = ⟨𝑏, 𝑌⟩)
84		oveq2 7428	. . . . . . . . . . . . . . . 16 ⊢ (𝑎 = (𝑏 − 𝑋) → (𝑋 + 𝑎) = (𝑋 + (𝑏 − 𝑋)))
85	84	adantl 487	. . . . . . . . . . . . . . 15 ⊢ (((((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑏 ∈ ℤ) ∧ 𝑦 = ⟨𝑏, 𝑌⟩) ∧ 𝑎 = (𝑏 − 𝑋)) → (𝑋 + 𝑎) = (𝑋 + (𝑏 − 𝑋)))
86	85	opeq1d 4846	. . . . . . . . . . . . . 14 ⊢ (((((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑏 ∈ ℤ) ∧ 𝑦 = ⟨𝑏, 𝑌⟩) ∧ 𝑎 = (𝑏 − 𝑋)) → ⟨(𝑋 + 𝑎), 𝑌⟩ = ⟨(𝑋 + (𝑏 − 𝑋)), 𝑌⟩)
87	83, 86	eqeq12d 2781	. . . . . . . . . . . . 13 ⊢ (((((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑏 ∈ ℤ) ∧ 𝑦 = ⟨𝑏, 𝑌⟩) ∧ 𝑎 = (𝑏 − 𝑋)) → (𝑦 = ⟨(𝑋 + 𝑎), 𝑌⟩ ↔ ⟨𝑏, 𝑌⟩ = ⟨(𝑋 + (𝑏 − 𝑋)), 𝑌⟩))
88		zcn 12616	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑋 ∈ ℤ → 𝑋 ∈ ℂ)
89	88	adantr 486	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → 𝑋 ∈ ℂ)
90	89	adantr 486	. . . . . . . . . . . . . . . . 17 ⊢ (((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑏 ∈ ℤ) → 𝑋 ∈ ℂ)
91		zcn 12616	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑏 ∈ ℤ → 𝑏 ∈ ℂ)
92	91	adantl 487	. . . . . . . . . . . . . . . . 17 ⊢ (((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑏 ∈ ℤ) → 𝑏 ∈ ℂ)
93	90, 92	pncan3d 11592	. . . . . . . . . . . . . . . 16 ⊢ (((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑏 ∈ ℤ) → (𝑋 + (𝑏 − 𝑋)) = 𝑏)
94	93	eqcomd 2771	. . . . . . . . . . . . . . 15 ⊢ (((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑏 ∈ ℤ) → 𝑏 = (𝑋 + (𝑏 − 𝑋)))
95	94	adantr 486	. . . . . . . . . . . . . 14 ⊢ ((((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑏 ∈ ℤ) ∧ 𝑦 = ⟨𝑏, 𝑌⟩) → 𝑏 = (𝑋 + (𝑏 − 𝑋)))
96	95	opeq1d 4846	. . . . . . . . . . . . 13 ⊢ ((((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑏 ∈ ℤ) ∧ 𝑦 = ⟨𝑏, 𝑌⟩) → ⟨𝑏, 𝑌⟩ = ⟨(𝑋 + (𝑏 − 𝑋)), 𝑌⟩)
97	82, 87, 96	rspcedvd 3585	. . . . . . . . . . . 12 ⊢ ((((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑏 ∈ ℤ) ∧ 𝑦 = ⟨𝑏, 𝑌⟩) → ∃𝑎 ∈ ℤ 𝑦 = ⟨(𝑋 + 𝑎), 𝑌⟩)
98	97	ex 418	. . . . . . . . . . 11 ⊢ (((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑏 ∈ ℤ) → (𝑦 = ⟨𝑏, 𝑌⟩ → ∃𝑎 ∈ ℤ 𝑦 = ⟨(𝑋 + 𝑎), 𝑌⟩))
99	98	rexlimdva 3168	. . . . . . . . . 10 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → (∃𝑏 ∈ ℤ 𝑦 = ⟨𝑏, 𝑌⟩ → ∃𝑎 ∈ ℤ 𝑦 = ⟨(𝑋 + 𝑎), 𝑌⟩))
100	78, 99	impbid 215	. . . . . . . . 9 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → (∃𝑎 ∈ ℤ 𝑦 = ⟨(𝑋 + 𝑎), 𝑌⟩ ↔ ∃𝑏 ∈ ℤ 𝑦 = ⟨𝑏, 𝑌⟩))
101	69, 100	bitrid 286	. . . . . . . 8 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → (∃𝑎 ∈ ℤ 𝑦 ∈ {⟨(𝑋 + 𝑎), 𝑌⟩} ↔ ∃𝑏 ∈ ℤ 𝑦 = ⟨𝑏, 𝑌⟩))
102		opeq2 4841	. . . . . . . . . . . . 13 ⊢ (𝑐 = 𝑌 → ⟨𝑏, 𝑐⟩ = ⟨𝑏, 𝑌⟩)
103	102	eqeq2d 2776	. . . . . . . . . . . 12 ⊢ (𝑐 = 𝑌 → (𝑦 = ⟨𝑏, 𝑐⟩ ↔ 𝑦 = ⟨𝑏, 𝑌⟩))
104	103	rexsng 4644	. . . . . . . . . . 11 ⊢ (𝑌 ∈ ℤ → (∃𝑐 ∈ {𝑌}𝑦 = ⟨𝑏, 𝑐⟩ ↔ 𝑦 = ⟨𝑏, 𝑌⟩))
105	104	adantl 487	. . . . . . . . . 10 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → (∃𝑐 ∈ {𝑌}𝑦 = ⟨𝑏, 𝑐⟩ ↔ 𝑦 = ⟨𝑏, 𝑌⟩))
106	105	bicomd 226	. . . . . . . . 9 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → (𝑦 = ⟨𝑏, 𝑌⟩ ↔ ∃𝑐 ∈ {𝑌}𝑦 = ⟨𝑏, 𝑐⟩))
107	106	rexbidv 3191	. . . . . . . 8 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → (∃𝑏 ∈ ℤ 𝑦 = ⟨𝑏, 𝑌⟩ ↔ ∃𝑏 ∈ ℤ ∃𝑐 ∈ {𝑌}𝑦 = ⟨𝑏, 𝑐⟩))
108	101, 107	bitrd 282	. . . . . . 7 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → (∃𝑎 ∈ ℤ 𝑦 ∈ {⟨(𝑋 + 𝑎), 𝑌⟩} ↔ ∃𝑏 ∈ ℤ ∃𝑐 ∈ {𝑌}𝑦 = ⟨𝑏, 𝑐⟩))
109		eliun 4962	. . . . . . 7 ⊢ (𝑦 ∈ ∪ 𝑎 ∈ ℤ {⟨(𝑋 + 𝑎), 𝑌⟩} ↔ ∃𝑎 ∈ ℤ 𝑦 ∈ {⟨(𝑋 + 𝑎), 𝑌⟩})
110		elxp2 5687	. . . . . . 7 ⊢ (𝑦 ∈ (ℤ × {𝑌}) ↔ ∃𝑏 ∈ ℤ ∃𝑐 ∈ {𝑌}𝑦 = ⟨𝑏, 𝑐⟩)
111	108, 109, 110	3bitr4g 317	. . . . . 6 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → (𝑦 ∈ ∪ 𝑎 ∈ ℤ {⟨(𝑋 + 𝑎), 𝑌⟩} ↔ 𝑦 ∈ (ℤ × {𝑌})))
112	111	eqrdv 2763	. . . . 5 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → ∪ 𝑎 ∈ ℤ {⟨(𝑋 + 𝑎), 𝑌⟩} = (ℤ × {𝑌}))
113	62, 67, 112	3eqtrd 2804	. . . 4 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → ∪ 𝑎 ∈ ℤ {𝑒 ∣ 𝑒 = ⟨(𝑋 + 𝑎), (𝑌 + 0)⟩} = (ℤ × {𝑌}))
114	52, 55, 113	3eqtrd 2804	. . 3 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → {𝑒 ∣ ∃𝑎 ∈ ℤ ∃𝑏 ∈ {0}𝑒 = (⟨𝑋, 𝑌⟩(+_g‘𝑅)⟨𝑎, 𝑏⟩)} = (ℤ × {𝑌}))
115	22, 29, 114	3eqtrd 2804	. 2 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → ran (𝑥 ∈ 𝐼 ↦ (⟨𝑋, 𝑌⟩(+_g‘𝑅)𝑥)) = (ℤ × {𝑌}))
116	18, 19, 115	3eqtrd 2804	1 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → [⟨𝑋, 𝑌⟩] ∼ = (ℤ × {𝑌}))

Colors of variables: wff setvar class

This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2146 {cab 2743 ∃wrex 3091 ⊆ wss 3906 {csn 4591 ⟨cop 4597 ∪ ciun 4958 ↦ cmpt 5194 × cxp 5661 ran crn 5664 “ cima 5666 ‘cfv 6541 (class class class)co 7420 [cec 8699 ℂcc 11118 0cc0 11120 + caddc 11123 − cmin 11461 ℤcz 12611 Basecbs 17296 ↾_s cress 17317 +_gcplusg 17337 ×_s cxps 17587 Grpcgrp 19049 ~_QG cqg 19237 Rngcrng 20279 1_rcur 20312 Ringcrg 20364 ℤ_ringczring 21651

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-rep 5240 ax-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7743 ax-cnex 11176 ax-resscn 11177 ax-1cn 11178 ax-icn 11179 ax-addcl 11180 ax-addrcl 11181 ax-mulcl 11182 ax-mulrcl 11183 ax-mulcom 11184 ax-addass 11185 ax-mulass 11186 ax-distr 11187 ax-i2m1 11188 ax-1ne0 11189 ax-1rid 11190 ax-rnegex 11191 ax-rrecex 11192 ax-cnre 11193 ax-pre-lttri 11194 ax-pre-lttrn 11195 ax-pre-ltadd 11196 ax-pre-mulgt0 11197 ax-addf 11199

This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3067 df-ral 3082 df-rex 3092 df-rmo 3371 df-reu 3372 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-tp 4596 df-op 4598 df-uni 4875 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-tr 5221 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-pred 6307 df-ord 6368 df-on 6369 df-lim 6370 df-suc 6371 df-iota 6497 df-fun 6543 df-fn 6544 df-f 6545 df-f1 6546 df-fo 6547 df-f1o 6548 df-fv 6549 df-riota 7377 df-ov 7423 df-oprab 7424 df-mpo 7425 df-om 7870 df-1st 7993 df-2nd 7994 df-frecs 8285 df-wrecs 8316 df-recs 8365 df-rdg 8404 df-1o 8460 df-2o 8461 df-er 8701 df-ec 8703 df-map 8833 df-ixp 8903 df-en 8951 df-dom 8952 df-sdom 8953 df-fin 8954 df-sup 9410 df-inf 9411 df-pnf 11265 df-mnf 11266 df-xr 11267 df-ltxr 11268 df-le 11269 df-sub 11463 df-neg 11464 df-nn 12254 df-2 12323 df-3 12324 df-4 12325 df-5 12326 df-6 12327 df-7 12328 df-8 12329 df-9 12330 df-n0 12525 df-z 12612 df-dec 12733 df-uz 12884 df-fz 13557 df-struct 17234 df-sets 17251 df-slot 17269 df-ndx 17281 df-base 17297 df-ress 17318 df-plusg 17350 df-mulr 17351 df-starv 17352 df-sca 17353 df-vsca 17354 df-ip 17355 df-tset 17356 df-ple 17357 df-ds 17359 df-unif 17360 df-hom 17361 df-cco 17362 df-0g 17521 df-prds 17527 df-imas 17589 df-xps 17591 df-mgm 18725 df-sgrp 18814 df-mnd 18830 df-grp 19052 df-minusg 19053 df-subg 19238 df-eqg 19240 df-cmn 19901 df-abl 19902 df-mgp 20266 df-rng 20280 df-ur 20313 df-ring 20366 df-cring 20367 df-subrng 20700 df-subrg 20724 df-cnfld 21578 df-zring 21652

This theorem is used by: pzriprnglem11 21696 pzriprnglem12 21697

W3C validator