let K be Field; :: thesis: for T being K -monomorphic comRing
for f being Monomorphism of K,T
for a, b being Element of (embField f)
for a1, b1 being Element of T st K,T are_disjoint & not a in [#] K & not b in [#] K & not the addF of T . (a,b) in rng f & a1 = a & b1 = b holds
( a + b = a1 + b1 & b + a = b1 + a1 & not a + b in [#] K & not b + a in [#] K )
let T be K -monomorphic comRing; :: thesis: for f being Monomorphism of K,T
for a, b being Element of (embField f)
for a1, b1 being Element of T st K,T are_disjoint & not a in [#] K & not b in [#] K & not the addF of T . (a,b) in rng f & a1 = a & b1 = b holds
( a + b = a1 + b1 & b + a = b1 + a1 & not a + b in [#] K & not b + a in [#] K )
let f be Monomorphism of K,T; :: thesis: for a, b being Element of (embField f)
for a1, b1 being Element of T st K,T are_disjoint & not a in [#] K & not b in [#] K & not the addF of T . (a,b) in rng f & a1 = a & b1 = b holds
( a + b = a1 + b1 & b + a = b1 + a1 & not a + b in [#] K & not b + a in [#] K )
let a, b be Element of (embField f); :: thesis: for a1, b1 being Element of T st K,T are_disjoint & not a in [#] K & not b in [#] K & not the addF of T . (a,b) in rng f & a1 = a & b1 = b holds
( a + b = a1 + b1 & b + a = b1 + a1 & not a + b in [#] K & not b + a in [#] K )
let a1, b1 be Element of T; :: thesis: ( K,T are_disjoint & not a in [#] K & not b in [#] K & not the addF of T . (a,b) in rng f & a1 = a & b1 = b implies ( a + b = a1 + b1 & b + a = b1 + a1 & not a + b in [#] K & not b + a in [#] K ) )
assume AS1: ( K,T are_disjoint & not a in [#] K & not b in [#] K & not the addF of T . (a,b) in rng f & a1 = a & b1 = b ) ; :: thesis: ( a + b = a1 + b1 & b + a = b1 + a1 & not a + b in [#] K & not b + a in [#] K )
reconsider ac = a, bc = b as Element of carr f by defemb;
thus D: a + b = (addemb f) . (a,b) by defemb
.= addemb (f,ac,bc) by defadd
.= a1 + b1 by AS1, defaddf ; :: thesis: ( b + a = b1 + a1 & not a + b in [#] K & not b + a in [#] K )
C: the addF of T . (a1,b1) = a1 + b1
.= b1 + a1
.= the addF of T . (b1,a1) ;
thus E: b + a = (addemb f) . (b,a) by defemb
.= addemb (f,bc,ac) by defadd
.= b1 + a1 by C, AS1, defaddf ; :: thesis: ( not a + b in [#] K & not b + a in [#] K )
thus not a + b in [#] K by D, AS1, XBOOLE_0:def 4; :: thesis: not b + a in [#] K
thus not b + a in [#] K by E, AS1, XBOOLE_0:def 4; :: thesis: verum