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 21649

Description: Lemma 10 for pzriprng 21656: 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 21640	. . . 4 ⊢ 𝑅 ∈ Rng
3		rnggrp 20240	. . . 4 ⊢ (𝑅 ∈ Rng → 𝑅 ∈ Grp)
4	2, 3	ax-mp 5	. . 3 ⊢ 𝑅 ∈ Grp
5		pzriprng.i	. . . . 5 ⊢ 𝐼 = (ℤ × {0})
6		0z 12606	. . . . . 6 ⊢ 0 ∈ ℤ
7		snssi 4751	. . . . . 6 ⊢ (0 ∈ ℤ → {0} ⊆ ℤ)
8		xpss2 5681	. . . . . 6 ⊢ ({0} ⊆ ℤ → (ℤ × {0}) ⊆ (ℤ × ℤ))
9	6, 7, 8	mp2b 10	. . . . 5 ⊢ (ℤ × {0}) ⊆ (ℤ × ℤ)
10	5, 9	eqsstri 3983	. . . 4 ⊢ 𝐼 ⊆ (ℤ × ℤ)
11	10	a1i 11	. . 3 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → 𝐼 ⊆ (ℤ × ℤ))
12		opelxpi 5698	. . 3 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → ⟨𝑋, 𝑌⟩ ∈ (ℤ × ℤ))
13	1	pzriprnglem2 21641	. . . . 5 ⊢ (Base‘𝑅) = (ℤ × ℤ)
14	13	eqcomi 2772	. . . 4 ⊢ (ℤ × ℤ) = (Base‘𝑅)
15		pzriprng.g	. . . 4 ⊢ ∼ = (𝑅 ~_QG 𝐼)
16		eqid 2763	. . . 4 ⊢ (+_g‘𝑅) = (+_g‘𝑅)
17	14, 15, 16	eqglact 19251	. . 3 ⊢ ((𝑅 ∈ Grp ∧ 𝐼 ⊆ (ℤ × ℤ) ∧ ⟨𝑋, 𝑌⟩ ∈ (ℤ × ℤ)) → [⟨𝑋, 𝑌⟩] ∼ = ((𝑥 ∈ (ℤ × ℤ) ↦ (⟨𝑋, 𝑌⟩(+_g‘𝑅)𝑥)) “ 𝐼))
18	4, 11, 12, 17	mp3an2i 1495	. 2 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → [⟨𝑋, 𝑌⟩] ∼ = ((𝑥 ∈ (ℤ × ℤ) ↦ (⟨𝑋, 𝑌⟩(+_g‘𝑅)𝑥)) “ 𝐼))
19	11	mptimass 6075	. 2 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → ((𝑥 ∈ (ℤ × ℤ) ↦ (⟨𝑋, 𝑌⟩(+_g‘𝑅)𝑥)) “ 𝐼) = ran (𝑥 ∈ 𝐼 ↦ (⟨𝑋, 𝑌⟩(+_g‘𝑅)𝑥)))
20		eqid 2763	. . . . 5 ⊢ (𝑥 ∈ 𝐼 ↦ (⟨𝑋, 𝑌⟩(+_g‘𝑅)𝑥)) = (𝑥 ∈ 𝐼 ↦ (⟨𝑋, 𝑌⟩(+_g‘𝑅)𝑥))
21	20	rnmpt 5947	. . . 4 ⊢ ran (𝑥 ∈ 𝐼 ↦ (⟨𝑋, 𝑌⟩(+_g‘𝑅)𝑥)) = {𝑒 ∣ ∃𝑥 ∈ 𝐼 𝑒 = (⟨𝑋, 𝑌⟩(+_g‘𝑅)𝑥)}
22	21	a1i 11	. . 3 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → ran (𝑥 ∈ 𝐼 ↦ (⟨𝑋, 𝑌⟩(+_g‘𝑅)𝑥)) = {𝑒 ∣ ∃𝑥 ∈ 𝐼 𝑒 = (⟨𝑋, 𝑌⟩(+_g‘𝑅)𝑥)})
23	5	rexeqi 3322	. . . . . 6 ⊢ (∃𝑥 ∈ 𝐼 𝑒 = (⟨𝑋, 𝑌⟩(+_g‘𝑅)𝑥) ↔ ∃𝑥 ∈ (ℤ × {0})𝑒 = (⟨𝑋, 𝑌⟩(+_g‘𝑅)𝑥))
24		oveq2 7418	. . . . . . . 8 ⊢ (𝑥 = ⟨𝑎, 𝑏⟩ → (⟨𝑋, 𝑌⟩(+_g‘𝑅)𝑥) = (⟨𝑋, 𝑌⟩(+_g‘𝑅)⟨𝑎, 𝑏⟩))
25	24	eqeq2d 2774	. . . . . . 7 ⊢ (𝑥 = ⟨𝑎, 𝑏⟩ → (𝑒 = (⟨𝑋, 𝑌⟩(+_g‘𝑅)𝑥) ↔ 𝑒 = (⟨𝑋, 𝑌⟩(+_g‘𝑅)⟨𝑎, 𝑏⟩)))
26	25	rexxp 5828	. . . . . 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 2829	. . 3 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → {𝑒 ∣ ∃𝑥 ∈ 𝐼 𝑒 = (⟨𝑋, 𝑌⟩(+_g‘𝑅)𝑥)} = {𝑒 ∣ ∃𝑎 ∈ ℤ ∃𝑏 ∈ {0}𝑒 = (⟨𝑋, 𝑌⟩(+_g‘𝑅)⟨𝑎, 𝑏⟩)})
30		c0ex 11204	. . . . . . . 8 ⊢ 0 ∈ V
31		opeq2 4839	. . . . . . . . . 10 ⊢ (𝑏 = 0 → ⟨𝑎, 𝑏⟩ = ⟨𝑎, 0⟩)
32	31	oveq2d 7426	. . . . . . . . 9 ⊢ (𝑏 = 0 → (⟨𝑋, 𝑌⟩(+_g‘𝑅)⟨𝑎, 𝑏⟩) = (⟨𝑋, 𝑌⟩(+_g‘𝑅)⟨𝑎, 0⟩))
33	32	eqeq2d 2774	. . . . . . . 8 ⊢ (𝑏 = 0 → (𝑒 = (⟨𝑋, 𝑌⟩(+_g‘𝑅)⟨𝑎, 𝑏⟩) ↔ 𝑒 = (⟨𝑋, 𝑌⟩(+_g‘𝑅)⟨𝑎, 0⟩)))
34	30, 33	rexsn 4648	. . . . . . 7 ⊢ (∃𝑏 ∈ {0}𝑒 = (⟨𝑋, 𝑌⟩(+_g‘𝑅)⟨𝑎, 𝑏⟩) ↔ 𝑒 = (⟨𝑋, 𝑌⟩(+_g‘𝑅)⟨𝑎, 0⟩))
35		zringbas 21612	. . . . . . . . 9 ⊢ ℤ = (Base‘ℤ_ring)
36		zringring 21608	. . . . . . . . . 10 ⊢ ℤ_ring ∈ Ring
37	36	a1i 11	. . . . . . . . 9 ⊢ (((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑎 ∈ ℤ) → ℤ_ring ∈ Ring)
38		simpll 778	. . . . . . . . 9 ⊢ (((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑎 ∈ ℤ) → 𝑋 ∈ ℤ)
39		simplr 780	. . . . . . . . 9 ⊢ (((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑎 ∈ ℤ) → 𝑌 ∈ ℤ)
40		simpr 489	. . . . . . . . 9 ⊢ (((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑎 ∈ ℤ) → 𝑎 ∈ ℤ)
41		0zd 12607	. . . . . . . . 9 ⊢ (((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑎 ∈ ℤ) → 0 ∈ ℤ)
42	38, 40	zaddcld 12708	. . . . . . . . 9 ⊢ (((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑎 ∈ ℤ) → (𝑋 + 𝑎) ∈ ℤ)
43		simpr 489	. . . . . . . . . . 11 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → 𝑌 ∈ ℤ)
44		0zd 12607	. . . . . . . . . . 11 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → 0 ∈ ℤ)
45	43, 44	zaddcld 12708	. . . . . . . . . 10 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → (𝑌 + 0) ∈ ℤ)
46	45	adantr 485	. . . . . . . . 9 ⊢ (((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑎 ∈ ℤ) → (𝑌 + 0) ∈ ℤ)
47		zringplusg 21613	. . . . . . . . 9 ⊢ + = (+_g‘ℤ_ring)
48	1, 35, 35, 37, 37, 38, 39, 40, 41, 42, 46, 47, 47, 16	xpsadd 17632	. . . . . . . 8 ⊢ (((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑎 ∈ ℤ) → (⟨𝑋, 𝑌⟩(+_g‘𝑅)⟨𝑎, 0⟩) = ⟨(𝑋 + 𝑎), (𝑌 + 0)⟩)
49	48	eqeq2d 2774	. . . . . . 7 ⊢ (((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑎 ∈ ℤ) → (𝑒 = (⟨𝑋, 𝑌⟩(+_g‘𝑅)⟨𝑎, 0⟩) ↔ 𝑒 = ⟨(𝑋 + 𝑎), (𝑌 + 0)⟩))
50	34, 49	bitrid 286	. . . . . 6 ⊢ (((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑎 ∈ ℤ) → (∃𝑏 ∈ {0}𝑒 = (⟨𝑋, 𝑌⟩(+_g‘𝑅)⟨𝑎, 𝑏⟩) ↔ 𝑒 = ⟨(𝑋 + 𝑎), (𝑌 + 0)⟩))
51	50	rexbidva 3187	. . . . 5 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → (∃𝑎 ∈ ℤ ∃𝑏 ∈ {0}𝑒 = (⟨𝑋, 𝑌⟩(+_g‘𝑅)⟨𝑎, 𝑏⟩) ↔ ∃𝑎 ∈ ℤ 𝑒 = ⟨(𝑋 + 𝑎), (𝑌 + 0)⟩))
52	51	abbidv 2829	. . . 4 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → {𝑒 ∣ ∃𝑎 ∈ ℤ ∃𝑏 ∈ {0}𝑒 = (⟨𝑋, 𝑌⟩(+_g‘𝑅)⟨𝑎, 𝑏⟩)} = {𝑒 ∣ ∃𝑎 ∈ ℤ 𝑒 = ⟨(𝑋 + 𝑎), (𝑌 + 0)⟩})
53		iunab 5016	. . . . . 6 ⊢ ∪ 𝑎 ∈ ℤ {𝑒 ∣ 𝑒 = ⟨(𝑋 + 𝑎), (𝑌 + 0)⟩} = {𝑒 ∣ ∃𝑎 ∈ ℤ 𝑒 = ⟨(𝑋 + 𝑎), (𝑌 + 0)⟩}
54	53	eqcomi 2772	. . . . 5 ⊢ {𝑒 ∣ ∃𝑎 ∈ ℤ 𝑒 = ⟨(𝑋 + 𝑎), (𝑌 + 0)⟩} = ∪ 𝑎 ∈ ℤ {𝑒 ∣ 𝑒 = ⟨(𝑋 + 𝑎), (𝑌 + 0)⟩}
55	54	a1i 11	. . . 4 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → {𝑒 ∣ ∃𝑎 ∈ ℤ 𝑒 = ⟨(𝑋 + 𝑎), (𝑌 + 0)⟩} = ∪ 𝑎 ∈ ℤ {𝑒 ∣ 𝑒 = ⟨(𝑋 + 𝑎), (𝑌 + 0)⟩})
56		zcn 12600	. . . . . . . . . . 11 ⊢ (𝑌 ∈ ℤ → 𝑌 ∈ ℂ)
57	56	adantl 486	. . . . . . . . . 10 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → 𝑌 ∈ ℂ)
58	57	addridd 11414	. . . . . . . . 9 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → (𝑌 + 0) = 𝑌)
59	58	opeq2d 4845	. . . . . . . 8 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → ⟨(𝑋 + 𝑎), (𝑌 + 0)⟩ = ⟨(𝑋 + 𝑎), 𝑌⟩)
60	59	eqeq2d 2774	. . . . . . 7 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → (𝑒 = ⟨(𝑋 + 𝑎), (𝑌 + 0)⟩ ↔ 𝑒 = ⟨(𝑋 + 𝑎), 𝑌⟩))
61	60	abbidv 2829	. . . . . 6 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → {𝑒 ∣ 𝑒 = ⟨(𝑋 + 𝑎), (𝑌 + 0)⟩} = {𝑒 ∣ 𝑒 = ⟨(𝑋 + 𝑎), 𝑌⟩})
62	61	iuneq2d 4987	. . . . 5 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → ∪ 𝑎 ∈ ℤ {𝑒 ∣ 𝑒 = ⟨(𝑋 + 𝑎), (𝑌 + 0)⟩} = ∪ 𝑎 ∈ ℤ {𝑒 ∣ 𝑒 = ⟨(𝑋 + 𝑎), 𝑌⟩})
63		df-sn 4590	. . . . . . . . 9 ⊢ {⟨(𝑋 + 𝑎), 𝑌⟩} = {𝑒 ∣ 𝑒 = ⟨(𝑋 + 𝑎), 𝑌⟩}
64	63	eqcomi 2772	. . . . . . . 8 ⊢ {𝑒 ∣ 𝑒 = ⟨(𝑋 + 𝑎), 𝑌⟩} = {⟨(𝑋 + 𝑎), 𝑌⟩}
65	64	a1i 11	. . . . . . 7 ⊢ (𝑎 ∈ ℤ → {𝑒 ∣ 𝑒 = ⟨(𝑋 + 𝑎), 𝑌⟩} = {⟨(𝑋 + 𝑎), 𝑌⟩})
66	65	iuneq2i 4978	. . . . . 6 ⊢ ∪ 𝑎 ∈ ℤ {𝑒 ∣ 𝑒 = ⟨(𝑋 + 𝑎), 𝑌⟩} = ∪ 𝑎 ∈ ℤ {⟨(𝑋 + 𝑎), 𝑌⟩}
67	66	a1i 11	. . . . 5 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → ∪ 𝑎 ∈ ℤ {𝑒 ∣ 𝑒 = ⟨(𝑋 + 𝑎), 𝑌⟩} = ∪ 𝑎 ∈ ℤ {⟨(𝑋 + 𝑎), 𝑌⟩})
68		velsn 4605	. . . . . . . . . 10 ⊢ (𝑦 ∈ {⟨(𝑋 + 𝑎), 𝑌⟩} ↔ 𝑦 = ⟨(𝑋 + 𝑎), 𝑌⟩)
69	68	rexbii 3112	. . . . . . . . 9 ⊢ (∃𝑎 ∈ ℤ 𝑦 ∈ {⟨(𝑋 + 𝑎), 𝑌⟩} ↔ ∃𝑎 ∈ ℤ 𝑦 = ⟨(𝑋 + 𝑎), 𝑌⟩)
70	42	adantr 485	. . . . . . . . . . . . 13 ⊢ ((((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑎 ∈ ℤ) ∧ 𝑦 = ⟨(𝑋 + 𝑎), 𝑌⟩) → (𝑋 + 𝑎) ∈ ℤ)
71		simplr 780	. . . . . . . . . . . . . 14 ⊢ (((((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑎 ∈ ℤ) ∧ 𝑦 = ⟨(𝑋 + 𝑎), 𝑌⟩) ∧ 𝑏 = (𝑋 + 𝑎)) → 𝑦 = ⟨(𝑋 + 𝑎), 𝑌⟩)
72		opeq1 4838	. . . . . . . . . . . . . . 15 ⊢ (𝑏 = (𝑋 + 𝑎) → ⟨𝑏, 𝑌⟩ = ⟨(𝑋 + 𝑎), 𝑌⟩)
73	72	adantl 486	. . . . . . . . . . . . . 14 ⊢ (((((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑎 ∈ ℤ) ∧ 𝑦 = ⟨(𝑋 + 𝑎), 𝑌⟩) ∧ 𝑏 = (𝑋 + 𝑎)) → ⟨𝑏, 𝑌⟩ = ⟨(𝑋 + 𝑎), 𝑌⟩)
74	71, 73	eqeq12d 2779	. . . . . . . . . . . . 13 ⊢ (((((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑎 ∈ ℤ) ∧ 𝑦 = ⟨(𝑋 + 𝑎), 𝑌⟩) ∧ 𝑏 = (𝑋 + 𝑎)) → (𝑦 = ⟨𝑏, 𝑌⟩ ↔ ⟨(𝑋 + 𝑎), 𝑌⟩ = ⟨(𝑋 + 𝑎), 𝑌⟩))
75		eqidd 2764	. . . . . . . . . . . . 13 ⊢ ((((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑎 ∈ ℤ) ∧ 𝑦 = ⟨(𝑋 + 𝑎), 𝑌⟩) → ⟨(𝑋 + 𝑎), 𝑌⟩ = ⟨(𝑋 + 𝑎), 𝑌⟩)
76	70, 74, 75	rspcedvd 3583	. . . . . . . . . . . 12 ⊢ ((((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑎 ∈ ℤ) ∧ 𝑦 = ⟨(𝑋 + 𝑎), 𝑌⟩) → ∃𝑏 ∈ ℤ 𝑦 = ⟨𝑏, 𝑌⟩)
77	76	ex 417	. . . . . . . . . . 11 ⊢ (((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑎 ∈ ℤ) → (𝑦 = ⟨(𝑋 + 𝑎), 𝑌⟩ → ∃𝑏 ∈ ℤ 𝑦 = ⟨𝑏, 𝑌⟩))
78	77	rexlimdva 3166	. . . . . . . . . 10 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → (∃𝑎 ∈ ℤ 𝑦 = ⟨(𝑋 + 𝑎), 𝑌⟩ → ∃𝑏 ∈ ℤ 𝑦 = ⟨𝑏, 𝑌⟩))
79		simpr 489	. . . . . . . . . . . . . . 15 ⊢ (((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑏 ∈ ℤ) → 𝑏 ∈ ℤ)
80		simpll 778	. . . . . . . . . . . . . . 15 ⊢ (((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑏 ∈ ℤ) → 𝑋 ∈ ℤ)
81	79, 80	zsubcld 12709	. . . . . . . . . . . . . 14 ⊢ (((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑏 ∈ ℤ) → (𝑏 − 𝑋) ∈ ℤ)
82	81	adantr 485	. . . . . . . . . . . . 13 ⊢ ((((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑏 ∈ ℤ) ∧ 𝑦 = ⟨𝑏, 𝑌⟩) → (𝑏 − 𝑋) ∈ ℤ)
83		simplr 780	. . . . . . . . . . . . . 14 ⊢ (((((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑏 ∈ ℤ) ∧ 𝑦 = ⟨𝑏, 𝑌⟩) ∧ 𝑎 = (𝑏 − 𝑋)) → 𝑦 = ⟨𝑏, 𝑌⟩)
84		oveq2 7418	. . . . . . . . . . . . . . . 16 ⊢ (𝑎 = (𝑏 − 𝑋) → (𝑋 + 𝑎) = (𝑋 + (𝑏 − 𝑋)))
85	84	adantl 486	. . . . . . . . . . . . . . 15 ⊢ (((((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑏 ∈ ℤ) ∧ 𝑦 = ⟨𝑏, 𝑌⟩) ∧ 𝑎 = (𝑏 − 𝑋)) → (𝑋 + 𝑎) = (𝑋 + (𝑏 − 𝑋)))
86	85	opeq1d 4844	. . . . . . . . . . . . . 14 ⊢ (((((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑏 ∈ ℤ) ∧ 𝑦 = ⟨𝑏, 𝑌⟩) ∧ 𝑎 = (𝑏 − 𝑋)) → ⟨(𝑋 + 𝑎), 𝑌⟩ = ⟨(𝑋 + (𝑏 − 𝑋)), 𝑌⟩)
87	83, 86	eqeq12d 2779	. . . . . . . . . . . . 13 ⊢ (((((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑏 ∈ ℤ) ∧ 𝑦 = ⟨𝑏, 𝑌⟩) ∧ 𝑎 = (𝑏 − 𝑋)) → (𝑦 = ⟨(𝑋 + 𝑎), 𝑌⟩ ↔ ⟨𝑏, 𝑌⟩ = ⟨(𝑋 + (𝑏 − 𝑋)), 𝑌⟩))
88		zcn 12600	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑋 ∈ ℤ → 𝑋 ∈ ℂ)
89	88	adantr 485	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → 𝑋 ∈ ℂ)
90	89	adantr 485	. . . . . . . . . . . . . . . . 17 ⊢ (((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑏 ∈ ℤ) → 𝑋 ∈ ℂ)
91		zcn 12600	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑏 ∈ ℤ → 𝑏 ∈ ℂ)
92	91	adantl 486	. . . . . . . . . . . . . . . . 17 ⊢ (((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑏 ∈ ℤ) → 𝑏 ∈ ℂ)
93	90, 92	pncan3d 11576	. . . . . . . . . . . . . . . 16 ⊢ (((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑏 ∈ ℤ) → (𝑋 + (𝑏 − 𝑋)) = 𝑏)
94	93	eqcomd 2769	. . . . . . . . . . . . . . 15 ⊢ (((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑏 ∈ ℤ) → 𝑏 = (𝑋 + (𝑏 − 𝑋)))
95	94	adantr 485	. . . . . . . . . . . . . 14 ⊢ ((((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑏 ∈ ℤ) ∧ 𝑦 = ⟨𝑏, 𝑌⟩) → 𝑏 = (𝑋 + (𝑏 − 𝑋)))
96	95	opeq1d 4844	. . . . . . . . . . . . 13 ⊢ ((((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑏 ∈ ℤ) ∧ 𝑦 = ⟨𝑏, 𝑌⟩) → ⟨𝑏, 𝑌⟩ = ⟨(𝑋 + (𝑏 − 𝑋)), 𝑌⟩)
97	82, 87, 96	rspcedvd 3583	. . . . . . . . . . . 12 ⊢ ((((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑏 ∈ ℤ) ∧ 𝑦 = ⟨𝑏, 𝑌⟩) → ∃𝑎 ∈ ℤ 𝑦 = ⟨(𝑋 + 𝑎), 𝑌⟩)
98	97	ex 417	. . . . . . . . . . 11 ⊢ (((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑏 ∈ ℤ) → (𝑦 = ⟨𝑏, 𝑌⟩ → ∃𝑎 ∈ ℤ 𝑦 = ⟨(𝑋 + 𝑎), 𝑌⟩))
99	98	rexlimdva 3166	. . . . . . . . . 10 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → (∃𝑏 ∈ ℤ 𝑦 = ⟨𝑏, 𝑌⟩ → ∃𝑎 ∈ ℤ 𝑦 = ⟨(𝑋 + 𝑎), 𝑌⟩))
100	78, 99	impbid 215	. . . . . . . . 9 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → (∃𝑎 ∈ ℤ 𝑦 = ⟨(𝑋 + 𝑎), 𝑌⟩ ↔ ∃𝑏 ∈ ℤ 𝑦 = ⟨𝑏, 𝑌⟩))
101	69, 100	bitrid 286	. . . . . . . 8 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → (∃𝑎 ∈ ℤ 𝑦 ∈ {⟨(𝑋 + 𝑎), 𝑌⟩} ↔ ∃𝑏 ∈ ℤ 𝑦 = ⟨𝑏, 𝑌⟩))
102		opeq2 4839	. . . . . . . . . . . . 13 ⊢ (𝑐 = 𝑌 → ⟨𝑏, 𝑐⟩ = ⟨𝑏, 𝑌⟩)
103	102	eqeq2d 2774	. . . . . . . . . . . 12 ⊢ (𝑐 = 𝑌 → (𝑦 = ⟨𝑏, 𝑐⟩ ↔ 𝑦 = ⟨𝑏, 𝑌⟩))
104	103	rexsng 4642	. . . . . . . . . . 11 ⊢ (𝑌 ∈ ℤ → (∃𝑐 ∈ {𝑌}𝑦 = ⟨𝑏, 𝑐⟩ ↔ 𝑦 = ⟨𝑏, 𝑌⟩))
105	104	adantl 486	. . . . . . . . . 10 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → (∃𝑐 ∈ {𝑌}𝑦 = ⟨𝑏, 𝑐⟩ ↔ 𝑦 = ⟨𝑏, 𝑌⟩))
106	105	bicomd 226	. . . . . . . . 9 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → (𝑦 = ⟨𝑏, 𝑌⟩ ↔ ∃𝑐 ∈ {𝑌}𝑦 = ⟨𝑏, 𝑐⟩))
107	106	rexbidv 3189	. . . . . . . 8 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → (∃𝑏 ∈ ℤ 𝑦 = ⟨𝑏, 𝑌⟩ ↔ ∃𝑏 ∈ ℤ ∃𝑐 ∈ {𝑌}𝑦 = ⟨𝑏, 𝑐⟩))
108	101, 107	bitrd 282	. . . . . . 7 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → (∃𝑎 ∈ ℤ 𝑦 ∈ {⟨(𝑋 + 𝑎), 𝑌⟩} ↔ ∃𝑏 ∈ ℤ ∃𝑐 ∈ {𝑌}𝑦 = ⟨𝑏, 𝑐⟩))
109		eliun 4960	. . . . . . 7 ⊢ (𝑦 ∈ ∪ 𝑎 ∈ ℤ {⟨(𝑋 + 𝑎), 𝑌⟩} ↔ ∃𝑎 ∈ ℤ 𝑦 ∈ {⟨(𝑋 + 𝑎), 𝑌⟩})
110		elxp2 5685	. . . . . . 7 ⊢ (𝑦 ∈ (ℤ × {𝑌}) ↔ ∃𝑏 ∈ ℤ ∃𝑐 ∈ {𝑌}𝑦 = ⟨𝑏, 𝑐⟩)
111	108, 109, 110	3bitr4g 317	. . . . . 6 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → (𝑦 ∈ ∪ 𝑎 ∈ ℤ {⟨(𝑋 + 𝑎), 𝑌⟩} ↔ 𝑦 ∈ (ℤ × {𝑌})))
112	111	eqrdv 2761	. . . . 5 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → ∪ 𝑎 ∈ ℤ {⟨(𝑋 + 𝑎), 𝑌⟩} = (ℤ × {𝑌}))
113	62, 67, 112	3eqtrd 2802	. . . 4 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → ∪ 𝑎 ∈ ℤ {𝑒 ∣ 𝑒 = ⟨(𝑋 + 𝑎), (𝑌 + 0)⟩} = (ℤ × {𝑌}))
114	52, 55, 113	3eqtrd 2802	. . 3 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → {𝑒 ∣ ∃𝑎 ∈ ℤ ∃𝑏 ∈ {0}𝑒 = (⟨𝑋, 𝑌⟩(+_g‘𝑅)⟨𝑎, 𝑏⟩)} = (ℤ × {𝑌}))
115	22, 29, 114	3eqtrd 2802	. 2 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → ran (𝑥 ∈ 𝐼 ↦ (⟨𝑋, 𝑌⟩(+_g‘𝑅)𝑥)) = (ℤ × {𝑌}))
116	18, 19, 115	3eqtrd 2802	1 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → [⟨𝑋, 𝑌⟩] ∼ = (ℤ × {𝑌}))

Colors of variables: wff setvar class

This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 400 = wceq 1570 ∈ wcel 2143 {cab 2741 ∃wrex 3089 ⊆ wss 3905 {csn 4589 ⟨cop 4595 ∪ ciun 4956 ↦ cmpt 5192 × cxp 5659 ran crn 5662 “ cima 5664 ‘cfv 6536 (class class class)co 7410 [cec 8688 ℂcc 11102 0cc0 11104 + caddc 11107 − cmin 11445 ℤcz 12595 Basecbs 17273 ↾_s cress 17294 +_gcplusg 17314 ×_s cxps 17564 Grpcgrp 19004 ~_QG cqg 19192 Rngcrng 20234 1_rcur 20267 Ringcrg 20319 ℤ_ringczring 21605

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-rep 5238 ax-sep 5257 ax-nul 5269 ax-pow 5336 ax-pr 5404 ax-un 7732 ax-cnex 11160 ax-resscn 11161 ax-1cn 11162 ax-icn 11163 ax-addcl 11164 ax-addrcl 11165 ax-mulcl 11166 ax-mulrcl 11167 ax-mulcom 11168 ax-addass 11169 ax-mulass 11170 ax-distr 11171 ax-i2m1 11172 ax-1ne0 11173 ax-1rid 11174 ax-rnegex 11175 ax-rrecex 11176 ax-cnre 11177 ax-pre-lttri 11178 ax-pre-lttrn 11179 ax-pre-ltadd 11180 ax-pre-mulgt0 11181 ax-addf 11183

This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3065 df-ral 3080 df-rex 3090 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3745 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-pss 3925 df-nul 4287 df-if 4488 df-pw 4564 df-sn 4590 df-pr 4592 df-tp 4594 df-op 4596 df-uni 4873 df-iun 4958 df-br 5110 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5556 df-eprel 5561 df-po 5569 df-so 5570 df-fr 5614 df-we 5616 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-pred 6302 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7367 df-ov 7413 df-oprab 7414 df-mpo 7415 df-om 7859 df-1st 7982 df-2nd 7983 df-frecs 8274 df-wrecs 8305 df-recs 8354 df-rdg 8393 df-1o 8449 df-2o 8450 df-er 8690 df-ec 8692 df-map 8822 df-ixp 8892 df-en 8940 df-dom 8941 df-sdom 8942 df-fin 8943 df-sup 9398 df-inf 9399 df-pnf 11249 df-mnf 11250 df-xr 11251 df-ltxr 11252 df-le 11253 df-sub 11447 df-neg 11448 df-nn 12238 df-2 12307 df-3 12308 df-4 12309 df-5 12310 df-6 12311 df-7 12312 df-8 12313 df-9 12314 df-n0 12509 df-z 12596 df-dec 12716 df-uz 12867 df-fz 13540 df-struct 17211 df-sets 17228 df-slot 17246 df-ndx 17258 df-base 17274 df-ress 17295 df-plusg 17327 df-mulr 17328 df-starv 17329 df-sca 17330 df-vsca 17331 df-ip 17332 df-tset 17333 df-ple 17334 df-ds 17336 df-unif 17337 df-hom 17338 df-cco 17339 df-0g 17498 df-prds 17504 df-imas 17566 df-xps 17568 df-mgm 18702 df-sgrp 18781 df-mnd 18797 df-grp 19007 df-minusg 19008 df-subg 19193 df-eqg 19195 df-cmn 19856 df-abl 19857 df-mgp 20221 df-rng 20235 df-ur 20268 df-ring 20321 df-cring 20322 df-subrng 20654 df-subrg 20678 df-cnfld 21532 df-zring 21606

This theorem is used by: pzriprnglem11 21650 pzriprnglem12 21651

W3C validator