Metamath Proof Explorer


Theorem mulgfvalALT

Description: Shorter proof of mulgfval using ax-rep . (Contributed by Mario Carneiro, 11-Dec-2014) (Proof modification is discouraged.) (New usage is discouraged.)

Ref Expression
Hypotheses mulgval.b ⊢ B = Base G
mulgval.p ⊢ + ˙ = + G
mulgval.o ⊢ 0 ˙ = 0 G
mulgval.i ⊢ I = inv g ⁡ G
mulgval.t ⊢ · ˙ = ⋅ G
Assertion mulgfvalALT ⊢ · ˙ = n ∈ ℤ , x ∈ B ⟼ if n = 0 0 ˙ if 0 < n seq 1 + ˙ ℕ × x ⁡ n I ⁡ seq 1 + ˙ ℕ × x ⁡ − n

Proof

Step Hyp Ref Expression
1 mulgval.b ⊢ B = Base G
2 mulgval.p ⊢ + ˙ = + G
3 mulgval.o ⊢ 0 ˙ = 0 G
4 mulgval.i ⊢ I = inv g ⁡ G
5 mulgval.t ⊢ · ˙ = ⋅ G
6 eqidd ⊢ w = G → ℤ = ℤ
7 fveq2 ⊢ w = G → Base w = Base G
8 7 1 eqtr4di ⊢ w = G → Base w = B
9 fveq2 ⊢ w = G → 0 w = 0 G
10 9 3 eqtr4di ⊢ w = G → 0 w = 0 ˙
11 seqex ⊢ seq 1 + w ℕ × x ∈ V
12 11 a1i ⊢ w = G → seq 1 + w ℕ × x ∈ V
13 id ⊢ s = seq 1 + w ℕ × x → s = seq 1 + w ℕ × x
14 fveq2 ⊢ w = G → + w = + G
15 14 2 eqtr4di ⊢ w = G → + w = + ˙
16 15 seqeq2d ⊢ w = G → seq 1 + w ℕ × x = seq 1 + ˙ ℕ × x
17 13 16 sylan9eqr ⊢ w = G ∧ s = seq 1 + w ℕ × x → s = seq 1 + ˙ ℕ × x
18 17 fveq1d ⊢ w = G ∧ s = seq 1 + w ℕ × x → s ⁡ n = seq 1 + ˙ ℕ × x ⁡ n
19 simpl ⊢ w = G ∧ s = seq 1 + w ℕ × x → w = G
20 19 fveq2d ⊢ w = G ∧ s = seq 1 + w ℕ × x → inv g ⁡ w = inv g ⁡ G
21 20 4 eqtr4di ⊢ w = G ∧ s = seq 1 + w ℕ × x → inv g ⁡ w = I
22 17 fveq1d ⊢ w = G ∧ s = seq 1 + w ℕ × x → s ⁡ − n = seq 1 + ˙ ℕ × x ⁡ − n
23 21 22 fveq12d ⊢ w = G ∧ s = seq 1 + w ℕ × x → inv g ⁡ w ⁡ s ⁡ − n = I ⁡ seq 1 + ˙ ℕ × x ⁡ − n
24 18 23 ifeq12d ⊢ w = G ∧ s = seq 1 + w ℕ × x → if 0 < n s ⁡ n inv g ⁡ w ⁡ s ⁡ − n = if 0 < n seq 1 + ˙ ℕ × x ⁡ n I ⁡ seq 1 + ˙ ℕ × x ⁡ − n
25 12 24 csbied ⊢ w = G → ⦋ seq 1 + w ℕ × x / s⦌ if 0 < n s ⁡ n inv g ⁡ w ⁡ s ⁡ − n = if 0 < n seq 1 + ˙ ℕ × x ⁡ n I ⁡ seq 1 + ˙ ℕ × x ⁡ − n
26 10 25 ifeq12d ⊢ w = G → if n = 0 0 w ⦋ seq 1 + w ℕ × x / s⦌ if 0 < n s ⁡ n inv g ⁡ w ⁡ s ⁡ − n = if n = 0 0 ˙ if 0 < n seq 1 + ˙ ℕ × x ⁡ n I ⁡ seq 1 + ˙ ℕ × x ⁡ − n
27 6 8 26 mpoeq123dv ⊢ w = G → n ∈ ℤ , x ∈ Base w ⟼ if n = 0 0 w ⦋ seq 1 + w ℕ × x / s⦌ if 0 < n s ⁡ n inv g ⁡ w ⁡ s ⁡ − n = n ∈ ℤ , x ∈ B ⟼ if n = 0 0 ˙ if 0 < n seq 1 + ˙ ℕ × x ⁡ n I ⁡ seq 1 + ˙ ℕ × x ⁡ − n
28 df-mulg ⊢ ⋅ 𝑔 = w ∈ V ⟼ n ∈ ℤ , x ∈ Base w ⟼ if n = 0 0 w ⦋ seq 1 + w ℕ × x / s⦌ if 0 < n s ⁡ n inv g ⁡ w ⁡ s ⁡ − n
29 zex ⊢ ℤ ∈ V
30 1 fvexi ⊢ B ∈ V
31 29 30 mpoex ⊢ n ∈ ℤ , x ∈ B ⟼ if n = 0 0 ˙ if 0 < n seq 1 + ˙ ℕ × x ⁡ n I ⁡ seq 1 + ˙ ℕ × x ⁡ − n ∈ V
32 27 28 31 fvmpt ⊢ G ∈ V → ⋅ G = n ∈ ℤ , x ∈ B ⟼ if n = 0 0 ˙ if 0 < n seq 1 + ˙ ℕ × x ⁡ n I ⁡ seq 1 + ˙ ℕ × x ⁡ − n
33 fvprc ⊢ ¬ G ∈ V → ⋅ G = ∅
34 eqid ⊢ n ∈ ℤ , x ∈ B ⟼ if n = 0 0 ˙ if 0 < n seq 1 + ˙ ℕ × x ⁡ n I ⁡ seq 1 + ˙ ℕ × x ⁡ − n = n ∈ ℤ , x ∈ B ⟼ if n = 0 0 ˙ if 0 < n seq 1 + ˙ ℕ × x ⁡ n I ⁡ seq 1 + ˙ ℕ × x ⁡ − n
35 3 fvexi ⊢ 0 ˙ ∈ V
36 fvex ⊢ seq 1 + ˙ ℕ × x ⁡ n ∈ V
37 fvex ⊢ I ⁡ seq 1 + ˙ ℕ × x ⁡ − n ∈ V
38 36 37 ifex ⊢ if 0 < n seq 1 + ˙ ℕ × x ⁡ n I ⁡ seq 1 + ˙ ℕ × x ⁡ − n ∈ V
39 35 38 ifex ⊢ if n = 0 0 ˙ if 0 < n seq 1 + ˙ ℕ × x ⁡ n I ⁡ seq 1 + ˙ ℕ × x ⁡ − n ∈ V
40 34 39 fnmpoi ⊢ n ∈ ℤ , x ∈ B ⟼ if n = 0 0 ˙ if 0 < n seq 1 + ˙ ℕ × x ⁡ n I ⁡ seq 1 + ˙ ℕ × x ⁡ − n Fn ℤ × B
41 fvprc ⊢ ¬ G ∈ V → Base G = ∅
42 1 41 eqtrid ⊢ ¬ G ∈ V → B = ∅
43 42 xpeq2d ⊢ ¬ G ∈ V → ℤ × B = ℤ × ∅
44 xp0 ⊢ ℤ × ∅ = ∅
45 43 44 eqtrdi ⊢ ¬ G ∈ V → ℤ × B = ∅
46 45 fneq2d ⊢ ¬ G ∈ V → n ∈ ℤ , x ∈ B ⟼ if n = 0 0 ˙ if 0 < n seq 1 + ˙ ℕ × x ⁡ n I ⁡ seq 1 + ˙ ℕ × x ⁡ − n Fn ℤ × B ↔ n ∈ ℤ , x ∈ B ⟼ if n = 0 0 ˙ if 0 < n seq 1 + ˙ ℕ × x ⁡ n I ⁡ seq 1 + ˙ ℕ × x ⁡ − n Fn ∅
47 40 46 mpbii ⊢ ¬ G ∈ V → n ∈ ℤ , x ∈ B ⟼ if n = 0 0 ˙ if 0 < n seq 1 + ˙ ℕ × x ⁡ n I ⁡ seq 1 + ˙ ℕ × x ⁡ − n Fn ∅
48 fn0 ⊢ n ∈ ℤ , x ∈ B ⟼ if n = 0 0 ˙ if 0 < n seq 1 + ˙ ℕ × x ⁡ n I ⁡ seq 1 + ˙ ℕ × x ⁡ − n Fn ∅ ↔ n ∈ ℤ , x ∈ B ⟼ if n = 0 0 ˙ if 0 < n seq 1 + ˙ ℕ × x ⁡ n I ⁡ seq 1 + ˙ ℕ × x ⁡ − n = ∅
49 47 48 sylib ⊢ ¬ G ∈ V → n ∈ ℤ , x ∈ B ⟼ if n = 0 0 ˙ if 0 < n seq 1 + ˙ ℕ × x ⁡ n I ⁡ seq 1 + ˙ ℕ × x ⁡ − n = ∅
50 33 49 eqtr4d ⊢ ¬ G ∈ V → ⋅ G = n ∈ ℤ , x ∈ B ⟼ if n = 0 0 ˙ if 0 < n seq 1 + ˙ ℕ × x ⁡ n I ⁡ seq 1 + ˙ ℕ × x ⁡ − n
51 32 50 pm2.61i ⊢ ⋅ G = n ∈ ℤ , x ∈ B ⟼ if n = 0 0 ˙ if 0 < n seq 1 + ˙ ℕ × x ⁡ n I ⁡ seq 1 + ˙ ℕ × x ⁡ − n
52 5 51 eqtri ⊢ · ˙ = n ∈ ℤ , x ∈ B ⟼ if n = 0 0 ˙ if 0 < n seq 1 + ˙ ℕ × x ⁡ n I ⁡ seq 1 + ˙ ℕ × x ⁡ − n