Theorem mulgfval 19045

Description: Group multiple (exponentiation) operation. For a shorter proof using ax-rep 5212, see mulgfvalALT 19046. (Contributed by Mario Carneiro, 11-Dec-2014.) Remove dependency on ax-rep 5212. (Revised by Rohan Ridenour, 17-Aug-2023.)

Hypotheses

Ref	Expression
mulgval.b	⊢ 𝐵 = (Base‘𝐺)
mulgval.p	⊢ + = (+g‘𝐺)
mulgval.o	⊢ 0 = (0g‘𝐺)
mulgval.i	⊢ 𝐼 = (invg‘𝐺)
mulgval.t	⊢ · = (.g‘𝐺)

Assertion

Ref	Expression
mulgfval	⊢ · = (𝑛 ∈ ℤ, 𝑥 ∈ 𝐵 ↦ if(𝑛 = 0, 0 , if(0 < 𝑛, (seq1( + , (ℕ × {𝑥}))‘𝑛), (𝐼‘(seq1( + , (ℕ × {𝑥}))‘-𝑛)))))

Distinct variable groups:   𝑥, 0 ,𝑛   𝑥,𝐵,𝑛   𝑥, + ,𝑛   𝑥,𝐺,𝑛   𝑥,𝐼,𝑛

Allowed substitution hints:   · (𝑥,𝑛)

Proof of Theorem mulgfval

