:: QUOFIELD semantic presentation :: Showing IDV graph ... (Click the Palm Trees again to close it)
definition
let I be non
empty ZeroStr ;
func Q. I -> Subset of
[:the carrier of I,the carrier of I:] means :
Def1:
:: QUOFIELD:def 1
for
u being
set holds
(
u in it iff ex
a,
b being
Element of
I st
(
u = [a,b] &
b <> 0. I ) );
existence
ex b1 being Subset of [:the carrier of I,the carrier of I:] st
for u being set holds
( u in b1 iff ex a, b being Element of I st
( u = [a,b] & b <> 0. I ) )
uniqueness
for b1, b2 being Subset of [:the carrier of I,the carrier of I:] st ( for u being set holds
( u in b1 iff ex a, b being Element of I st
( u = [a,b] & b <> 0. I ) ) ) & ( for u being set holds
( u in b2 iff ex a, b being Element of I st
( u = [a,b] & b <> 0. I ) ) ) holds
b1 = b2
end;
:: deftheorem Def1 defines Q. QUOFIELD:def 1 :
theorem Th1: :: QUOFIELD:1 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th2: :: QUOFIELD:2 :: Showing IDV graph ... (Click the Palm Tree again to close it)
Lm1:
for I being non empty non degenerated multLoopStr_0
for u being Element of Q. I holds
( u `1 is Element of I & u `2 is Element of I )
;
:: deftheorem defines padd QUOFIELD:def 2 :
:: deftheorem defines pmult QUOFIELD:def 3 :
theorem :: QUOFIELD:3 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem Th4: :: QUOFIELD:4 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th5: :: QUOFIELD:5 :: Showing IDV graph ... (Click the Palm Tree again to close it)
:: deftheorem Def4 defines QClass. QUOFIELD:def 4 :
theorem Th6: :: QUOFIELD:6 :: Showing IDV graph ... (Click the Palm Tree again to close it)
:: deftheorem Def5 defines Quot. QUOFIELD:def 5 :
theorem Th7: :: QUOFIELD:7 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th8: :: QUOFIELD:8 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th9: :: QUOFIELD:9 :: Showing IDV graph ... (Click the Palm Tree again to close it)
:: deftheorem Def6 defines qadd QUOFIELD:def 6 :
:: deftheorem Def7 defines qmult QUOFIELD:def 7 :
theorem :: QUOFIELD:10 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem Th11: :: QUOFIELD:11 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th12: :: QUOFIELD:12 :: Showing IDV graph ... (Click the Palm Tree again to close it)
:: deftheorem Def8 defines q0. QUOFIELD:def 8 :
:: deftheorem Def9 defines q1. QUOFIELD:def 9 :
:: deftheorem Def10 defines qaddinv QUOFIELD:def 10 :
:: deftheorem Def11 defines qmultinv QUOFIELD:def 11 :
theorem Th13: :: QUOFIELD:13 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th14: :: QUOFIELD:14 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th15: :: QUOFIELD:15 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th16: :: QUOFIELD:16 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th17: :: QUOFIELD:17 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th18: :: QUOFIELD:18 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th19: :: QUOFIELD:19 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th20: :: QUOFIELD:20 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th21: :: QUOFIELD:21 :: Showing IDV graph ... (Click the Palm Tree again to close it)
definition
let I be
commutative non
degenerated domRing-like Ring;
func quotadd I -> BinOp of
Quot. I means :
Def12:
:: QUOFIELD:def 12
for
u,
v being
Element of
Quot. I holds
it . u,
v = qadd u,
v;
existence
ex b1 being BinOp of Quot. I st
for u, v being Element of Quot. I holds b1 . u,v = qadd u,v
uniqueness
for b1, b2 being BinOp of Quot. I st ( for u, v being Element of Quot. I holds b1 . u,v = qadd u,v ) & ( for u, v being Element of Quot. I holds b2 . u,v = qadd u,v ) holds
b1 = b2
end;
:: deftheorem Def12 defines quotadd QUOFIELD:def 12 :
definition
let I be
commutative non
degenerated domRing-like Ring;
func quotmult I -> BinOp of
Quot. I means :
Def13:
:: QUOFIELD:def 13
for
u,
v being
Element of
Quot. I holds
it . u,
v = qmult u,
v;
existence
ex b1 being BinOp of Quot. I st
for u, v being Element of Quot. I holds b1 . u,v = qmult u,v
uniqueness
for b1, b2 being BinOp of Quot. I st ( for u, v being Element of Quot. I holds b1 . u,v = qmult u,v ) & ( for u, v being Element of Quot. I holds b2 . u,v = qmult u,v ) holds
b1 = b2
end;
:: deftheorem Def13 defines quotmult QUOFIELD:def 13 :
:: deftheorem Def14 defines quotaddinv QUOFIELD:def 14 :
:: deftheorem Def15 defines quotmultinv QUOFIELD:def 15 :
theorem Th22: :: QUOFIELD:22 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th23: :: QUOFIELD:23 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th24: :: QUOFIELD:24 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th25: :: QUOFIELD:25 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th26: :: QUOFIELD:26 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th27: :: QUOFIELD:27 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th28: :: QUOFIELD:28 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th29: :: QUOFIELD:29 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th30: :: QUOFIELD:30 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th31: :: QUOFIELD:31 :: Showing IDV graph ... (Click the Palm Tree again to close it)
:: deftheorem defines the_Field_of_Quotients QUOFIELD:def 16 :
theorem :: QUOFIELD:32 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th33: :: QUOFIELD:33 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th34: :: QUOFIELD:34 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th35: :: QUOFIELD:35 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: QUOFIELD:36 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: QUOFIELD:37 :: Showing IDV graph ... (Click the Palm Tree again to close it)
Lm2:
for I being commutative non degenerated domRing-like Ring
for u, v, w being Element of (the_Field_of_Quotients I) holds (u + v) + w = u + (v + w)
Lm3:
for I being commutative non degenerated domRing-like Ring
for u, v being Element of (the_Field_of_Quotients I) holds u + v = v + u
Lm4:
for I being commutative non degenerated domRing-like Ring
for u being Element of (the_Field_of_Quotients I) holds u + (0. (the_Field_of_Quotients I)) = u
Lm5:
for I being commutative non degenerated domRing-like Ring holds
( the_Field_of_Quotients I is add-associative & the_Field_of_Quotients I is right_zeroed & the_Field_of_Quotients I is right_complementable )
theorem :: QUOFIELD:38 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: QUOFIELD:39 :: Showing IDV graph ... (Click the Palm Tree again to close it)
Lm6:
for I being commutative non degenerated domRing-like Ring
for u, v being Element of (the_Field_of_Quotients I) holds u * v = v * u
by Th26;
Lm7:
for I being commutative non degenerated domRing-like Ring holds the_Field_of_Quotients I is non empty commutative doubleLoopStr
Lm8:
for I being commutative non degenerated domRing-like Ring
for h, e being Element of (the_Field_of_Quotients I) st e = q1. I holds
( e * h = h & h * e = h )
by Th27;
Lm9:
for I being commutative non degenerated domRing-like Ring holds the_Field_of_Quotients I is unital
Lm10:
for I being commutative non degenerated domRing-like Ring holds 1. (the_Field_of_Quotients I) = q1. I
Lm11:
for I being commutative non degenerated domRing-like Ring
for u being Element of (the_Field_of_Quotients I) holds (1. (the_Field_of_Quotients I)) * u = u
theorem :: QUOFIELD:40 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: QUOFIELD:41 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: QUOFIELD:42 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: QUOFIELD:43 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: QUOFIELD:44 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem :: QUOFIELD:45 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: QUOFIELD:46 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th47: :: QUOFIELD:47 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th48: :: QUOFIELD:48 :: Showing IDV graph ... (Click the Palm Tree again to close it)
Lm12:
for I being commutative non degenerated domRing-like Ring
for u, v, w being Element of (the_Field_of_Quotients I) holds
( u * (v + w) = (u * v) + (u * w) & (u + v) * w = (u * w) + (v * w) )
theorem Th49: :: QUOFIELD:49 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th50: :: QUOFIELD:50 :: Showing IDV graph ... (Click the Palm Tree again to close it)
:: deftheorem defines / QUOFIELD:def 17 :
theorem Th51: :: QUOFIELD:51 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th52: :: QUOFIELD:52 :: Showing IDV graph ... (Click the Palm Tree again to close it)
:: deftheorem QUOFIELD:def 18 :
canceled;
:: deftheorem QUOFIELD:def 19 :
canceled;
:: deftheorem QUOFIELD:def 20 :
canceled;
:: deftheorem Def21 defines RingHomomorphism QUOFIELD:def 21 :
:: deftheorem Def22 defines RingEpimorphism QUOFIELD:def 22 :
:: deftheorem Def23 defines RingMonomorphism QUOFIELD:def 23 :
:: deftheorem Def24 defines RingIsomorphism QUOFIELD:def 24 :
theorem Th53: :: QUOFIELD:53 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th54: :: QUOFIELD:54 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th55: :: QUOFIELD:55 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th56: :: QUOFIELD:56 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th57: :: QUOFIELD:57 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th58: :: QUOFIELD:58 :: Showing IDV graph ... (Click the Palm Tree again to close it)
:: deftheorem Def25 defines is_embedded_in QUOFIELD:def 25 :
:: deftheorem Def26 defines is_ringisomorph_to QUOFIELD:def 26 :
:: deftheorem Def27 defines quotient QUOFIELD:def 27 :
:: deftheorem Def28 defines canHom QUOFIELD:def 28 :
theorem Th59: :: QUOFIELD:59 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th60: :: QUOFIELD:60 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: QUOFIELD:61 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th62: :: QUOFIELD:62 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: QUOFIELD:63 :: Showing IDV graph ... (Click the Palm Tree again to close it)
:: deftheorem Def29 defines has_Field_of_Quotients_Pair QUOFIELD:def 29 :
theorem :: QUOFIELD:64 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: QUOFIELD:65 :: Showing IDV graph ... (Click the Palm Tree again to close it)