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 21709

Description: Lemma 10 for pzriprng 21716: 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 21700	. . . 4 ⊢ 𝑅 ∈ Rng
3		rnggrp 20299	. . . 4 ⊢ (𝑅 ∈ Rng → 𝑅 ∈ Grp)
4	2, 3	ax-mp 5	. . 3 ⊢ 𝑅 ∈ Grp
5		pzriprng.i	. . . . 5 ⊢ 𝐼 = (ℤ × {0})
6		0z 12630	. . . . . 6 ⊢ 0 ∈ ℤ
7		snssi 4749	. . . . . 6 ⊢ (0 ∈ ℤ → {0} ⊆ ℤ)
8		xpss2 5679	. . . . . 6 ⊢ ({0} ⊆ ℤ → (ℤ × {0}) ⊆ (ℤ × ℤ))
9	6, 7, 8	mp2b 10	. . . . 5 ⊢ (ℤ × {0}) ⊆ (ℤ × ℤ)
10	5, 9	eqsstri 3980	. . . 4 ⊢ 𝐼 ⊆ (ℤ × ℤ)
11	10	a1i 11	. . 3 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → 𝐼 ⊆ (ℤ × ℤ))
12		opelxpi 5696	. . 3 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → ⟨𝑋, 𝑌⟩ ∈ (ℤ × ℤ))
13	1	pzriprnglem2 21701	. . . . 5 ⊢ (Base‘𝑅) = (ℤ × ℤ)
14	13	eqcomi 2771	. . . 4 ⊢ (ℤ × ℤ) = (Base‘𝑅)
15		pzriprng.g	. . . 4 ⊢ ∼ = (𝑅 ~_QG 𝐼)
16		eqid 2762	. . . 4 ⊢ (+_g‘𝑅) = (+_g‘𝑅)
17	14, 15, 16	eqglact 19310	. . 3 ⊢ ((𝑅 ∈ Grp ∧ 𝐼 ⊆ (ℤ × ℤ) ∧ ⟨𝑋, 𝑌⟩ ∈ (ℤ × ℤ)) → [⟨𝑋, 𝑌⟩] ∼ = ((𝑥 ∈ (ℤ × ℤ) ↦ (⟨𝑋, 𝑌⟩(+_g‘𝑅)𝑥)) “ 𝐼))
18	4, 11, 12, 17	mp3an2i 1495	. 2 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → [⟨𝑋, 𝑌⟩] ∼ = ((𝑥 ∈ (ℤ × ℤ) ↦ (⟨𝑋, 𝑌⟩(+_g‘𝑅)𝑥)) “ 𝐼))
19	11	mptimass 6073	. 2 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → ((𝑥 ∈ (ℤ × ℤ) ↦ (⟨𝑋, 𝑌⟩(+_g‘𝑅)𝑥)) “ 𝐼) = ran (𝑥 ∈ 𝐼 ↦ (⟨𝑋, 𝑌⟩(+_g‘𝑅)𝑥)))
20		eqid 2762	. . . . 5 ⊢ (𝑥 ∈ 𝐼 ↦ (⟨𝑋, 𝑌⟩(+_g‘𝑅)𝑥)) = (𝑥 ∈ 𝐼 ↦ (⟨𝑋, 𝑌⟩(+_g‘𝑅)𝑥))
21	20	rnmpt 5945	. . . 4 ⊢ ran (𝑥 ∈ 𝐼 ↦ (⟨𝑋, 𝑌⟩(+_g‘𝑅)𝑥)) = {𝑒 ∣ ∃𝑥 ∈ 𝐼 𝑒 = (⟨𝑋, 𝑌⟩(+_g‘𝑅)𝑥)}
22	21	a1i 11	. . 3 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → ran (𝑥 ∈ 𝐼 ↦ (⟨𝑋, 𝑌⟩(+_g‘𝑅)𝑥)) = {𝑒 ∣ ∃𝑥 ∈ 𝐼 𝑒 = (⟨𝑋, 𝑌⟩(+_g‘𝑅)𝑥)})
23	5	rexeqi 3320	. . . . . 6 ⊢ (∃𝑥 ∈ 𝐼 𝑒 = (⟨𝑋, 𝑌⟩(+_g‘𝑅)𝑥) ↔ ∃𝑥 ∈ (ℤ × {0})𝑒 = (⟨𝑋, 𝑌⟩(+_g‘𝑅)𝑥))
24		oveq2 7425	. . . . . . . 8 ⊢ (𝑥 = ⟨𝑎, 𝑏⟩ → (⟨𝑋, 𝑌⟩(+_g‘𝑅)𝑥) = (⟨𝑋, 𝑌⟩(+_g‘𝑅)⟨𝑎, 𝑏⟩))
25	24	eqeq2d 2773	. . . . . . 7 ⊢ (𝑥 = ⟨𝑎, 𝑏⟩ → (𝑒 = (⟨𝑋, 𝑌⟩(+_g‘𝑅)𝑥) ↔ 𝑒 = (⟨𝑋, 𝑌⟩(+_g‘𝑅)⟨𝑎, 𝑏⟩)))
26	25	rexxp 5826	. . . . . 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 2828	. . 3 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → {𝑒 ∣ ∃𝑥 ∈ 𝐼 𝑒 = (⟨𝑋, 𝑌⟩(+_g‘𝑅)𝑥)} = {𝑒 ∣ ∃𝑎 ∈ ℤ ∃𝑏 ∈ {0}𝑒 = (⟨𝑋, 𝑌⟩(+_g‘𝑅)⟨𝑎, 𝑏⟩)})
30		c0ex 11228	. . . . . . . 8 ⊢ 0 ∈ V
31		opeq2 4837	. . . . . . . . . 10 ⊢ (𝑏 = 0 → ⟨𝑎, 𝑏⟩ = ⟨𝑎, 0⟩)
32	31	oveq2d 7433	. . . . . . . . 9 ⊢ (𝑏 = 0 → (⟨𝑋, 𝑌⟩(+_g‘𝑅)⟨𝑎, 𝑏⟩) = (⟨𝑋, 𝑌⟩(+_g‘𝑅)⟨𝑎, 0⟩))
33	32	eqeq2d 2773	. . . . . . . 8 ⊢ (𝑏 = 0 → (𝑒 = (⟨𝑋, 𝑌⟩(+_g‘𝑅)⟨𝑎, 𝑏⟩) ↔ 𝑒 = (⟨𝑋, 𝑌⟩(+_g‘𝑅)⟨𝑎, 0⟩)))
34	30, 33	rexsn 4646	. . . . . . 7 ⊢ (∃𝑏 ∈ {0}𝑒 = (⟨𝑋, 𝑌⟩(+_g‘𝑅)⟨𝑎, 𝑏⟩) ↔ 𝑒 = (⟨𝑋, 𝑌⟩(+_g‘𝑅)⟨𝑎, 0⟩))
35		zringbas 21672	. . . . . . . . 9 ⊢ ℤ = (Base‘ℤ_ring)
36		zringring 21668	. . . . . . . . . 10 ⊢ ℤ_ring ∈ Ring
37	36	a1i 11	. . . . . . . . 9 ⊢ (((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑎 ∈ ℤ) → ℤ_ring ∈ Ring)
38		simpll 779	. . . . . . . . 9 ⊢ (((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑎 ∈ ℤ) → 𝑋 ∈ ℤ)
39		simplr 781	. . . . . . . . 9 ⊢ (((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑎 ∈ ℤ) → 𝑌 ∈ ℤ)
40		simpr 490	. . . . . . . . 9 ⊢ (((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑎 ∈ ℤ) → 𝑎 ∈ ℤ)
41		0zd 12631	. . . . . . . . 9 ⊢ (((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑎 ∈ ℤ) → 0 ∈ ℤ)
42	38, 40	zaddcld 12733	. . . . . . . . 9 ⊢ (((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑎 ∈ ℤ) → (𝑋 + 𝑎) ∈ ℤ)
43		simpr 490	. . . . . . . . . . 11 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → 𝑌 ∈ ℤ)
44		0zd 12631	. . . . . . . . . . 11 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → 0 ∈ ℤ)
45	43, 44	zaddcld 12733	. . . . . . . . . 10 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → (𝑌 + 0) ∈ ℤ)
46	45	adantr 486	. . . . . . . . 9 ⊢ (((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑎 ∈ ℤ) → (𝑌 + 0) ∈ ℤ)
47		zringplusg 21673	. . . . . . . . 9 ⊢ + = (+_g‘ℤ_ring)
48	1, 35, 35, 37, 37, 38, 39, 40, 41, 42, 46, 47, 47, 16	xpsadd 17666	. . . . . . . 8 ⊢ (((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑎 ∈ ℤ) → (⟨𝑋, 𝑌⟩(+_g‘𝑅)⟨𝑎, 0⟩) = ⟨(𝑋 + 𝑎), (𝑌 + 0)⟩)
49	48	eqeq2d 2773	. . . . . . 7 ⊢ (((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑎 ∈ ℤ) → (𝑒 = (⟨𝑋, 𝑌⟩(+_g‘𝑅)⟨𝑎, 0⟩) ↔ 𝑒 = ⟨(𝑋 + 𝑎), (𝑌 + 0)⟩))
50	34, 49	bitrid 286	. . . . . 6 ⊢ (((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑎 ∈ ℤ) → (∃𝑏 ∈ {0}𝑒 = (⟨𝑋, 𝑌⟩(+_g‘𝑅)⟨𝑎, 𝑏⟩) ↔ 𝑒 = ⟨(𝑋 + 𝑎), (𝑌 + 0)⟩))
51	50	rexbidva 3186	. . . . 5 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → (∃𝑎 ∈ ℤ ∃𝑏 ∈ {0}𝑒 = (⟨𝑋, 𝑌⟩(+_g‘𝑅)⟨𝑎, 𝑏⟩) ↔ ∃𝑎 ∈ ℤ 𝑒 = ⟨(𝑋 + 𝑎), (𝑌 + 0)⟩))
52	51	abbidv 2828	. . . 4 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → {𝑒 ∣ ∃𝑎 ∈ ℤ ∃𝑏 ∈ {0}𝑒 = (⟨𝑋, 𝑌⟩(+_g‘𝑅)⟨𝑎, 𝑏⟩)} = {𝑒 ∣ ∃𝑎 ∈ ℤ 𝑒 = ⟨(𝑋 + 𝑎), (𝑌 + 0)⟩})
53		iunab 5014	. . . . . 6 ⊢ ∪ 𝑎 ∈ ℤ {𝑒 ∣ 𝑒 = ⟨(𝑋 + 𝑎), (𝑌 + 0)⟩} = {𝑒 ∣ ∃𝑎 ∈ ℤ 𝑒 = ⟨(𝑋 + 𝑎), (𝑌 + 0)⟩}
54	53	eqcomi 2771	. . . . 5 ⊢ {𝑒 ∣ ∃𝑎 ∈ ℤ 𝑒 = ⟨(𝑋 + 𝑎), (𝑌 + 0)⟩} = ∪ 𝑎 ∈ ℤ {𝑒 ∣ 𝑒 = ⟨(𝑋 + 𝑎), (𝑌 + 0)⟩}
55	54	a1i 11	. . . 4 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → {𝑒 ∣ ∃𝑎 ∈ ℤ 𝑒 = ⟨(𝑋 + 𝑎), (𝑌 + 0)⟩} = ∪ 𝑎 ∈ ℤ {𝑒 ∣ 𝑒 = ⟨(𝑋 + 𝑎), (𝑌 + 0)⟩})
56		zcn 12624	. . . . . . . . . . 11 ⊢ (𝑌 ∈ ℤ → 𝑌 ∈ ℂ)
57	56	adantl 487	. . . . . . . . . 10 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → 𝑌 ∈ ℂ)
58	57	addridd 11438	. . . . . . . . 9 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → (𝑌 + 0) = 𝑌)
59	58	opeq2d 4843	. . . . . . . 8 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → ⟨(𝑋 + 𝑎), (𝑌 + 0)⟩ = ⟨(𝑋 + 𝑎), 𝑌⟩)
60	59	eqeq2d 2773	. . . . . . 7 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → (𝑒 = ⟨(𝑋 + 𝑎), (𝑌 + 0)⟩ ↔ 𝑒 = ⟨(𝑋 + 𝑎), 𝑌⟩))
61	60	abbidv 2828	. . . . . 6 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → {𝑒 ∣ 𝑒 = ⟨(𝑋 + 𝑎), (𝑌 + 0)⟩} = {𝑒 ∣ 𝑒 = ⟨(𝑋 + 𝑎), 𝑌⟩})
62	61	iuneq2d 4985	. . . . 5 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → ∪ 𝑎 ∈ ℤ {𝑒 ∣ 𝑒 = ⟨(𝑋 + 𝑎), (𝑌 + 0)⟩} = ∪ 𝑎 ∈ ℤ {𝑒 ∣ 𝑒 = ⟨(𝑋 + 𝑎), 𝑌⟩})
63		df-sn 4588	. . . . . . . . 9 ⊢ {⟨(𝑋 + 𝑎), 𝑌⟩} = {𝑒 ∣ 𝑒 = ⟨(𝑋 + 𝑎), 𝑌⟩}
64	63	eqcomi 2771	. . . . . . . 8 ⊢ {𝑒 ∣ 𝑒 = ⟨(𝑋 + 𝑎), 𝑌⟩} = {⟨(𝑋 + 𝑎), 𝑌⟩}
65	64	a1i 11	. . . . . . 7 ⊢ (𝑎 ∈ ℤ → {𝑒 ∣ 𝑒 = ⟨(𝑋 + 𝑎), 𝑌⟩} = {⟨(𝑋 + 𝑎), 𝑌⟩})
66	65	iuneq2i 4976	. . . . . 6 ⊢ ∪ 𝑎 ∈ ℤ {𝑒 ∣ 𝑒 = ⟨(𝑋 + 𝑎), 𝑌⟩} = ∪ 𝑎 ∈ ℤ {⟨(𝑋 + 𝑎), 𝑌⟩}
67	66	a1i 11	. . . . 5 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → ∪ 𝑎 ∈ ℤ {𝑒 ∣ 𝑒 = ⟨(𝑋 + 𝑎), 𝑌⟩} = ∪ 𝑎 ∈ ℤ {⟨(𝑋 + 𝑎), 𝑌⟩})
68		velsn 4603	. . . . . . . . . 10 ⊢ (𝑦 ∈ {⟨(𝑋 + 𝑎), 𝑌⟩} ↔ 𝑦 = ⟨(𝑋 + 𝑎), 𝑌⟩)
69	68	rexbii 3111	. . . . . . . . 9 ⊢ (∃𝑎 ∈ ℤ 𝑦 ∈ {⟨(𝑋 + 𝑎), 𝑌⟩} ↔ ∃𝑎 ∈ ℤ 𝑦 = ⟨(𝑋 + 𝑎), 𝑌⟩)
70	42	adantr 486	. . . . . . . . . . . . 13 ⊢ ((((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑎 ∈ ℤ) ∧ 𝑦 = ⟨(𝑋 + 𝑎), 𝑌⟩) → (𝑋 + 𝑎) ∈ ℤ)
71		simplr 781	. . . . . . . . . . . . . 14 ⊢ (((((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑎 ∈ ℤ) ∧ 𝑦 = ⟨(𝑋 + 𝑎), 𝑌⟩) ∧ 𝑏 = (𝑋 + 𝑎)) → 𝑦 = ⟨(𝑋 + 𝑎), 𝑌⟩)
72		opeq1 4836	. . . . . . . . . . . . . . 15 ⊢ (𝑏 = (𝑋 + 𝑎) → ⟨𝑏, 𝑌⟩ = ⟨(𝑋 + 𝑎), 𝑌⟩)
73	72	adantl 487	. . . . . . . . . . . . . 14 ⊢ (((((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑎 ∈ ℤ) ∧ 𝑦 = ⟨(𝑋 + 𝑎), 𝑌⟩) ∧ 𝑏 = (𝑋 + 𝑎)) → ⟨𝑏, 𝑌⟩ = ⟨(𝑋 + 𝑎), 𝑌⟩)
74	71, 73	eqeq12d 2778	. . . . . . . . . . . . 13 ⊢ (((((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑎 ∈ ℤ) ∧ 𝑦 = ⟨(𝑋 + 𝑎), 𝑌⟩) ∧ 𝑏 = (𝑋 + 𝑎)) → (𝑦 = ⟨𝑏, 𝑌⟩ ↔ ⟨(𝑋 + 𝑎), 𝑌⟩ = ⟨(𝑋 + 𝑎), 𝑌⟩))
75		eqidd 2763	. . . . . . . . . . . . 13 ⊢ ((((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑎 ∈ ℤ) ∧ 𝑦 = ⟨(𝑋 + 𝑎), 𝑌⟩) → ⟨(𝑋 + 𝑎), 𝑌⟩ = ⟨(𝑋 + 𝑎), 𝑌⟩)
76	70, 74, 75	rspcedvd 3581	. . . . . . . . . . . 12 ⊢ ((((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑎 ∈ ℤ) ∧ 𝑦 = ⟨(𝑋 + 𝑎), 𝑌⟩) → ∃𝑏 ∈ ℤ 𝑦 = ⟨𝑏, 𝑌⟩)
77	76	ex 418	. . . . . . . . . . 11 ⊢ (((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑎 ∈ ℤ) → (𝑦 = ⟨(𝑋 + 𝑎), 𝑌⟩ → ∃𝑏 ∈ ℤ 𝑦 = ⟨𝑏, 𝑌⟩))
78	77	rexlimdva 3165	. . . . . . . . . 10 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → (∃𝑎 ∈ ℤ 𝑦 = ⟨(𝑋 + 𝑎), 𝑌⟩ → ∃𝑏 ∈ ℤ 𝑦 = ⟨𝑏, 𝑌⟩))
79		simpr 490	. . . . . . . . . . . . . . 15 ⊢ (((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑏 ∈ ℤ) → 𝑏 ∈ ℤ)
80		simpll 779	. . . . . . . . . . . . . . 15 ⊢ (((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑏 ∈ ℤ) → 𝑋 ∈ ℤ)
81	79, 80	zsubcld 12734	. . . . . . . . . . . . . 14 ⊢ (((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑏 ∈ ℤ) → (𝑏 − 𝑋) ∈ ℤ)
82	81	adantr 486	. . . . . . . . . . . . 13 ⊢ ((((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑏 ∈ ℤ) ∧ 𝑦 = ⟨𝑏, 𝑌⟩) → (𝑏 − 𝑋) ∈ ℤ)
83		simplr 781	. . . . . . . . . . . . . 14 ⊢ (((((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑏 ∈ ℤ) ∧ 𝑦 = ⟨𝑏, 𝑌⟩) ∧ 𝑎 = (𝑏 − 𝑋)) → 𝑦 = ⟨𝑏, 𝑌⟩)
84		oveq2 7425	. . . . . . . . . . . . . . . 16 ⊢ (𝑎 = (𝑏 − 𝑋) → (𝑋 + 𝑎) = (𝑋 + (𝑏 − 𝑋)))
85	84	adantl 487	. . . . . . . . . . . . . . 15 ⊢ (((((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑏 ∈ ℤ) ∧ 𝑦 = ⟨𝑏, 𝑌⟩) ∧ 𝑎 = (𝑏 − 𝑋)) → (𝑋 + 𝑎) = (𝑋 + (𝑏 − 𝑋)))
86	85	opeq1d 4842	. . . . . . . . . . . . . 14 ⊢ (((((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑏 ∈ ℤ) ∧ 𝑦 = ⟨𝑏, 𝑌⟩) ∧ 𝑎 = (𝑏 − 𝑋)) → ⟨(𝑋 + 𝑎), 𝑌⟩ = ⟨(𝑋 + (𝑏 − 𝑋)), 𝑌⟩)
87	83, 86	eqeq12d 2778	. . . . . . . . . . . . 13 ⊢ (((((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑏 ∈ ℤ) ∧ 𝑦 = ⟨𝑏, 𝑌⟩) ∧ 𝑎 = (𝑏 − 𝑋)) → (𝑦 = ⟨(𝑋 + 𝑎), 𝑌⟩ ↔ ⟨𝑏, 𝑌⟩ = ⟨(𝑋 + (𝑏 − 𝑋)), 𝑌⟩))
88		zcn 12624	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑋 ∈ ℤ → 𝑋 ∈ ℂ)
89	88	adantr 486	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → 𝑋 ∈ ℂ)
90	89	adantr 486	. . . . . . . . . . . . . . . . 17 ⊢ (((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑏 ∈ ℤ) → 𝑋 ∈ ℂ)
91		zcn 12624	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑏 ∈ ℤ → 𝑏 ∈ ℂ)
92	91	adantl 487	. . . . . . . . . . . . . . . . 17 ⊢ (((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑏 ∈ ℤ) → 𝑏 ∈ ℂ)
93	90, 92	pncan3d 11600	. . . . . . . . . . . . . . . 16 ⊢ (((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑏 ∈ ℤ) → (𝑋 + (𝑏 − 𝑋)) = 𝑏)
94	93	eqcomd 2768	. . . . . . . . . . . . . . 15 ⊢ (((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑏 ∈ ℤ) → 𝑏 = (𝑋 + (𝑏 − 𝑋)))
95	94	adantr 486	. . . . . . . . . . . . . 14 ⊢ ((((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑏 ∈ ℤ) ∧ 𝑦 = ⟨𝑏, 𝑌⟩) → 𝑏 = (𝑋 + (𝑏 − 𝑋)))
96	95	opeq1d 4842	. . . . . . . . . . . . 13 ⊢ ((((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑏 ∈ ℤ) ∧ 𝑦 = ⟨𝑏, 𝑌⟩) → ⟨𝑏, 𝑌⟩ = ⟨(𝑋 + (𝑏 − 𝑋)), 𝑌⟩)
97	82, 87, 96	rspcedvd 3581	. . . . . . . . . . . 12 ⊢ ((((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑏 ∈ ℤ) ∧ 𝑦 = ⟨𝑏, 𝑌⟩) → ∃𝑎 ∈ ℤ 𝑦 = ⟨(𝑋 + 𝑎), 𝑌⟩)
98	97	ex 418	. . . . . . . . . . 11 ⊢ (((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) ∧ 𝑏 ∈ ℤ) → (𝑦 = ⟨𝑏, 𝑌⟩ → ∃𝑎 ∈ ℤ 𝑦 = ⟨(𝑋 + 𝑎), 𝑌⟩))
99	98	rexlimdva 3165	. . . . . . . . . 10 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → (∃𝑏 ∈ ℤ 𝑦 = ⟨𝑏, 𝑌⟩ → ∃𝑎 ∈ ℤ 𝑦 = ⟨(𝑋 + 𝑎), 𝑌⟩))
100	78, 99	impbid 215	. . . . . . . . 9 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → (∃𝑎 ∈ ℤ 𝑦 = ⟨(𝑋 + 𝑎), 𝑌⟩ ↔ ∃𝑏 ∈ ℤ 𝑦 = ⟨𝑏, 𝑌⟩))
101	69, 100	bitrid 286	. . . . . . . 8 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → (∃𝑎 ∈ ℤ 𝑦 ∈ {⟨(𝑋 + 𝑎), 𝑌⟩} ↔ ∃𝑏 ∈ ℤ 𝑦 = ⟨𝑏, 𝑌⟩))
102		opeq2 4837	. . . . . . . . . . . . 13 ⊢ (𝑐 = 𝑌 → ⟨𝑏, 𝑐⟩ = ⟨𝑏, 𝑌⟩)
103	102	eqeq2d 2773	. . . . . . . . . . . 12 ⊢ (𝑐 = 𝑌 → (𝑦 = ⟨𝑏, 𝑐⟩ ↔ 𝑦 = ⟨𝑏, 𝑌⟩))
104	103	rexsng 4640	. . . . . . . . . . 11 ⊢ (𝑌 ∈ ℤ → (∃𝑐 ∈ {𝑌}𝑦 = ⟨𝑏, 𝑐⟩ ↔ 𝑦 = ⟨𝑏, 𝑌⟩))
105	104	adantl 487	. . . . . . . . . 10 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → (∃𝑐 ∈ {𝑌}𝑦 = ⟨𝑏, 𝑐⟩ ↔ 𝑦 = ⟨𝑏, 𝑌⟩))
106	105	bicomd 226	. . . . . . . . 9 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → (𝑦 = ⟨𝑏, 𝑌⟩ ↔ ∃𝑐 ∈ {𝑌}𝑦 = ⟨𝑏, 𝑐⟩))
107	106	rexbidv 3188	. . . . . . . 8 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → (∃𝑏 ∈ ℤ 𝑦 = ⟨𝑏, 𝑌⟩ ↔ ∃𝑏 ∈ ℤ ∃𝑐 ∈ {𝑌}𝑦 = ⟨𝑏, 𝑐⟩))
108	101, 107	bitrd 282	. . . . . . 7 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → (∃𝑎 ∈ ℤ 𝑦 ∈ {⟨(𝑋 + 𝑎), 𝑌⟩} ↔ ∃𝑏 ∈ ℤ ∃𝑐 ∈ {𝑌}𝑦 = ⟨𝑏, 𝑐⟩))
109		eliun 4958	. . . . . . 7 ⊢ (𝑦 ∈ ∪ 𝑎 ∈ ℤ {⟨(𝑋 + 𝑎), 𝑌⟩} ↔ ∃𝑎 ∈ ℤ 𝑦 ∈ {⟨(𝑋 + 𝑎), 𝑌⟩})
110		elxp2 5683	. . . . . . 7 ⊢ (𝑦 ∈ (ℤ × {𝑌}) ↔ ∃𝑏 ∈ ℤ ∃𝑐 ∈ {𝑌}𝑦 = ⟨𝑏, 𝑐⟩)
111	108, 109, 110	3bitr4g 317	. . . . . 6 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → (𝑦 ∈ ∪ 𝑎 ∈ ℤ {⟨(𝑋 + 𝑎), 𝑌⟩} ↔ 𝑦 ∈ (ℤ × {𝑌})))
112	111	eqrdv 2760	. . . . 5 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → ∪ 𝑎 ∈ ℤ {⟨(𝑋 + 𝑎), 𝑌⟩} = (ℤ × {𝑌}))
113	62, 67, 112	3eqtrd 2801	. . . 4 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → ∪ 𝑎 ∈ ℤ {𝑒 ∣ 𝑒 = ⟨(𝑋 + 𝑎), (𝑌 + 0)⟩} = (ℤ × {𝑌}))
114	52, 55, 113	3eqtrd 2801	. . 3 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → {𝑒 ∣ ∃𝑎 ∈ ℤ ∃𝑏 ∈ {0}𝑒 = (⟨𝑋, 𝑌⟩(+_g‘𝑅)⟨𝑎, 𝑏⟩)} = (ℤ × {𝑌}))
115	22, 29, 114	3eqtrd 2801	. 2 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → ran (𝑥 ∈ 𝐼 ↦ (⟨𝑋, 𝑌⟩(+_g‘𝑅)𝑥)) = (ℤ × {𝑌}))
116	18, 19, 115	3eqtrd 2801	1 ⊢ ((𝑋 ∈ ℤ ∧ 𝑌 ∈ ℤ) → [⟨𝑋, 𝑌⟩] ∼ = (ℤ × {𝑌}))

Colors of variables: wff setvar class

This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2145 {cab 2740 ∃wrex 3088 ⊆ wss 3902 {csn 4587 ⟨cop 4593 ∪ ciun 4954 ↦ cmpt 5190 × cxp 5657 ran crn 5660 “ cima 5662 ‘cfv 6537 (class class class)co 7417 [cec 8698 ℂcc 11126 0cc0 11128 + caddc 11131 − cmin 11469 ℤcz 12619 Basecbs 17307 ↾_s cress 17328 +_gcplusg 17348 ×_s cxps 17598 Grpcgrp 19063 ~_QG cqg 19251 Rngcrng 20293 1_rcur 20326 Ringcrg 20378 ℤ_ringczring 21665

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 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2734 ax-rep 5236 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 ax-un 7740 ax-cnex 11184 ax-resscn 11185 ax-1cn 11186 ax-icn 11187 ax-addcl 11188 ax-addrcl 11189 ax-mulcl 11190 ax-mulrcl 11191 ax-mulcom 11192 ax-addass 11193 ax-mulass 11194 ax-distr 11195 ax-i2m1 11196 ax-1ne0 11197 ax-1rid 11198 ax-rnegex 11199 ax-rrecex 11200 ax-cnre 11201 ax-pre-lttri 11202 ax-pre-lttrn 11203 ax-pre-ltadd 11204 ax-pre-mulgt0 11205 ax-addf 11207

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 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3064 df-ral 3079 df-rex 3089 df-rmo 3367 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-tp 4592 df-op 4594 df-uni 4871 df-iun 4956 df-br 5108 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5554 df-eprel 5559 df-po 5567 df-so 5568 df-fr 5612 df-we 5614 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7374 df-ov 7420 df-oprab 7421 df-mpo 7422 df-om 7867 df-1st 7990 df-2nd 7991 df-frecs 8284 df-wrecs 8315 df-recs 8364 df-rdg 8403 df-1o 8459 df-2o 8460 df-er 8700 df-ec 8702 df-map 8832 df-ixp 8909 df-en 8957 df-dom 8958 df-sdom 8959 df-fin 8960 df-sup 9416 df-inf 9417 df-pnf 11273 df-mnf 11274 df-xr 11275 df-ltxr 11276 df-le 11277 df-sub 11471 df-neg 11472 df-nn 12262 df-2 12331 df-3 12332 df-4 12333 df-5 12334 df-6 12335 df-7 12336 df-8 12337 df-9 12338 df-n0 12533 df-z 12620 df-dec 12741 df-uz 12892 df-fz 13566 df-struct 17245 df-sets 17262 df-slot 17280 df-ndx 17292 df-base 17308 df-ress 17329 df-plusg 17361 df-mulr 17362 df-starv 17363 df-sca 17364 df-vsca 17365 df-ip 17366 df-tset 17367 df-ple 17368 df-ds 17370 df-unif 17371 df-hom 17372 df-cco 17373 df-0g 17532 df-prds 17538 df-imas 17600 df-xps 17602 df-mgm 18736 df-sgrp 18827 df-mnd 18843 df-grp 19066 df-minusg 19067 df-subg 19252 df-eqg 19254 df-cmn 19915 df-abl 19916 df-mgp 20280 df-rng 20294 df-ur 20327 df-ring 20380 df-cring 20381 df-subrng 20714 df-subrg 20738 df-cnfld 21592 df-zring 21666

This theorem is used by: pzriprnglem11 21710 pzriprnglem12 21711

W3C validator