Dummy variables 𝑤 𝑠 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		mulgval.t	. 2 ⊢ · = (.g‘𝐺)
2		eqidd 2737	. . . . 5 ⊢ (𝑤 = 𝐺 → ℤ = ℤ)
3		fveq2 6840	. . . . . 6 ⊢ (𝑤 = 𝐺 → (Base‘𝑤) = (Base‘𝐺))
4		mulgval.b	. . . . . 6 ⊢ 𝐵 = (Base‘𝐺)
5	3, 4	eqtr4di 2789	. . . . 5 ⊢ (𝑤 = 𝐺 → (Base‘𝑤) = 𝐵)
6		fveq2 6840	. . . . . . 7 ⊢ (𝑤 = 𝐺 → (0g‘𝑤) = (0g‘𝐺))
7		mulgval.o	. . . . . . 7 ⊢ 0 = (0g‘𝐺)
8	6, 7	eqtr4di 2789	. . . . . 6 ⊢ (𝑤 = 𝐺 → (0g‘𝑤) = 0 )
9		fvex 6853	. . . . . . . . 9 ⊢ (+g‘𝑤) ∈ V
10		1z 12557	. . . . . . . . 9 ⊢ 1 ∈ ℤ
11	9, 10	seqexw 13979	. . . . . . . 8 ⊢ seq1((+g‘𝑤), (ℕ × {𝑥})) ∈ V
12	11	a1i 11	. . . . . . 7 ⊢ (𝑤 = 𝐺 → seq1((+g‘𝑤), (ℕ × {𝑥})) ∈ V)
13		id 22	. . . . . . . . . 10 ⊢ (𝑠 = seq1((+g‘𝑤), (ℕ × {𝑥})) → 𝑠 = seq1((+g‘𝑤), (ℕ × {𝑥})))
14		fveq2 6840	. . . . . . . . . . . 12 ⊢ (𝑤 = 𝐺 → (+g‘𝑤) = (+g‘𝐺))
15		mulgval.p	. . . . . . . . . . . 12 ⊢ + = (+g‘𝐺)
16	14, 15	eqtr4di 2789	. . . . . . . . . . 11 ⊢ (𝑤 = 𝐺 → (+g‘𝑤) = + )
17	16	seqeq2d 13970	. . . . . . . . . 10 ⊢ (𝑤 = 𝐺 → seq1((+g‘𝑤), (ℕ × {𝑥})) = seq1( + , (ℕ × {𝑥})))
18	13, 17	sylan9eqr 2793	. . . . . . . . 9 ⊢ ((𝑤 = 𝐺 ∧ 𝑠 = seq1((+g‘𝑤), (ℕ × {𝑥}))) → 𝑠 = seq1( + , (ℕ × {𝑥})))
19	18	fveq1d 6842	. . . . . . . 8 ⊢ ((𝑤 = 𝐺 ∧ 𝑠 = seq1((+g‘𝑤), (ℕ × {𝑥}))) → (𝑠‘𝑛) = (seq1( + , (ℕ × {𝑥}))‘𝑛))
20		simpl 482	. . . . . . . . . . 11 ⊢ ((𝑤 = 𝐺 ∧ 𝑠 = seq1((+g‘𝑤), (ℕ × {𝑥}))) → 𝑤 = 𝐺)
21	20	fveq2d 6844	. . . . . . . . . 10 ⊢ ((𝑤 = 𝐺 ∧ 𝑠 = seq1((+g‘𝑤), (ℕ × {𝑥}))) → (invg‘𝑤) = (invg‘𝐺))
22		mulgval.i	. . . . . . . . . 10 ⊢ 𝐼 = (invg‘𝐺)
23	21, 22	eqtr4di 2789	. . . . . . . . 9 ⊢ ((𝑤 = 𝐺 ∧ 𝑠 = seq1((+g‘𝑤), (ℕ × {𝑥}))) → (invg‘𝑤) = 𝐼)
24	18	fveq1d 6842	. . . . . . . . 9 ⊢ ((𝑤 = 𝐺 ∧ 𝑠 = seq1((+g‘𝑤), (ℕ × {𝑥}))) → (𝑠‘-𝑛) = (seq1( + , (ℕ × {𝑥}))‘-𝑛))
25	23, 24	fveq12d 6847	. . . . . . . 8 ⊢ ((𝑤 = 𝐺 ∧ 𝑠 = seq1((+g‘𝑤), (ℕ × {𝑥}))) → ((invg‘𝑤)‘(𝑠‘-𝑛)) = (𝐼‘(seq1( + , (ℕ × {𝑥}))‘-𝑛)))
26	19, 25	ifeq12d 4488	. . . . . . 7 ⊢ ((𝑤 = 𝐺 ∧ 𝑠 = seq1((+g‘𝑤), (ℕ × {𝑥}))) → if(0 < 𝑛, (𝑠‘𝑛), ((invg‘𝑤)‘(𝑠‘-𝑛))) = if(0 < 𝑛, (seq1( + , (ℕ × {𝑥}))‘𝑛), (𝐼‘(seq1( + , (ℕ × {𝑥}))‘-𝑛))))
27	12, 26	csbied 3873	. . . . . 6 ⊢ (𝑤 = 𝐺 → ⦋seq1((+g‘𝑤), (ℕ × {𝑥})) / 𝑠⦌if(0 < 𝑛, (𝑠‘𝑛), ((invg‘𝑤)‘(𝑠‘-𝑛))) = if(0 < 𝑛, (seq1( + , (ℕ × {𝑥}))‘𝑛), (𝐼‘(seq1( + , (ℕ × {𝑥}))‘-𝑛))))
28	8, 27	ifeq12d 4488	. . . . 5 ⊢ (𝑤 = 𝐺 → if(𝑛 = 0, (0g‘𝑤), ⦋seq1((+g‘𝑤), (ℕ × {𝑥})) / 𝑠⦌if(0 < 𝑛, (𝑠‘𝑛), ((invg‘𝑤)‘(𝑠‘-𝑛)))) = if(𝑛 = 0, 0 , if(0 < 𝑛, (seq1( + , (ℕ × {𝑥}))‘𝑛), (𝐼‘(seq1( + , (ℕ × {𝑥}))‘-𝑛)))))
29	2, 5, 28	mpoeq123dv 7442	. . . 4 ⊢ (𝑤 = 𝐺 → (𝑛 ∈ ℤ, 𝑥 ∈ (Base‘𝑤) ↦ if(𝑛 = 0, (0g‘𝑤), ⦋seq1((+g‘𝑤), (ℕ × {𝑥})) / 𝑠⦌if(0 < 𝑛, (𝑠‘𝑛), ((invg‘𝑤)‘(𝑠‘-𝑛))))) = (𝑛 ∈ ℤ, 𝑥 ∈ 𝐵 ↦ if(𝑛 = 0, 0 , if(0 < 𝑛, (seq1( + , (ℕ × {𝑥}))‘𝑛), (𝐼‘(seq1( + , (ℕ × {𝑥}))‘-𝑛))))))
30		df-mulg 19044	. . . 4 ⊢ .g = (𝑤 ∈ V ↦ (𝑛 ∈ ℤ, 𝑥 ∈ (Base‘𝑤) ↦ if(𝑛 = 0, (0g‘𝑤), ⦋seq1((+g‘𝑤), (ℕ × {𝑥})) / 𝑠⦌if(0 < 𝑛, (𝑠‘𝑛), ((invg‘𝑤)‘(𝑠‘-𝑛))))))
31		zex 12533	. . . . 5 ⊢ ℤ ∈ V
32	4	fvexi 6854	. . . . 5 ⊢ 𝐵 ∈ V
33		snex 5381	. . . . . 6 ⊢ { 0 } ∈ V
34	15	fvexi 6854	. . . . . . . . 9 ⊢ + ∈ V
35	34	rnex 7861	. . . . . . . 8 ⊢ ran + ∈ V
36	35, 32	unex 7698	. . . . . . 7 ⊢ (ran + ∪ 𝐵) ∈ V
37	22	fvexi 6854	. . . . . . . . 9 ⊢ 𝐼 ∈ V
38	37	rnex 7861	. . . . . . . 8 ⊢ ran 𝐼 ∈ V
39		p0ex 5326	. . . . . . . 8 ⊢ {∅} ∈ V
40	38, 39	unex 7698	. . . . . . 7 ⊢ (ran 𝐼 ∪ {∅}) ∈ V
41	36, 40	unex 7698	. . . . . 6 ⊢ ((ran + ∪ 𝐵) ∪ (ran 𝐼 ∪ {∅})) ∈ V
42	33, 41	unex 7698	. . . . 5 ⊢ ({ 0 } ∪ ((ran + ∪ 𝐵) ∪ (ran 𝐼 ∪ {∅}))) ∈ V
43		ssun1 4118	. . . . . . . . 9 ⊢ { 0 } ⊆ ({ 0 } ∪ ((ran + ∪ 𝐵) ∪ (ran 𝐼 ∪ {∅})))
44	7	fvexi 6854	. . . . . . . . . 10 ⊢ 0 ∈ V
45	44	snid 4606	. . . . . . . . 9 ⊢ 0 ∈ { 0 }
46	43, 45	sselii 3918	. . . . . . . 8 ⊢ 0 ∈ ({ 0 } ∪ ((ran + ∪ 𝐵) ∪ (ran 𝐼 ∪ {∅})))
47	46	a1i 11	. . . . . . 7 ⊢ ((𝑛 ∈ ℤ ∧ 𝑥 ∈ 𝐵) → 0 ∈ ({ 0 } ∪ ((ran + ∪ 𝐵) ∪ (ran 𝐼 ∪ {∅}))))
48		ssun2 4119	. . . . . . . . . . . . . 14 ⊢ 𝐵 ⊆ (ran + ∪ 𝐵)
49		ssun1 4118	. . . . . . . . . . . . . 14 ⊢ (ran + ∪ 𝐵) ⊆ ((ran + ∪ 𝐵) ∪ (ran 𝐼 ∪ {∅}))
50	48, 49	sstri 3931	. . . . . . . . . . . . 13 ⊢ 𝐵 ⊆ ((ran + ∪ 𝐵) ∪ (ran 𝐼 ∪ {∅}))
51		ssun2 4119	. . . . . . . . . . . . 13 ⊢ ((ran + ∪ 𝐵) ∪ (ran 𝐼 ∪ {∅})) ⊆ ({ 0 } ∪ ((ran + ∪ 𝐵) ∪ (ran 𝐼 ∪ {∅})))
52	50, 51	sstri 3931	. . . . . . . . . . . 12 ⊢ 𝐵 ⊆ ({ 0 } ∪ ((ran + ∪ 𝐵) ∪ (ran 𝐼 ∪ {∅})))
53		fveq2 6840	. . . . . . . . . . . . . 14 ⊢ (𝑛 = 1 → (seq1( + , (ℕ × {𝑥}))‘𝑛) = (seq1( + , (ℕ × {𝑥}))‘1))
54	53	adantl 481	. . . . . . . . . . . . 13 ⊢ ((𝑥 ∈ 𝐵 ∧ 𝑛 = 1) → (seq1( + , (ℕ × {𝑥}))‘𝑛) = (seq1( + , (ℕ × {𝑥}))‘1))
55		seq1 13976	. . . . . . . . . . . . . . . 16 ⊢ (1 ∈ ℤ → (seq1( + , (ℕ × {𝑥}))‘1) = ((ℕ × {𝑥})‘1))
56	10, 55	ax-mp 5	. . . . . . . . . . . . . . 15 ⊢ (seq1( + , (ℕ × {𝑥}))‘1) = ((ℕ × {𝑥})‘1)
57		1nn 12185	. . . . . . . . . . . . . . . . . 18 ⊢ 1 ∈ ℕ
58		vex 3433	. . . . . . . . . . . . . . . . . . 19 ⊢ 𝑥 ∈ V
59	58	fvconst2 7159	. . . . . . . . . . . . . . . . . 18 ⊢ (1 ∈ ℕ → ((ℕ × {𝑥})‘1) = 𝑥)
60	57, 59	ax-mp 5	. . . . . . . . . . . . . . . . 17 ⊢ ((ℕ × {𝑥})‘1) = 𝑥
61	60	eleq1i 2827	. . . . . . . . . . . . . . . 16 ⊢ (((ℕ × {𝑥})‘1) ∈ 𝐵 ↔ 𝑥 ∈ 𝐵)
62	61	biimpri 228	. . . . . . . . . . . . . . 15 ⊢ (𝑥 ∈ 𝐵 → ((ℕ × {𝑥})‘1) ∈ 𝐵)
63	56, 62	eqeltrid 2840	. . . . . . . . . . . . . 14 ⊢ (𝑥 ∈ 𝐵 → (seq1( + , (ℕ × {𝑥}))‘1) ∈ 𝐵)
64	63	adantr 480	. . . . . . . . . . . . 13 ⊢ ((𝑥 ∈ 𝐵 ∧ 𝑛 = 1) → (seq1( + , (ℕ × {𝑥}))‘1) ∈ 𝐵)
65	54, 64	eqeltrd 2836	. . . . . . . . . . . 12 ⊢ ((𝑥 ∈ 𝐵 ∧ 𝑛 = 1) → (seq1( + , (ℕ × {𝑥}))‘𝑛) ∈ 𝐵)
66	52, 65	sselid 3919	. . . . . . . . . . 11 ⊢ ((𝑥 ∈ 𝐵 ∧ 𝑛 = 1) → (seq1( + , (ℕ × {𝑥}))‘𝑛) ∈ ({ 0 } ∪ ((ran + ∪ 𝐵) ∪ (ran 𝐼 ∪ {∅}))))
67	66	ad4ant24 755	. . . . . . . . . 10 ⊢ ((((𝑛 ∈ ℤ ∧ 𝑥 ∈ 𝐵) ∧ 𝑛 ∈ (ℤ≥‘1)) ∧ 𝑛 = 1) → (seq1( + , (ℕ × {𝑥}))‘𝑛) ∈ ({ 0 } ∪ ((ran + ∪ 𝐵) ∪ (ran 𝐼 ∪ {∅}))))
68		zcn 12529	. . . . . . . . . . . . . . 15 ⊢ (𝑛 ∈ ℤ → 𝑛 ∈ ℂ)
69		npcan1 11575	. . . . . . . . . . . . . . 15 ⊢ (𝑛 ∈ ℂ → ((𝑛 − 1) + 1) = 𝑛)
70	68, 69	syl 17	. . . . . . . . . . . . . 14 ⊢ (𝑛 ∈ ℤ → ((𝑛 − 1) + 1) = 𝑛)
71	70	fveq2d 6844	. . . . . . . . . . . . 13 ⊢ (𝑛 ∈ ℤ → (seq1( + , (ℕ × {𝑥}))‘((𝑛 − 1) + 1)) = (seq1( + , (ℕ × {𝑥}))‘𝑛))
72	71	adantr 480	. . . . . . . . . . . 12 ⊢ ((𝑛 ∈ ℤ ∧ (𝑛 − 1) ∈ (ℤ≥‘1)) → (seq1( + , (ℕ × {𝑥}))‘((𝑛 − 1) + 1)) = (seq1( + , (ℕ × {𝑥}))‘𝑛))
73		seqp1 13978	. . . . . . . . . . . . . 14 ⊢ ((𝑛 − 1) ∈ (ℤ≥‘1) → (seq1( + , (ℕ × {𝑥}))‘((𝑛 − 1) + 1)) = ((seq1( + , (ℕ × {𝑥}))‘(𝑛 − 1)) + ((ℕ × {𝑥})‘((𝑛 − 1) + 1))))
74		ssun1 4118	. . . . . . . . . . . . . . . . 17 ⊢ ran + ⊆ (ran + ∪ 𝐵)
75		ssun2 4119	. . . . . . . . . . . . . . . . 17 ⊢ {∅} ⊆ (ran 𝐼 ∪ {∅})
76		unss12 4128	. . . . . . . . . . . . . . . . 17 ⊢ ((ran + ⊆ (ran + ∪ 𝐵) ∧ {∅} ⊆ (ran 𝐼 ∪ {∅})) → (ran + ∪ {∅}) ⊆ ((ran + ∪ 𝐵) ∪ (ran 𝐼 ∪ {∅})))
77	74, 75, 76	mp2an 693	. . . . . . . . . . . . . . . 16 ⊢ (ran + ∪ {∅}) ⊆ ((ran + ∪ 𝐵) ∪ (ran 𝐼 ∪ {∅}))
78	77, 51	sstri 3931	. . . . . . . . . . . . . . 15 ⊢ (ran + ∪ {∅}) ⊆ ({ 0 } ∪ ((ran + ∪ 𝐵) ∪ (ran 𝐼 ∪ {∅})))
79		df-ov 7370	. . . . . . . . . . . . . . . 16 ⊢ ((seq1( + , (ℕ × {𝑥}))‘(𝑛 − 1)) + ((ℕ × {𝑥})‘((𝑛 − 1) + 1))) = ( + ‘⟨(seq1( + , (ℕ × {𝑥}))‘(𝑛 − 1)), ((ℕ × {𝑥})‘((𝑛 − 1) + 1))⟩)
80		fvrn0 6868	. . . . . . . . . . . . . . . 16 ⊢ ( + ‘⟨(seq1( + , (ℕ × {𝑥}))‘(𝑛 − 1)), ((ℕ × {𝑥})‘((𝑛 − 1) + 1))⟩) ∈ (ran + ∪ {∅})
81	79, 80	eqeltri 2832	. . . . . . . . . . . . . . 15 ⊢ ((seq1( + , (ℕ × {𝑥}))‘(𝑛 − 1)) + ((ℕ × {𝑥})‘((𝑛 − 1) + 1))) ∈ (ran + ∪ {∅})
82	78, 81	sselii 3918	. . . . . . . . . . . . . 14 ⊢ ((seq1( + , (ℕ × {𝑥}))‘(𝑛 − 1)) + ((ℕ × {𝑥})‘((𝑛 − 1) + 1))) ∈ ({ 0 } ∪ ((ran + ∪ 𝐵) ∪ (ran 𝐼 ∪ {∅})))
83	73, 82	eqeltrdi 2844	. . . . . . . . . . . . 13 ⊢ ((𝑛 − 1) ∈ (ℤ≥‘1) → (seq1( + , (ℕ × {𝑥}))‘((𝑛 − 1) + 1)) ∈ ({ 0 } ∪ ((ran + ∪ 𝐵) ∪ (ran 𝐼 ∪ {∅}))))
84	83	adantl 481	. . . . . . . . . . . 12 ⊢ ((𝑛 ∈ ℤ ∧ (𝑛 − 1) ∈ (ℤ≥‘1)) → (seq1( + , (ℕ × {𝑥}))‘((𝑛 − 1) + 1)) ∈ ({ 0 } ∪ ((ran + ∪ 𝐵) ∪ (ran 𝐼 ∪ {∅}))))
85	72, 84	eqeltrrd 2837	. . . . . . . . . . 11 ⊢ ((𝑛 ∈ ℤ ∧ (𝑛 − 1) ∈ (ℤ≥‘1)) → (seq1( + , (ℕ × {𝑥}))‘𝑛) ∈ ({ 0 } ∪ ((ran + ∪ 𝐵) ∪ (ran 𝐼 ∪ {∅}))))
86	85	ad4ant14 753	. . . . . . . . . 10 ⊢ ((((𝑛 ∈ ℤ ∧ 𝑥 ∈ 𝐵) ∧ 𝑛 ∈ (ℤ≥‘1)) ∧ (𝑛 − 1) ∈ (ℤ≥‘1)) → (seq1( + , (ℕ × {𝑥}))‘𝑛) ∈ ({ 0 } ∪ ((ran + ∪ 𝐵) ∪ (ran 𝐼 ∪ {∅}))))
87		uzm1 12822	. . . . . . . . . . 11 ⊢ (𝑛 ∈ (ℤ≥‘1) → (𝑛 = 1 ∨ (𝑛 − 1) ∈ (ℤ≥‘1)))
88	87	adantl 481	. . . . . . . . . 10 ⊢ (((𝑛 ∈ ℤ ∧ 𝑥 ∈ 𝐵) ∧ 𝑛 ∈ (ℤ≥‘1)) → (𝑛 = 1 ∨ (𝑛 − 1) ∈ (ℤ≥‘1)))
89	67, 86, 88	mpjaodan 961	. . . . . . . . 9 ⊢ (((𝑛 ∈ ℤ ∧ 𝑥 ∈ 𝐵) ∧ 𝑛 ∈ (ℤ≥‘1)) → (seq1( + , (ℕ × {𝑥}))‘𝑛) ∈ ({ 0 } ∪ ((ran + ∪ 𝐵) ∪ (ran 𝐼 ∪ {∅}))))
90		simpr 484	. . . . . . . . . . . 12 ⊢ (((𝑛 ∈ ℤ ∧ 𝑥 ∈ 𝐵) ∧ ¬ 𝑛 ∈ (ℤ≥‘1)) → ¬ 𝑛 ∈ (ℤ≥‘1))
91		seqfn 13975	. . . . . . . . . . . . . . 15 ⊢ (1 ∈ ℤ → seq1( + , (ℕ × {𝑥})) Fn (ℤ≥‘1))
92	10, 91	ax-mp 5	. . . . . . . . . . . . . 14 ⊢ seq1( + , (ℕ × {𝑥})) Fn (ℤ≥‘1)
93	92	fndmi 6602	. . . . . . . . . . . . 13 ⊢ dom seq1( + , (ℕ × {𝑥})) = (ℤ≥‘1)
94	93	eleq2i 2828	. . . . . . . . . . . 12 ⊢ (𝑛 ∈ dom seq1( + , (ℕ × {𝑥})) ↔ 𝑛 ∈ (ℤ≥‘1))
95	90, 94	sylnibr 329	. . . . . . . . . . 11 ⊢ (((𝑛 ∈ ℤ ∧ 𝑥 ∈ 𝐵) ∧ ¬ 𝑛 ∈ (ℤ≥‘1)) → ¬ 𝑛 ∈ dom seq1( + , (ℕ × {𝑥})))
96		ndmfv 6872	. . . . . . . . . . 11 ⊢ (¬ 𝑛 ∈ dom seq1( + , (ℕ × {𝑥})) → (seq1( + , (ℕ × {𝑥}))‘𝑛) = ∅)
97	95, 96	syl 17	. . . . . . . . . 10 ⊢ (((𝑛 ∈ ℤ ∧ 𝑥 ∈ 𝐵) ∧ ¬ 𝑛 ∈ (ℤ≥‘1)) → (seq1( + , (ℕ × {𝑥}))‘𝑛) = ∅)
98		ssun2 4119	. . . . . . . . . . . . . 14 ⊢ (ran 𝐼 ∪ {∅}) ⊆ ((ran + ∪ 𝐵) ∪ (ran 𝐼 ∪ {∅}))
99	75, 98	sstri 3931	. . . . . . . . . . . . 13 ⊢ {∅} ⊆ ((ran + ∪ 𝐵) ∪ (ran 𝐼 ∪ {∅}))
100	99, 51	sstri 3931	. . . . . . . . . . . 12 ⊢ {∅} ⊆ ({ 0 } ∪ ((ran + ∪ 𝐵) ∪ (ran 𝐼 ∪ {∅})))
101		0ex 5242	. . . . . . . . . . . . 13 ⊢ ∅ ∈ V
102	101	snid 4606	. . . . . . . . . . . 12 ⊢ ∅ ∈ {∅}
103	100, 102	sselii 3918	. . . . . . . . . . 11 ⊢ ∅ ∈ ({ 0 } ∪ ((ran + ∪ 𝐵) ∪ (ran 𝐼 ∪ {∅})))
104	103	a1i 11	. . . . . . . . . 10 ⊢ (((𝑛 ∈ ℤ ∧ 𝑥 ∈ 𝐵) ∧ ¬ 𝑛 ∈ (ℤ≥‘1)) → ∅ ∈ ({ 0 } ∪ ((ran + ∪ 𝐵) ∪ (ran 𝐼 ∪ {∅}))))
105	97, 104	eqeltrd 2836	. . . . . . . . 9 ⊢ (((𝑛 ∈ ℤ ∧ 𝑥 ∈ 𝐵) ∧ ¬ 𝑛 ∈ (ℤ≥‘1)) → (seq1( + , (ℕ × {𝑥}))‘𝑛) ∈ ({ 0 } ∪ ((ran + ∪ 𝐵) ∪ (ran 𝐼 ∪ {∅}))))
106	89, 105	pm2.61dan 813	. . . . . . . 8 ⊢ ((𝑛 ∈ ℤ ∧ 𝑥 ∈ 𝐵) → (seq1( + , (ℕ × {𝑥}))‘𝑛) ∈ ({ 0 } ∪ ((ran + ∪ 𝐵) ∪ (ran 𝐼 ∪ {∅}))))
107	98, 51	sstri 3931	. . . . . . . . . 10 ⊢ (ran 𝐼 ∪ {∅}) ⊆ ({ 0 } ∪ ((ran + ∪ 𝐵) ∪ (ran 𝐼 ∪ {∅})))
108		fvrn0 6868	. . . . . . . . . 10 ⊢ (𝐼‘(seq1( + , (ℕ × {𝑥}))‘-𝑛)) ∈ (ran 𝐼 ∪ {∅})
109	107, 108	sselii 3918	. . . . . . . . 9 ⊢ (𝐼‘(seq1( + , (ℕ × {𝑥}))‘-𝑛)) ∈ ({ 0 } ∪ ((ran + ∪ 𝐵) ∪ (ran 𝐼 ∪ {∅})))
110	109	a1i 11	. . . . . . . 8 ⊢ ((𝑛 ∈ ℤ ∧ 𝑥 ∈ 𝐵) → (𝐼‘(seq1( + , (ℕ × {𝑥}))‘-𝑛)) ∈ ({ 0 } ∪ ((ran + ∪ 𝐵) ∪ (ran 𝐼 ∪ {∅}))))
111	106, 110	ifcld 4513	. . . . . . 7 ⊢ ((𝑛 ∈ ℤ ∧ 𝑥 ∈ 𝐵) → if(0 < 𝑛, (seq1( + , (ℕ × {𝑥}))‘𝑛), (𝐼‘(seq1( + , (ℕ × {𝑥}))‘-𝑛))) ∈ ({ 0 } ∪ ((ran + ∪ 𝐵) ∪ (ran 𝐼 ∪ {∅}))))
112	47, 111	ifcld 4513	. . . . . 6 ⊢ ((𝑛 ∈ ℤ ∧ 𝑥 ∈ 𝐵) → if(𝑛 = 0, 0 , if(0 < 𝑛, (seq1( + , (ℕ × {𝑥}))‘𝑛), (𝐼‘(seq1( + , (ℕ × {𝑥}))‘-𝑛)))) ∈ ({ 0 } ∪ ((ran + ∪ 𝐵) ∪ (ran 𝐼 ∪ {∅}))))
113	112	rgen2 3177	. . . . 5 ⊢ ∀𝑛 ∈ ℤ ∀𝑥 ∈ 𝐵 if(𝑛 = 0, 0 , if(0 < 𝑛, (seq1( + , (ℕ × {𝑥}))‘𝑛), (𝐼‘(seq1( + , (ℕ × {𝑥}))‘-𝑛)))) ∈ ({ 0 } ∪ ((ran + ∪ 𝐵) ∪ (ran 𝐼 ∪ {∅})))
114	31, 32, 42, 113	mpoexw 8031	. . . 4 ⊢ (𝑛 ∈ ℤ, 𝑥 ∈ 𝐵 ↦ if(𝑛 = 0, 0 , if(0 < 𝑛, (seq1( + , (ℕ × {𝑥}))‘𝑛), (𝐼‘(seq1( + , (ℕ × {𝑥}))‘-𝑛))))) ∈ V
115	29, 30, 114	fvmpt 6947	. . 3 ⊢ (𝐺 ∈ V → (.g‘𝐺) = (𝑛 ∈ ℤ, 𝑥 ∈ 𝐵 ↦ if(𝑛 = 0, 0 , if(0 < 𝑛, (seq1( + , (ℕ × {𝑥}))‘𝑛), (𝐼‘(seq1( + , (ℕ × {𝑥}))‘-𝑛))))))
116		fvprc 6832	. . . 4 ⊢ (¬ 𝐺 ∈ V → (.g‘𝐺) = ∅)
117		eqid 2736	. . . . . . 7 ⊢ (𝑛 ∈ ℤ, 𝑥 ∈ 𝐵 ↦ if(𝑛 = 0, 0 , if(0 < 𝑛, (seq1( + , (ℕ × {𝑥}))‘𝑛), (𝐼‘(seq1( + , (ℕ × {𝑥}))‘-𝑛))))) = (𝑛 ∈ ℤ, 𝑥 ∈ 𝐵 ↦ if(𝑛 = 0, 0 , if(0 < 𝑛, (seq1( + , (ℕ × {𝑥}))‘𝑛), (𝐼‘(seq1( + , (ℕ × {𝑥}))‘-𝑛)))))
118		fvex 6853	. . . . . . . . 9 ⊢ (seq1( + , (ℕ × {𝑥}))‘𝑛) ∈ V
119		fvex 6853	. . . . . . . . 9 ⊢ (𝐼‘(seq1( + , (ℕ × {𝑥}))‘-𝑛)) ∈ V
120	118, 119	ifex 4517	. . . . . . . 8 ⊢ if(0 < 𝑛, (seq1( + , (ℕ × {𝑥}))‘𝑛), (𝐼‘(seq1( + , (ℕ × {𝑥}))‘-𝑛))) ∈ V
121	44, 120	ifex 4517	. . . . . . 7 ⊢ if(𝑛 = 0, 0 , if(0 < 𝑛, (seq1( + , (ℕ × {𝑥}))‘𝑛), (𝐼‘(seq1( + , (ℕ × {𝑥}))‘-𝑛)))) ∈ V
122	117, 121	fnmpoi 8023	. . . . . 6 ⊢ (𝑛 ∈ ℤ, 𝑥 ∈ 𝐵 ↦ if(𝑛 = 0, 0 , if(0 < 𝑛, (seq1( + , (ℕ × {𝑥}))‘𝑛), (𝐼‘(seq1( + , (ℕ × {𝑥}))‘-𝑛))))) Fn (ℤ × 𝐵)
123		fvprc 6832	. . . . . . . . . 10 ⊢ (¬ 𝐺 ∈ V → (Base‘𝐺) = ∅)
124	4, 123	eqtrid 2783	. . . . . . . . 9 ⊢ (¬ 𝐺 ∈ V → 𝐵 = ∅)
125	124	xpeq2d 5661	. . . . . . . 8 ⊢ (¬ 𝐺 ∈ V → (ℤ × 𝐵) = (ℤ × ∅))
126		xp0 5731	. . . . . . . 8 ⊢ (ℤ × ∅) = ∅
127	125, 126	eqtrdi 2787	. . . . . . 7 ⊢ (¬ 𝐺 ∈ V → (ℤ × 𝐵) = ∅)
128	127	fneq2d 6592	. . . . . 6 ⊢ (¬ 𝐺 ∈ V → ((𝑛 ∈ ℤ, 𝑥 ∈ 𝐵 ↦ if(𝑛 = 0, 0 , if(0 < 𝑛, (seq1( + , (ℕ × {𝑥}))‘𝑛), (𝐼‘(seq1( + , (ℕ × {𝑥}))‘-𝑛))))) Fn (ℤ × 𝐵) ↔ (𝑛 ∈ ℤ, 𝑥 ∈ 𝐵 ↦ if(𝑛 = 0, 0 , if(0 < 𝑛, (seq1( + , (ℕ × {𝑥}))‘𝑛), (𝐼‘(seq1( + , (ℕ × {𝑥}))‘-𝑛))))) Fn ∅))
129	122, 128	mpbii 233	. . . . 5 ⊢ (¬ 𝐺 ∈ V → (𝑛 ∈ ℤ, 𝑥 ∈ 𝐵 ↦ if(𝑛 = 0, 0 , if(0 < 𝑛, (seq1( + , (ℕ × {𝑥}))‘𝑛), (𝐼‘(seq1( + , (ℕ × {𝑥}))‘-𝑛))))) Fn ∅)
130		fn0 6629	. . . . 5 ⊢ ((𝑛 ∈ ℤ, 𝑥 ∈ 𝐵 ↦ if(𝑛 = 0, 0 , if(0 < 𝑛, (seq1( + , (ℕ × {𝑥}))‘𝑛), (𝐼‘(seq1( + , (ℕ × {𝑥}))‘-𝑛))))) Fn ∅ ↔ (𝑛 ∈ ℤ, 𝑥 ∈ 𝐵 ↦ if(𝑛 = 0, 0 , if(0 < 𝑛, (seq1( + , (ℕ × {𝑥}))‘𝑛), (𝐼‘(seq1( + , (ℕ × {𝑥}))‘-𝑛))))) = ∅)
131	129, 130	sylib 218	. . . 4 ⊢ (¬ 𝐺 ∈ V → (𝑛 ∈ ℤ, 𝑥 ∈ 𝐵 ↦ if(𝑛 = 0, 0 , if(0 < 𝑛, (seq1( + , (ℕ × {𝑥}))‘𝑛), (𝐼‘(seq1( + , (ℕ × {𝑥}))‘-𝑛))))) = ∅)
132	116, 131	eqtr4d 2774	. . 3 ⊢ (¬ 𝐺 ∈ V → (.g‘𝐺) = (𝑛 ∈ ℤ, 𝑥 ∈ 𝐵 ↦ if(𝑛 = 0, 0 , if(0 < 𝑛, (seq1( + , (ℕ × {𝑥}))‘𝑛), (𝐼‘(seq1( + , (ℕ × {𝑥}))‘-𝑛))))))
133	115, 132	pm2.61i 182	. 2 ⊢ (.g‘𝐺) = (𝑛 ∈ ℤ, 𝑥 ∈ 𝐵 ↦ if(𝑛 = 0, 0 , if(0 < 𝑛, (seq1( + , (ℕ × {𝑥}))‘𝑛), (𝐼‘(seq1( + , (ℕ × {𝑥}))‘-𝑛)))))
134	1, 133	eqtri 2759	1 ⊢ · = (𝑛 ∈ ℤ, 𝑥 ∈ 𝐵 ↦ if(𝑛 = 0, 0 , if(0 < 𝑛, (seq1( + , (ℕ × {𝑥}))‘𝑛), (𝐼‘(seq1( + , (ℕ × {𝑥}))‘-𝑛)))))

