Theorem plusffng 13668

Description: The group addition operation is a function. (Contributed by Mario Carneiro, 20-Sep-2015.)

Hypotheses

Ref	Expression
plusffn.1	⊢ 𝐵 = (Base‘𝐺)
plusffn.2	⊢ ⨣ = (+𝑓‘𝐺)

Assertion

Ref	Expression
plusffng	⊢ (𝐺 ∈ 𝑉 → ⨣ Fn (𝐵 × 𝐵))

Proof of Theorem plusffng

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		vex 2824	. . . . 5 ⊢ 𝑥 ∈ V
2		plusgslid 13449	. . . . . 6 ⊢ (+g = Slot (+g‘ndx) ∧ (+g‘ndx) ∈ ℕ)
3	2	slotex 13362	. . . . 5 ⊢ (𝐺 ∈ 𝑉 → (+g‘𝐺) ∈ V)
4		vex 2824	. . . . . 6 ⊢ 𝑦 ∈ V
5	4	a1i 9	. . . . 5 ⊢ ((𝐺 ∈ 𝑉 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → 𝑦 ∈ V)
6		ovexg 6113	. . . . 5 ⊢ ((𝑥 ∈ V ∧ (+g‘𝐺) ∈ V ∧ 𝑦 ∈ V) → (𝑥(+g‘𝐺)𝑦) ∈ V)
7	1, 3, 5, 6	mp3an2ani 1385	. . . 4 ⊢ ((𝐺 ∈ 𝑉 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥(+g‘𝐺)𝑦) ∈ V)
8	7	ralrimivva 2632	. . 3 ⊢ (𝐺 ∈ 𝑉 → ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥(+g‘𝐺)𝑦) ∈ V)
9		eqid 2238	. . . 4 ⊢ (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥(+g‘𝐺)𝑦)) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥(+g‘𝐺)𝑦))
10	9	fnmpo 6432	. . 3 ⊢ (∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥(+g‘𝐺)𝑦) ∈ V → (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥(+g‘𝐺)𝑦)) Fn (𝐵 × 𝐵))
11	8, 10	syl 14	. 2 ⊢ (𝐺 ∈ 𝑉 → (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥(+g‘𝐺)𝑦)) Fn (𝐵 × 𝐵))
12		plusffn.1	. . . 4 ⊢ 𝐵 = (Base‘𝐺)
13		eqid 2238	. . . 4 ⊢ (+g‘𝐺) = (+g‘𝐺)
14		plusffn.2	. . . 4 ⊢ ⨣ = (+𝑓‘𝐺)
15	12, 13, 14	plusffvalg 13665	. . 3 ⊢ (𝐺 ∈ 𝑉 → ⨣ = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥(+g‘𝐺)𝑦)))
16	15	fneq1d 5469	. 2 ⊢ (𝐺 ∈ 𝑉 → ( ⨣ Fn (𝐵 × 𝐵) ↔ (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥(+g‘𝐺)𝑦)) Fn (𝐵 × 𝐵)))
17	11, 16	mpbird 167	1 ⊢ (𝐺 ∈ 𝑉 → ⨣ Fn (𝐵 × 𝐵))

Syntax hints:   → wi 4   ∧ wa 104   = wceq 1402   ∈ wcel 2209  ∀wral 2528  Vcvv 2821   × cxp 4770   Fn wfn 5370  ‘cfv 5375  (class class class)co 6079   ∈ cmpo 6081  Basecbs 13335  +_gcplusg 13414  +_𝑓cplusf 13656

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-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4244  ax-sep 4247  ax-pow 4309  ax-pr 4344  ax-un 4576  ax-cnex 8264  ax-resscn 8265  ax-1re 8267  ax-addrcl 8270

This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3714  df-pr 3715  df-op 3717  df-uni 3934  df-int 3969  df-iun 4012  df-br 4129  df-opab 4191  df-mpt 4192  df-id 4436  df-xp 4778  df-rel 4779  df-cnv 4780  df-co 4781  df-dm 4782  df-rn 4783  df-res 4784  df-ima 4785  df-iota 5335  df-fun 5377  df-fn 5378  df-f 5379  df-f1 5380  df-fo 5381  df-f1o 5382  df-fv 5383  df-ov 6082  df-oprab 6083  df-mpo 6084  df-1st 6368  df-2nd 6369  df-inn 9288  df-2 9346  df-ndx 13338  df-slot 13339  df-base 13341  df-plusg 13427  df-plusf 13658

This theorem is referenced by:  lmodfopnelem1  14644