Users' Mathboxes Mathbox for Alexander van der Vekens < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  plusfreseq Structured version   Visualization version   GIF version

Theorem plusfreseq 42787
Description: If the empty set is not contained in the range of the group addition function of an extensible structure (not necessarily a magma), the restriction of the addition operation to (the Cartesian square of) the base set is the functionalization of it. (Contributed by AV, 28-Jan-2020.)
Hypotheses
Ref Expression
plusfreseq.1 𝐵 = (Base‘𝑀)
plusfreseq.2 + = (+g𝑀)
plusfreseq.3 = (+𝑓𝑀)
Assertion
Ref Expression
plusfreseq (∅ ∉ ran → ( + ↾ (𝐵 × 𝐵)) = )

Proof of Theorem plusfreseq
Dummy variables 𝑝 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 plusfreseq.1 . . . . 5 𝐵 = (Base‘𝑀)
2 plusfreseq.3 . . . . 5 = (+𝑓𝑀)
31, 2plusffn 17636 . . . 4 Fn (𝐵 × 𝐵)
4 fnfun 6233 . . . 4 ( Fn (𝐵 × 𝐵) → Fun )
53, 4ax-mp 5 . . 3 Fun
65a1i 11 . 2 (∅ ∉ ran → Fun )
7 id 22 . 2 (∅ ∉ ran → ∅ ∉ ran )
8 plusfreseq.2 . . . . . . 7 + = (+g𝑀)
91, 8, 2plusfval 17634 . . . . . 6 ((𝑥𝐵𝑦𝐵) → (𝑥 𝑦) = (𝑥 + 𝑦))
109eqcomd 2784 . . . . 5 ((𝑥𝐵𝑦𝐵) → (𝑥 + 𝑦) = (𝑥 𝑦))
1110rgen2a 3159 . . . 4 𝑥𝐵𝑦𝐵 (𝑥 + 𝑦) = (𝑥 𝑦)
1211a1i 11 . . 3 (∅ ∉ ran → ∀𝑥𝐵𝑦𝐵 (𝑥 + 𝑦) = (𝑥 𝑦))
13 fveq2 6446 . . . . . 6 (𝑝 = ⟨𝑥, 𝑦⟩ → ( +𝑝) = ( + ‘⟨𝑥, 𝑦⟩))
14 df-ov 6925 . . . . . 6 (𝑥 + 𝑦) = ( + ‘⟨𝑥, 𝑦⟩)
1513, 14syl6eqr 2832 . . . . 5 (𝑝 = ⟨𝑥, 𝑦⟩ → ( +𝑝) = (𝑥 + 𝑦))
16 fveq2 6446 . . . . . 6 (𝑝 = ⟨𝑥, 𝑦⟩ → ( 𝑝) = ( ‘⟨𝑥, 𝑦⟩))
17 df-ov 6925 . . . . . 6 (𝑥 𝑦) = ( ‘⟨𝑥, 𝑦⟩)
1816, 17syl6eqr 2832 . . . . 5 (𝑝 = ⟨𝑥, 𝑦⟩ → ( 𝑝) = (𝑥 𝑦))
1915, 18eqeq12d 2793 . . . 4 (𝑝 = ⟨𝑥, 𝑦⟩ → (( +𝑝) = ( 𝑝) ↔ (𝑥 + 𝑦) = (𝑥 𝑦)))
2019ralxp 5509 . . 3 (∀𝑝 ∈ (𝐵 × 𝐵)( +𝑝) = ( 𝑝) ↔ ∀𝑥𝐵𝑦𝐵 (𝑥 + 𝑦) = (𝑥 𝑦))
2112, 20sylibr 226 . 2 (∅ ∉ ran → ∀𝑝 ∈ (𝐵 × 𝐵)( +𝑝) = ( 𝑝))
22 fndm 6235 . . . . 5 ( Fn (𝐵 × 𝐵) → dom = (𝐵 × 𝐵))
2322eqcomd 2784 . . . 4 ( Fn (𝐵 × 𝐵) → (𝐵 × 𝐵) = dom )
243, 23ax-mp 5 . . 3 (𝐵 × 𝐵) = dom
2524fveqressseq 6619 . 2 ((Fun ∧ ∅ ∉ ran ∧ ∀𝑝 ∈ (𝐵 × 𝐵)( +𝑝) = ( 𝑝)) → ( + ↾ (𝐵 × 𝐵)) = )
266, 7, 21, 25syl3anc 1439 1 (∅ ∉ ran → ( + ↾ (𝐵 × 𝐵)) = )
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 386   = wceq 1601  wcel 2107  wnel 3075  wral 3090  c0 4141  cop 4404   × cxp 5353  dom cdm 5355  ran crn 5356  cres 5357  Fun wfun 6129   Fn wfn 6130  cfv 6135  (class class class)co 6922  Basecbs 16255  +gcplusg 16338  +𝑓cplusf 17625
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1839  ax-4 1853  ax-5 1953  ax-6 2021  ax-7 2055  ax-8 2109  ax-9 2116  ax-10 2135  ax-11 2150  ax-12 2163  ax-13 2334  ax-ext 2754  ax-sep 5017  ax-nul 5025  ax-pow 5077  ax-pr 5138  ax-un 7226
This theorem depends on definitions:  df-bi 199  df-an 387  df-or 837  df-3an 1073  df-tru 1605  df-ex 1824  df-nf 1828  df-sb 2012  df-mo 2551  df-eu 2587  df-clab 2764  df-cleq 2770  df-clel 2774  df-nfc 2921  df-ne 2970  df-nel 3076  df-ral 3095  df-rex 3096  df-rab 3099  df-v 3400  df-sbc 3653  df-csb 3752  df-dif 3795  df-un 3797  df-in 3799  df-ss 3806  df-nul 4142  df-if 4308  df-pw 4381  df-sn 4399  df-pr 4401  df-op 4405  df-uni 4672  df-iun 4755  df-br 4887  df-opab 4949  df-mpt 4966  df-id 5261  df-xp 5361  df-rel 5362  df-cnv 5363  df-co 5364  df-dm 5365  df-rn 5366  df-res 5367  df-ima 5368  df-iota 6099  df-fun 6137  df-fn 6138  df-f 6139  df-fv 6143  df-ov 6925  df-oprab 6926  df-mpt2 6927  df-1st 7445  df-2nd 7446  df-plusf 17627
This theorem is referenced by:  mgmplusfreseq  42788
  Copyright terms: Public domain W3C validator