Syntax hints:  ¬ wn 3   ∧ wa 395   ∨ wo 848   = wceq 1542   ∈ wcel 2114  Vcvv 3429  ⦋csb 3837   ∪ cun 3887   ⊆ wss 3889  ∅c0 4273  ifcif 4466  {csn 4567  ⟨cop 4573   class class class wbr 5085   × cxp 5629  dom cdm 5631  ran crn 5632   Fn wfn 6493  ‘cfv 6498  (class class class)co 7367   ∈ cmpo 7369  ℂcc 11036  0cc0 11038  1c1 11039   + caddc 11041   < clt 11179   − cmin 11377  -cneg 11378  ℕcn 12174  ℤcz 12524  ℤ_≥cuz 12788  seqcseq 13963  Basecbs 17179  +_gcplusg 17220  0_gc0g 17402  inv_gcminusg 18910  ._gcmg 19043

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2708  ax-sep 5231  ax-nul 5241  ax-pow 5307  ax-pr 5375  ax-un 7689  ax-cnex 11094  ax-resscn 11095  ax-1cn 11096  ax-icn 11097  ax-addcl 11098  ax-addrcl 11099  ax-mulcl 11100  ax-mulrcl 11101  ax-mulcom 11102  ax-addass 11103  ax-mulass 11104  ax-distr 11105  ax-i2m1 11106  ax-1ne0 11107  ax-1rid 11108  ax-rnegex 11109  ax-rrecex 11110  ax-cnre 11111  ax-pre-lttri 11112  ax-pre-lttrn 11113  ax-pre-ltadd 11114  ax-pre-mulgt0 11115

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-nel 3037  df-ral 3052  df-rex 3062  df-reu 3343  df-rab 3390  df-v 3431  df-sbc 3729  df-csb 3838  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-pss 3909  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-iun 4935  df-br 5086  df-opab 5148  df-mpt 5167  df-tr 5193  df-id 5526  df-eprel 5531  df-po 5539  df-so 5540  df-fr 5584  df-we 5586  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-pred 6265  df-ord 6326  df-on 6327  df-lim 6328  df-suc 6329  df-iota 6454  df-fun 6500  df-fn 6501  df-f 6502  df-f1 6503  df-fo 6504  df-f1o 6505  df-fv 6506  df-riota 7324  df-ov 7370  df-oprab 7371  df-mpo 7372  df-om 7818  df-1st 7942  df-2nd 7943  df-frecs 8231  df-wrecs 8262  df-recs 8311  df-rdg 8349  df-er 8643  df-en 8894  df-dom 8895  df-sdom 8896  df-pnf 11181  df-mnf 11182  df-xr 11183  df-ltxr 11184  df-le 11185  df-sub 11379  df-neg 11380  df-nn 12175  df-n0 12438  df-z 12525  df-uz 12789  df-seq 13964  df-mulg 19044

This theorem is referenced by:  mulgval  19047  mulgfn  19048  mulgpropd  19092