Theorem mulgfng 13656

Description: Functionality of the group multiple operation. (Contributed by Mario Carneiro, 21-Mar-2015.) (Revised by Mario Carneiro, 2-Oct-2015.)

Hypotheses

Ref	Expression
mulgfn.b	⊢ 𝐵 = (Base‘𝐺)
mulgfn.t	⊢ · = (.g‘𝐺)

Assertion

Ref	Expression
mulgfng	⊢ (𝐺 ∈ 𝑉 → · Fn (ℤ × 𝐵))

Proof of Theorem mulgfng

Dummy variables 𝑢 𝑣 𝑛 𝑥 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		elex 2811	. . . . . . 7 ⊢ (𝐺 ∈ 𝑉 → 𝐺 ∈ V)
2		fn0g 13403	. . . . . . . 8 ⊢ 0g Fn V
3		funfvex 5643	. . . . . . . . 9 ⊢ ((Fun 0g ∧ 𝐺 ∈ dom 0g) → (0g‘𝐺) ∈ V)
4	3	funfni 5422	. . . . . . . 8 ⊢ ((0g Fn V ∧ 𝐺 ∈ V) → (0g‘𝐺) ∈ V)
5	2, 4	mpan 424	. . . . . . 7 ⊢ (𝐺 ∈ V → (0g‘𝐺) ∈ V)
6	1, 5	syl 14	. . . . . 6 ⊢ (𝐺 ∈ 𝑉 → (0g‘𝐺) ∈ V)
7	6	ad2antrr 488	. . . . 5 ⊢ (((𝐺 ∈ 𝑉 ∧ (𝑛 ∈ ℤ ∧ 𝑥 ∈ 𝐵)) ∧ 𝑛 = 0) → (0g‘𝐺) ∈ V)
8		nnuz 9754	. . . . . . . . . 10 ⊢ ℕ = (ℤ≥‘1)
9		1zzd 9469	. . . . . . . . . 10 ⊢ ((𝐺 ∈ 𝑉 ∧ 𝑥 ∈ 𝐵) → 1 ∈ ℤ)
10		fvconst2g 5852	. . . . . . . . . . . . 13 ⊢ ((𝑥 ∈ 𝐵 ∧ 𝑢 ∈ ℕ) → ((ℕ × {𝑥})‘𝑢) = 𝑥)
11		simpl 109	. . . . . . . . . . . . 13 ⊢ ((𝑥 ∈ 𝐵 ∧ 𝑢 ∈ ℕ) → 𝑥 ∈ 𝐵)
12	10, 11	eqeltrd 2306	. . . . . . . . . . . 12 ⊢ ((𝑥 ∈ 𝐵 ∧ 𝑢 ∈ ℕ) → ((ℕ × {𝑥})‘𝑢) ∈ 𝐵)
13	12	elexd 2813	. . . . . . . . . . 11 ⊢ ((𝑥 ∈ 𝐵 ∧ 𝑢 ∈ ℕ) → ((ℕ × {𝑥})‘𝑢) ∈ V)
14	13	adantll 476	. . . . . . . . . 10 ⊢ (((𝐺 ∈ 𝑉 ∧ 𝑥 ∈ 𝐵) ∧ 𝑢 ∈ ℕ) → ((ℕ × {𝑥})‘𝑢) ∈ V)
15		simprl 529	. . . . . . . . . . 11 ⊢ (((𝐺 ∈ 𝑉 ∧ 𝑥 ∈ 𝐵) ∧ (𝑢 ∈ V ∧ 𝑣 ∈ V)) → 𝑢 ∈ V)
16		plusgslid 13140	. . . . . . . . . . . . 13 ⊢ (+g = Slot (+g‘ndx) ∧ (+g‘ndx) ∈ ℕ)
17	16	slotex 13054	. . . . . . . . . . . 12 ⊢ (𝐺 ∈ 𝑉 → (+g‘𝐺) ∈ V)
18	17	ad2antrr 488	. . . . . . . . . . 11 ⊢ (((𝐺 ∈ 𝑉 ∧ 𝑥 ∈ 𝐵) ∧ (𝑢 ∈ V ∧ 𝑣 ∈ V)) → (+g‘𝐺) ∈ V)
19		simprr 531	. . . . . . . . . . 11 ⊢ (((𝐺 ∈ 𝑉 ∧ 𝑥 ∈ 𝐵) ∧ (𝑢 ∈ V ∧ 𝑣 ∈ V)) → 𝑣 ∈ V)
20		ovexg 6034	. . . . . . . . . . 11 ⊢ ((𝑢 ∈ V ∧ (+g‘𝐺) ∈ V ∧ 𝑣 ∈ V) → (𝑢(+g‘𝐺)𝑣) ∈ V)
21	15, 18, 19, 20	syl3anc 1271	. . . . . . . . . 10 ⊢ (((𝐺 ∈ 𝑉 ∧ 𝑥 ∈ 𝐵) ∧ (𝑢 ∈ V ∧ 𝑣 ∈ V)) → (𝑢(+g‘𝐺)𝑣) ∈ V)
22	8, 9, 14, 21	seqf 10681	. . . . . . . . 9 ⊢ ((𝐺 ∈ 𝑉 ∧ 𝑥 ∈ 𝐵) → seq1((+g‘𝐺), (ℕ × {𝑥})):ℕ⟶V)
23	22	adantrl 478	. . . . . . . 8 ⊢ ((𝐺 ∈ 𝑉 ∧ (𝑛 ∈ ℤ ∧ 𝑥 ∈ 𝐵)) → seq1((+g‘𝐺), (ℕ × {𝑥})):ℕ⟶V)
24	23	ad2antrr 488	. . . . . . 7 ⊢ ((((𝐺 ∈ 𝑉 ∧ (𝑛 ∈ ℤ ∧ 𝑥 ∈ 𝐵)) ∧ ¬ 𝑛 = 0) ∧ 0 < 𝑛) → seq1((+g‘𝐺), (ℕ × {𝑥})):ℕ⟶V)
25		simprl 529	. . . . . . . . 9 ⊢ ((𝐺 ∈ 𝑉 ∧ (𝑛 ∈ ℤ ∧ 𝑥 ∈ 𝐵)) → 𝑛 ∈ ℤ)
26	25	ad2antrr 488	. . . . . . . 8 ⊢ ((((𝐺 ∈ 𝑉 ∧ (𝑛 ∈ ℤ ∧ 𝑥 ∈ 𝐵)) ∧ ¬ 𝑛 = 0) ∧ 0 < 𝑛) → 𝑛 ∈ ℤ)
27		simpr 110	. . . . . . . 8 ⊢ ((((𝐺 ∈ 𝑉 ∧ (𝑛 ∈ ℤ ∧ 𝑥 ∈ 𝐵)) ∧ ¬ 𝑛 = 0) ∧ 0 < 𝑛) → 0 < 𝑛)
28		elnnz 9452	. . . . . . . 8 ⊢ (𝑛 ∈ ℕ ↔ (𝑛 ∈ ℤ ∧ 0 < 𝑛))
29	26, 27, 28	sylanbrc 417	. . . . . . 7 ⊢ ((((𝐺 ∈ 𝑉 ∧ (𝑛 ∈ ℤ ∧ 𝑥 ∈ 𝐵)) ∧ ¬ 𝑛 = 0) ∧ 0 < 𝑛) → 𝑛 ∈ ℕ)
30	24, 29	ffvelcdmd 5770	. . . . . 6 ⊢ ((((𝐺 ∈ 𝑉 ∧ (𝑛 ∈ ℤ ∧ 𝑥 ∈ 𝐵)) ∧ ¬ 𝑛 = 0) ∧ 0 < 𝑛) → (seq1((+g‘𝐺), (ℕ × {𝑥}))‘𝑛) ∈ V)
31		mulgfn.b	. . . . . . . . . 10 ⊢ 𝐵 = (Base‘𝐺)
32		eqid 2229	. . . . . . . . . 10 ⊢ (invg‘𝐺) = (invg‘𝐺)
33	31, 32	grpinvfng 13572	. . . . . . . . 9 ⊢ (𝐺 ∈ 𝑉 → (invg‘𝐺) Fn 𝐵)
34		basfn 13086	. . . . . . . . . . . 12 ⊢ Base Fn V
35		funfvex 5643	. . . . . . . . . . . . 13 ⊢ ((Fun Base ∧ 𝐺 ∈ dom Base) → (Base‘𝐺) ∈ V)
36	35	funfni 5422	. . . . . . . . . . . 12 ⊢ ((Base Fn V ∧ 𝐺 ∈ V) → (Base‘𝐺) ∈ V)
37	34, 36	mpan 424	. . . . . . . . . . 11 ⊢ (𝐺 ∈ V → (Base‘𝐺) ∈ V)
38	31, 37	eqeltrid 2316	. . . . . . . . . 10 ⊢ (𝐺 ∈ V → 𝐵 ∈ V)
39	1, 38	syl 14	. . . . . . . . 9 ⊢ (𝐺 ∈ 𝑉 → 𝐵 ∈ V)
40		fnex 5860	. . . . . . . . 9 ⊢ (((invg‘𝐺) Fn 𝐵 ∧ 𝐵 ∈ V) → (invg‘𝐺) ∈ V)
41	33, 39, 40	syl2anc 411	. . . . . . . 8 ⊢ (𝐺 ∈ 𝑉 → (invg‘𝐺) ∈ V)
42	41	ad3antrrr 492	. . . . . . 7 ⊢ ((((𝐺 ∈ 𝑉 ∧ (𝑛 ∈ ℤ ∧ 𝑥 ∈ 𝐵)) ∧ ¬ 𝑛 = 0) ∧ ¬ 0 < 𝑛) → (invg‘𝐺) ∈ V)
43	23	ad2antrr 488	. . . . . . . 8 ⊢ ((((𝐺 ∈ 𝑉 ∧ (𝑛 ∈ ℤ ∧ 𝑥 ∈ 𝐵)) ∧ ¬ 𝑛 = 0) ∧ ¬ 0 < 𝑛) → seq1((+g‘𝐺), (ℕ × {𝑥})):ℕ⟶V)
44	25	znegcld 9567	. . . . . . . . . 10 ⊢ ((𝐺 ∈ 𝑉 ∧ (𝑛 ∈ ℤ ∧ 𝑥 ∈ 𝐵)) → -𝑛 ∈ ℤ)
45	44	ad2antrr 488	. . . . . . . . 9 ⊢ ((((𝐺 ∈ 𝑉 ∧ (𝑛 ∈ ℤ ∧ 𝑥 ∈ 𝐵)) ∧ ¬ 𝑛 = 0) ∧ ¬ 0 < 𝑛) → -𝑛 ∈ ℤ)
46		simplr 528	. . . . . . . . . . 11 ⊢ ((((𝐺 ∈ 𝑉 ∧ (𝑛 ∈ ℤ ∧ 𝑥 ∈ 𝐵)) ∧ ¬ 𝑛 = 0) ∧ ¬ 0 < 𝑛) → ¬ 𝑛 = 0)
47		simpr 110	. . . . . . . . . . 11 ⊢ ((((𝐺 ∈ 𝑉 ∧ (𝑛 ∈ ℤ ∧ 𝑥 ∈ 𝐵)) ∧ ¬ 𝑛 = 0) ∧ ¬ 0 < 𝑛) → ¬ 0 < 𝑛)
48		ztri3or0 9484	. . . . . . . . . . . . 13 ⊢ (𝑛 ∈ ℤ → (𝑛 < 0 ∨ 𝑛 = 0 ∨ 0 < 𝑛))
49	25, 48	syl 14	. . . . . . . . . . . 12 ⊢ ((𝐺 ∈ 𝑉 ∧ (𝑛 ∈ ℤ ∧ 𝑥 ∈ 𝐵)) → (𝑛 < 0 ∨ 𝑛 = 0 ∨ 0 < 𝑛))
50	49	ad2antrr 488	. . . . . . . . . . 11 ⊢ ((((𝐺 ∈ 𝑉 ∧ (𝑛 ∈ ℤ ∧ 𝑥 ∈ 𝐵)) ∧ ¬ 𝑛 = 0) ∧ ¬ 0 < 𝑛) → (𝑛 < 0 ∨ 𝑛 = 0 ∨ 0 < 𝑛))
51	46, 47, 50	ecase23d 1384	. . . . . . . . . 10 ⊢ ((((𝐺 ∈ 𝑉 ∧ (𝑛 ∈ ℤ ∧ 𝑥 ∈ 𝐵)) ∧ ¬ 𝑛 = 0) ∧ ¬ 0 < 𝑛) → 𝑛 < 0)
52	25	zred 9565	. . . . . . . . . . . 12 ⊢ ((𝐺 ∈ 𝑉 ∧ (𝑛 ∈ ℤ ∧ 𝑥 ∈ 𝐵)) → 𝑛 ∈ ℝ)
53	52	ad2antrr 488	. . . . . . . . . . 11 ⊢ ((((𝐺 ∈ 𝑉 ∧ (𝑛 ∈ ℤ ∧ 𝑥 ∈ 𝐵)) ∧ ¬ 𝑛 = 0) ∧ ¬ 0 < 𝑛) → 𝑛 ∈ ℝ)
54	53	lt0neg1d 8658	. . . . . . . . . 10 ⊢ ((((𝐺 ∈ 𝑉 ∧ (𝑛 ∈ ℤ ∧ 𝑥 ∈ 𝐵)) ∧ ¬ 𝑛 = 0) ∧ ¬ 0 < 𝑛) → (𝑛 < 0 ↔ 0 < -𝑛))
55	51, 54	mpbid 147	. . . . . . . . 9 ⊢ ((((𝐺 ∈ 𝑉 ∧ (𝑛 ∈ ℤ ∧ 𝑥 ∈ 𝐵)) ∧ ¬ 𝑛 = 0) ∧ ¬ 0 < 𝑛) → 0 < -𝑛)
56		elnnz 9452	. . . . . . . . 9 ⊢ (-𝑛 ∈ ℕ ↔ (-𝑛 ∈ ℤ ∧ 0 < -𝑛))
57	45, 55, 56	sylanbrc 417	. . . . . . . 8 ⊢ ((((𝐺 ∈ 𝑉 ∧ (𝑛 ∈ ℤ ∧ 𝑥 ∈ 𝐵)) ∧ ¬ 𝑛 = 0) ∧ ¬ 0 < 𝑛) → -𝑛 ∈ ℕ)
58	43, 57	ffvelcdmd 5770	. . . . . . 7 ⊢ ((((𝐺 ∈ 𝑉 ∧ (𝑛 ∈ ℤ ∧ 𝑥 ∈ 𝐵)) ∧ ¬ 𝑛 = 0) ∧ ¬ 0 < 𝑛) → (seq1((+g‘𝐺), (ℕ × {𝑥}))‘-𝑛) ∈ V)
59		fvexg 5645	. . . . . . 7 ⊢ (((invg‘𝐺) ∈ V ∧ (seq1((+g‘𝐺), (ℕ × {𝑥}))‘-𝑛) ∈ V) → ((invg‘𝐺)‘(seq1((+g‘𝐺), (ℕ × {𝑥}))‘-𝑛)) ∈ V)
60	42, 58, 59	syl2anc 411	. . . . . 6 ⊢ ((((𝐺 ∈ 𝑉 ∧ (𝑛 ∈ ℤ ∧ 𝑥 ∈ 𝐵)) ∧ ¬ 𝑛 = 0) ∧ ¬ 0 < 𝑛) → ((invg‘𝐺)‘(seq1((+g‘𝐺), (ℕ × {𝑥}))‘-𝑛)) ∈ V)
61		0zd 9454	. . . . . . 7 ⊢ (((𝐺 ∈ 𝑉 ∧ (𝑛 ∈ ℤ ∧ 𝑥 ∈ 𝐵)) ∧ ¬ 𝑛 = 0) → 0 ∈ ℤ)
62		simplrl 535	. . . . . . 7 ⊢ (((𝐺 ∈ 𝑉 ∧ (𝑛 ∈ ℤ ∧ 𝑥 ∈ 𝐵)) ∧ ¬ 𝑛 = 0) → 𝑛 ∈ ℤ)
63		zdclt 9520	. . . . . . 7 ⊢ ((0 ∈ ℤ ∧ 𝑛 ∈ ℤ) → DECID 0 < 𝑛)
64	61, 62, 63	syl2anc 411	. . . . . 6 ⊢ (((𝐺 ∈ 𝑉 ∧ (𝑛 ∈ ℤ ∧ 𝑥 ∈ 𝐵)) ∧ ¬ 𝑛 = 0) → DECID 0 < 𝑛)
65	30, 60, 64	ifcldadc 3632	. . . . 5 ⊢ (((𝐺 ∈ 𝑉 ∧ (𝑛 ∈ ℤ ∧ 𝑥 ∈ 𝐵)) ∧ ¬ 𝑛 = 0) → if(0 < 𝑛, (seq1((+g‘𝐺), (ℕ × {𝑥}))‘𝑛), ((invg‘𝐺)‘(seq1((+g‘𝐺), (ℕ × {𝑥}))‘-𝑛))) ∈ V)
66		0zd 9454	. . . . . 6 ⊢ ((𝐺 ∈ 𝑉 ∧ (𝑛 ∈ ℤ ∧ 𝑥 ∈ 𝐵)) → 0 ∈ ℤ)
67		zdceq 9518	. . . . . 6 ⊢ ((𝑛 ∈ ℤ ∧ 0 ∈ ℤ) → DECID 𝑛 = 0)
68	25, 66, 67	syl2anc 411	. . . . 5 ⊢ ((𝐺 ∈ 𝑉 ∧ (𝑛 ∈ ℤ ∧ 𝑥 ∈ 𝐵)) → DECID 𝑛 = 0)
69	7, 65, 68	ifcldadc 3632	. . . 4 ⊢ ((𝐺 ∈ 𝑉 ∧ (𝑛 ∈ ℤ ∧ 𝑥 ∈ 𝐵)) → if(𝑛 = 0, (0g‘𝐺), if(0 < 𝑛, (seq1((+g‘𝐺), (ℕ × {𝑥}))‘𝑛), ((invg‘𝐺)‘(seq1((+g‘𝐺), (ℕ × {𝑥}))‘-𝑛)))) ∈ V)
70	69	ralrimivva 2612	. . 3 ⊢ (𝐺 ∈ 𝑉 → ∀𝑛 ∈ ℤ ∀𝑥 ∈ 𝐵 if(𝑛 = 0, (0g‘𝐺), if(0 < 𝑛, (seq1((+g‘𝐺), (ℕ × {𝑥}))‘𝑛), ((invg‘𝐺)‘(seq1((+g‘𝐺), (ℕ × {𝑥}))‘-𝑛)))) ∈ V)
71		eqid 2229	. . . 4 ⊢ (𝑛 ∈ ℤ, 𝑥 ∈ 𝐵 ↦ if(𝑛 = 0, (0g‘𝐺), if(0 < 𝑛, (seq1((+g‘𝐺), (ℕ × {𝑥}))‘𝑛), ((invg‘𝐺)‘(seq1((+g‘𝐺), (ℕ × {𝑥}))‘-𝑛))))) = (𝑛 ∈ ℤ, 𝑥 ∈ 𝐵 ↦ if(𝑛 = 0, (0g‘𝐺), if(0 < 𝑛, (seq1((+g‘𝐺), (ℕ × {𝑥}))‘𝑛), ((invg‘𝐺)‘(seq1((+g‘𝐺), (ℕ × {𝑥}))‘-𝑛)))))
72	71	fnmpo 6346	. . 3 ⊢ (∀𝑛 ∈ ℤ ∀𝑥 ∈ 𝐵 if(𝑛 = 0, (0g‘𝐺), if(0 < 𝑛, (seq1((+g‘𝐺), (ℕ × {𝑥}))‘𝑛), ((invg‘𝐺)‘(seq1((+g‘𝐺), (ℕ × {𝑥}))‘-𝑛)))) ∈ V → (𝑛 ∈ ℤ, 𝑥 ∈ 𝐵 ↦ if(𝑛 = 0, (0g‘𝐺), if(0 < 𝑛, (seq1((+g‘𝐺), (ℕ × {𝑥}))‘𝑛), ((invg‘𝐺)‘(seq1((+g‘𝐺), (ℕ × {𝑥}))‘-𝑛))))) Fn (ℤ × 𝐵))
73	70, 72	syl 14	. 2 ⊢ (𝐺 ∈ 𝑉 → (𝑛 ∈ ℤ, 𝑥 ∈ 𝐵 ↦ if(𝑛 = 0, (0g‘𝐺), if(0 < 𝑛, (seq1((+g‘𝐺), (ℕ × {𝑥}))‘𝑛), ((invg‘𝐺)‘(seq1((+g‘𝐺), (ℕ × {𝑥}))‘-𝑛))))) Fn (ℤ × 𝐵))
74		eqid 2229	. . . 4 ⊢ (+g‘𝐺) = (+g‘𝐺)
75		eqid 2229	. . . 4 ⊢ (0g‘𝐺) = (0g‘𝐺)
76		mulgfn.t	. . . 4 ⊢ · = (.g‘𝐺)
77	31, 74, 75, 32, 76	mulgfvalg 13653	. . 3 ⊢ (𝐺 ∈ 𝑉 → · = (𝑛 ∈ ℤ, 𝑥 ∈ 𝐵 ↦ if(𝑛 = 0, (0g‘𝐺), if(0 < 𝑛, (seq1((+g‘𝐺), (ℕ × {𝑥}))‘𝑛), ((invg‘𝐺)‘(seq1((+g‘𝐺), (ℕ × {𝑥}))‘-𝑛))))))
78	77	fneq1d 5410	. 2 ⊢ (𝐺 ∈ 𝑉 → ( · Fn (ℤ × 𝐵) ↔ (𝑛 ∈ ℤ, 𝑥 ∈ 𝐵 ↦ if(𝑛 = 0, (0g‘𝐺), if(0 < 𝑛, (seq1((+g‘𝐺), (ℕ × {𝑥}))‘𝑛), ((invg‘𝐺)‘(seq1((+g‘𝐺), (ℕ × {𝑥}))‘-𝑛))))) Fn (ℤ × 𝐵)))
79	73, 78	mpbird 167	1 ⊢ (𝐺 ∈ 𝑉 → · Fn (ℤ × 𝐵))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 104  DECID wdc 839   ∨ w3o 1001   = wceq 1395   ∈ wcel 2200  ∀wral 2508  Vcvv 2799  ifcif 3602  {csn 3666   class class class wbr 4082   × cxp 4716   Fn wfn 5312  ⟶wf 5313  ‘cfv 5317  (class class class)co 6000   ∈ cmpo 6002  ℝcr 7994  0cc0 7995  1c1 7996   < clt 8177  -cneg 8314  ℕcn 9106  ℤcz 9442  seqcseq 10664  Basecbs 13027  +_gcplusg 13105  0_gc0g 13284  inv_gcminusg 13529  ._gcmg 13651

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-in1 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-coll 4198  ax-sep 4201  ax-nul 4209  ax-pow 4257  ax-pr 4292  ax-un 4523  ax-setind 4628  ax-iinf 4679  ax-cnex 8086  ax-resscn 8087  ax-1cn 8088  ax-1re 8089  ax-icn 8090  ax-addcl 8091  ax-addrcl 8092  ax-mulcl 8093  ax-addcom 8095  ax-addass 8097  ax-distr 8099  ax-i2m1 8100  ax-0lt1 8101  ax-0id 8103  ax-rnegex 8104  ax-cnre 8106  ax-pre-ltirr 8107  ax-pre-ltwlin 8108  ax-pre-lttrn 8109  ax-pre-ltadd 8111

This theorem depends on definitions:  df-bi 117  df-dc 840  df-3or 1003  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-nel 2496  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2517  df-v 2801  df-sbc 3029  df-csb 3125  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-nul 3492  df-if 3603  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3888  df-int 3923  df-iun 3966  df-br 4083  df-opab 4145  df-mpt 4146  df-tr 4182  df-id 4383  df-iord 4456  df-on 4458  df-ilim 4459  df-suc 4461  df-iom 4682  df-xp 4724  df-rel 4725  df-cnv 4726  df-co 4727  df-dm 4728  df-rn 4729  df-res 4730  df-ima 4731  df-iota 5277  df-fun 5319  df-fn 5320  df-f 5321  df-f1 5322  df-fo 5323  df-f1o 5324  df-fv 5325  df-riota 5953  df-ov 6003  df-oprab 6004  df-mpo 6005  df-1st 6284  df-2nd 6285  df-recs 6449  df-frec 6535  df-pnf 8179  df-mnf 8180  df-xr 8181  df-ltxr 8182  df-le 8183  df-sub 8315  df-neg 8316  df-inn 9107  df-2 9165  df-n0 9366  df-z 9443  df-uz 9719  df-seqfrec 10665  df-ndx 13030  df-slot 13031  df-base 13033  df-plusg 13118  df-0g 13286  df-minusg 13532  df-mulg 13652

This theorem is referenced by: (None)