HomeHome Metamath Proof Explorer < Previous   Next >
Browser slow? Try the
Unicode version.

Jump to page: Contents + 1 1-100 2 101-200 3 201-300 4 301-400 5 401-500 6 501-600 7 601-700 8 701-800 9 801-900 10 901-1000 11 1001-1100 12 1101-1200 13 1201-1300 14 1301-1400 15 1401-1500 16 1501-1600 17 1601-1700 18 1701-1800 19 1801-1900 20 1901-2000 21 2001-2100 22 2101-2200 23 2201-2300 24 2301-2400 25 2401-2500 26 2501-2600 27 2601-2700 28 2701-2800 29 2801-2900 30 2901-3000 31 3001-3100 32 3101-3200 33 3201-3300 34 3301-3400 35 3401-3500 36 3501-3600 37 3601-3700 38 3701-3800 39 3801-3900 40 3901-4000 41 4001-4100 42 4101-4200 43 4201-4300 44 4301-4400 45 4401-4500 46 4501-4600 47 4601-4700 48 4701-4800 49 4801-4900 50 4901-5000 51 5001-5100 52 5101-5200 53 5201-5300 54 5301-5400 55 5401-5500 56 5501-5600 57 5601-5700 58 5701-5800 59 5801-5900 60 5901-6000 61 6001-6100 62 6101-6200 63 6201-6300 64 6301-6400 65 6401-6500 66 6501-6600 67 6601-6700 68 6701-6800 69 6801-6900 70 6901-7000 71 7001-7100 72 7101-7200 73 7201-7300 74 7301-7400 75 7401-7500 76 7501-7600 77 7601-7700 78 7701-7800 79 7801-7900 80 7901-8000 81 8001-8100 82 8101-8200 83 8201-8300 84 8301-8400 85 8401-8500 86 8501-8600 87 8601-8700 88 8701-8800 89 8801-8900 90 8901-9000 91 9001-9100 92 9101-9200 93 9201-9300 94 9301-9400 95 9401-9500 96 9501-9600 97 9601-9700 98 9701-9800 99 9801-9900 100 9901-10000 101 10001-10100 102 10101-10200 103 10201-10300 104 10301-10400 105 10401-10500 106 10501-10600 107 10601-10700 108 10701-10800 109 10801-10900 110 10901-11000 111 11001-11100 112 11101-11200 113 11201-11300 114 11301-11400 115 11401-11500 116 11501-11600 117 11601-11700 118 11701-11800 119 11801-11900 120 11901-12000 121 12001-12100 122 12101-12200 123 12201-12300 124 12301-12400 125 12401-12500 126 12501-12600 127 12601-12700 128 12701-12800 129 12801-12900 130 12901-13000 131 13001-13100 132 13101-13200 133 13201-13300 134 13301-13400 135 13401-13500 136 13501-13600 137 13601-13700 138 13701-13800 139 13801-13900 140 13901-14000 141 14001-14100 142 14101-14200 143 14201-14300 144 14301-14400 145 14401-14500 146 14501-14600 147 14601-14700 148 14701-14800 149 14801-14900 150 14901-15000 151 15001-15100 152 15101-15200 153 15201-15300 154 15301-15400 155 15401-15500 156 15501-15600 157 15601-15700 158 15701-15800 159 15801-15900 160 15901-16000 161 16001-16100 162 16101-16200 163 16201-16300 164 16301-16400 165 16401-16500 166 16501-16600 167 16601-16700 168 16701-16800 169 16801-16900 170 16901-17000 171 17001-17100 172 17101-17200 173 17201-17300 174 17301-17400 175 17401-17411

Color key:    Metamath Proof Explorer  Metamath Proof Explorer
(1-10419)
  Hilbert Space Explorer  Hilbert Space Explorer
(10420-12013)
  Users' Mathboxes  Users' Mathboxes
(12014-17411)
 

Statement List for Metamath Proof Explorer - 6901-7000 - Page 70 of 175
TypeLabelDescription
Statement
 
Theoremdivcl 6901 Closure law for division.
|- ((A e. CC /\ B e. CC /\ B =/= 0) -> (A / B) e. CC)
 
Theoremreccli 6902 Closure law for reciprocal.
|- A e. CC   &   |- A =/= 0   =>   |- (1 / A) e. CC
 
Theoremrecclzi 6903 Closure law for reciprocal.
|- A e. CC   =>   |- (A =/= 0 -> (1 / A) e. CC)
 
Theoremreccl 6904 Closure law for reciprocal.
|- ((A e. CC /\ A =/= 0) -> (1 / A) e. CC)
 
Theoremdivcan2i 6905 A cancellation law for division.
|- A e. CC   &   |- B e. CC   &   |- B =/= 0   =>   |- (B x. (A / B)) = A
 
Theoremdivcan1i 6906 A cancellation law for division.
|- A e. CC   &   |- B e. CC   &   |- B =/= 0   =>   |- ((A / B) x. B) = A
 
Theoremdivcan1zi 6907 A cancellation law for division.
|- A e. CC   &   |- B e. CC   =>   |- (B =/= 0 -> ((A / B) x. B) = A)
 
Theoremdivcan2zi 6908 A cancellation law for division. We eliminate the third hypothesis of divcan2i 6905 using the weak deduction theorem dedth 3011 and keep the other two. Because the first hypothesis shares the class variable B with the hypothesis we're eliminating, we need to use keepel 3030 in order to keep the first hypothesis.
|- A e. CC   &   |- B e. CC   =>   |- (B =/= 0 -> (B x. (A / B)) = A)
 
Theoremdivcan1 6909 A cancellation law for division.
|- ((A e. CC /\ B e. CC /\ B =/= 0) -> ((A / B) x. B) = A)
 
Theoremdivcan2 6910 A cancellation law for division.
|- ((A e. CC /\ B e. CC /\ B =/= 0) -> (B x. (A / B)) = A)
 
Theoremdivne0b 6911 The ratio of nonzero numbers is nonzero.
|- ((A e. CC /\ B e. CC /\ B =/= 0) -> (A =/= 0 <-> (A / B) =/= 0))
 
Theoremdivne0 6912 The ratio of nonzero numbers is nonzero.
|- (((A e. CC /\ A =/= 0) /\ (B e. CC /\ B =/= 0)) -> (A / B) =/= 0)
 
Theoremdivne0i 6913 The ratio of nonzero numbers is nonzero.
|- A e. CC   &   |- B e. CC   &   |- A =/= 0   &   |- B =/= 0   =>   |- (A / B) =/= 0
 
Theoremrecne0zi 6914 The reciprocal of a nonzero number is nonzero.
|- A e. CC   =>   |- (A =/= 0 -> (1 / A) =/= 0)
 
Theoremrecne0 6915 The reciprocal of a nonzero number is nonzero.
|- ((A e. CC /\ A =/= 0) -> (1 / A) =/= 0)
 
Theoremrecidi 6916 Multiplication of a number and its reciprocal.
|- A e. CC   &   |- A =/= 0   =>   |- (A x. (1 / A)) = 1
 
Theoremrecidzi 6917 Multiplication of a number and its reciprocal.
|- A e. CC   =>   |- (A =/= 0 -> (A x. (1 / A)) = 1)
 
Theoremrecid 6918 Multiplication of a number and its reciprocal.
|- ((A e. CC /\ A =/= 0) -> (A x. (1 / A)) = 1)
 
Theoremrecid2 6919 Multiplication of a number and its reciprocal.
|- ((A e. CC /\ A =/= 0) -> ((1 / A) x. A) = 1)
 
Theoremdivreci 6920 Relationship between division and reciprocal. Theorem I.9 of [Apostol] p. 18.
|- A e. CC   &   |- B e. CC   &   |- B =/= 0   =>   |- (A / B) = (A x. (1 / B))
 
Theoremdivreczi 6921 Relationship between division and reciprocal. Theorem I.9 of [Apostol] p. 18.
|- A e. CC   &   |- B e. CC   =>   |- (B =/= 0 -> (A / B) = (A x. (1 / B)))
 
Theoremdivrec 6922 Relationship between division and reciprocal. Theorem I.9 of [Apostol] p. 18.
|- ((A e. CC /\ B e. CC /\ B =/= 0) -> (A / B) = (A x. (1 / B)))
 
Theoremdivrec2 6923 Relationship between division and reciprocal.
|- ((A e. CC /\ B e. CC /\ B =/= 0) -> (A / B) = ((1 / B) x. A))
 
Theoremdivass 6924 An associative law for division.
|- ((A e. CC /\ B e. CC /\ (C e. CC /\ C =/= 0)) -> ((A x. B) / C) = (A x. (B / C)))
 
Theoremdiv23 6925 A commutative/associative law for division.
|- ((A e. CC /\ B e. CC /\ (C e. CC /\ C =/= 0)) -> ((A x. B) / C) = ((A / C) x. B))
 
Theoremdiv13 6926 A commutative/associative law for division.
|- ((A e. CC /\ (B e. CC /\ B =/= 0) /\ C e. CC) -> ((A / B) x. C) = ((C / B) x. A))
 
Theoremdiv12 6927 A commutative/associative law for division.
|- ((A e. CC /\ B e. CC /\ (C e. CC /\ C =/= 0)) -> (A x. (B / C)) = (B x. (A / C)))
 
Theoremdivasszi 6928 An associative law for division.
|- A e. CC   &   |- B e. CC   &   |- C e. CC   =>   |- (C =/= 0 -> ((A x. B) / C) = (A x. (B / C)))
 
Theoremdivassi 6929 An associative law for division.
|- A e. CC   &   |- B e. CC   &   |- C e. CC   &   |- C =/= 0   =>   |- ((A x. B) / C) = (A x. (B / C))
 
Theoremdivdiri 6930 Distribution of division over addition.
|- A e. CC   &   |- B e. CC   &   |- C e. CC   &   |- C =/= 0   =>   |- ((A + B) / C) = ((A / C) + (B / C))
 
Theoremdiv23i 6931 A commutative/associative law for division.
|- A e. CC   &   |- B e. CC   &   |- C e. CC   &   |- C =/= 0   =>   |- ((A x. B) / C) = ((A / C) x. B)
 
Theoremdivdirzi 6932 Distribution of division over addition.
|- A e. CC   &   |- B e. CC   &   |- C e. CC   =>   |- (C =/= 0 -> ((A + B) / C) = ((A / C) + (B / C)))
 
Theoremdivdir 6933 Distribution of division over addition.
|- ((A e. CC /\ B e. CC /\ (C e. CC /\ C =/= 0)) -> ((A + B) / C) = ((A / C) + (B / C)))
 
Theoremdivcan3i 6934 A cancellation law for division.
|- A e. CC   &   |- B e. CC   &   |- B =/= 0   =>   |- ((B x. A) / B) = A
 
Theoremdivcan4i 6935 A cancellation law for division.
|- A e. CC   &   |- B e. CC   &   |- B =/= 0   =>   |- ((A x. B) / B) = A
 
Theoremdivcan3zi 6936 A cancellation law for division. (Eliminates a hypothesis of divcan3i 6934 with the weak deduction theorem.)
|- A e. CC   &   |- B e. CC   =>   |- (B =/= 0 -> ((B x. A) / B) = A)
 
Theoremdivcan4zi 6937 A cancellation law for division.
|- A e. CC   &   |- B e. CC   =>   |- (B =/= 0 -> ((A x. B) / B) = A)
 
Theoremdivcan3 6938 A cancellation law for division.
|- ((A e. CC /\ B e. CC /\ B =/= 0) -> ((B x. A) / B) = A)
 
Theoremdivcan4 6939 A cancellation law for division.
|- ((A e. CC /\ B e. CC /\ B =/= 0) -> ((A x. B) / B) = A)
 
Theoremdiv11i 6940 One-to-one relationship for division.
|- A e. CC   &   |- B e. CC   &   |- C e. CC   &   |- C =/= 0   =>   |- ((A / C) = (B / C) <-> A = B)
 
Theoremdiv11 6941 One-to-one relationship for division.
|- ((A e. CC /\ B e. CC /\ (C e. CC /\ C =/= 0)) -> ((A / C) = (B / C) <-> A = B))
 
Theoremdivid 6942 A number divided by itself is one.
|- ((A e. CC /\ A =/= 0) -> (A / A) = 1)
 
Theoremdiv0 6943 Division into zero is zero.
|- ((A e. CC /\ A =/= 0) -> (0 / A) = 0)
 
Theoremdiveq0 6944 A ratio is zero iff the numerator is zero.
|- ((A e. CC /\ C e. CC /\ C =/= 0) -> ((A / C) = 0 <-> A = 0))
 
Theoremrecreci 6945 A number is equal to the reciprocal of its reciprocal. Theorem I.10 of [Apostol] p. 18.
|- A e. CC   &   |- A =/= 0   =>   |- (1 / (1 / A)) = A
 
Theoremdividi 6946 A number divided by itself is one.
|- A e. CC   &   |- A =/= 0   =>   |- (A / A) = 1
 
Theoremdiv0i 6947 Division into zero is zero.
|- A e. CC   &   |- A =/= 0   =>   |- (0 / A) = 0
 
Theoremdiv1i 6948 A number divided by 1 is itself.
|- A e. CC   =>   |- (A / 1) = A
 
Theoremdiv1 6949 A number divided by 1 is itself.
|- (A e. CC -> (A / 1) = A)
 
Theoremdivneg 6950 Move negative sign inside of a division.
|- ((A e. CC /\ B e. CC /\ B =/= 0) -> -u(A / B) = (-uA / B))
 
Theoremdivsubdir 6951 Distribution of division over subtraction.
|- ((A e. CC /\ B e. CC /\ (C e. CC /\ C =/= 0)) -> ((A - B) / C) = ((A / C) - (B / C)))
 
Theoremrecrec 6952 A number is equal to the reciprocal of its reciprocal. Theorem I.10 of [Apostol] p. 18.
|- ((A e. CC /\ A =/= 0) -> (1 / (1 / A)) = A)
 
Theoremrec11ii 6953 Reciprocal is one-to-one.
|- A e. CC   &   |- B e. CC   &   |- A =/= 0   &   |- B =/= 0   =>   |- ((1 / A) = (1 / B) <-> A = B)
 
Theoremrec11i 6954 Reciprocal is one-to-one.
|- A e. CC   &   |- B e. CC   =>   |- ((A =/= 0 /\ B =/= 0) -> ((1 / A) = (1 / B) <-> A = B))
 
Theoremrec11r 6955 Mutual reciprocals. (Contributed by Paul Chapman, 18-Oct-2007.)
|- (((A e. CC /\ A =/= 0) /\ (B e. CC /\ B =/= 0)) -> ((1 / A) = B <-> (1 / B) = A))
 
Theoremdivmuldiv 6956 Multiplication of two ratios. Theorem I.14 of [Apostol] p. 18.
|- (((A e. CC /\ B e. CC) /\ ((C e. CC /\ C =/= 0) /\ (D e. CC /\ D =/= 0))) -> ((A / C) x. (B / D)) = ((A x. B) / (C x. D)))
 
Theoremdivcan5 6957 Cancellation of common factor in a ratio.
|- ((A e. CC /\ (B e. CC /\ B =/= 0) /\ (C e. CC /\ C =/= 0)) -> ((C x. A) / (C x. B)) = (A / B))
 
Theoremdivmul13 6958 Swap the denominators in the product of two ratios.
|- (((A e. CC /\ B e. CC) /\ ((C e. CC /\ C =/= 0) /\ (D e. CC /\ D =/= 0))) -> ((A / C) x. (B / D)) = ((B / C) x. (A / D)))
 
Theoremdivmul24 6959 Swap the numerators in the product of two ratios.
|- (((A e. CC /\ B e. CC) /\ ((C e. CC /\ C =/= 0) /\ (D e. CC /\ D =/= 0))) -> ((A / C) x. (B / D)) = ((A / D) x. (B / C)))
 
Theoremdivadddiv 6960 Addition of two ratios. Theorem I.13 of [Apostol] p. 18.
|- (((A e. CC /\ B e. CC) /\ ((C e. CC /\ C =/= 0) /\ (D e. CC /\ D =/= 0))) -> ((A / C) + (B / D)) = (((A x. D) + (C x. B)) / (C x. D)))
 
Theoremdivdivdiv 6961 Division of two ratios. Theorem I.15 of [Apostol] p. 18.
|- (((A e. CC /\ (B e. CC /\ B =/= 0)) /\ ((C e. CC /\ C =/= 0) /\ (D e. CC /\ D =/= 0))) -> ((A / B) / (C / D)) = ((A x. D) / (B x. C)))
 
TheoremdivdivdivOLD 6962 Division of two ratios. Theorem I.15 of [Apostol] p. 18.
|- (((A e. CC /\ (B e. CC /\ B =/= 0)) /\ ((C e. CC /\ C =/= 0) /\ (D e. CC /\ D =/= 0))) -> ((A / B) / (C / D)) = ((A x. D) / (B x. C)))
 
Theoremdivmuldivi 6963 Multiplication of two ratios. Theorem I.14 of [Apostol] p. 18.
|- A e. CC   &   |- B e. CC   &   |- C e. CC   &   |- D e. CC   &   |- B =/= 0   &   |- D =/= 0   =>   |- ((A / B) x. (C / D)) = ((A x. C) / (B x. D))
 
Theoremdivmul13i 6964 Swap denominators of two ratios.
|- A e. CC   &   |- B e. CC   &   |- C e. CC   &   |- D e. CC   &   |- B =/= 0   &   |- D =/= 0   =>   |- ((A / B) x. (C / D)) = ((C / B) x. (A / D))
 
Theoremdivadddivi 6965 Addition of two ratios. Theorem I.13 of [Apostol] p. 18.
|- A e. CC   &   |- B e. CC   &   |- C e. CC   &   |- D e. CC   &   |- B =/= 0   &   |- D =/= 0   =>   |- ((A / B) + (C / D)) = (((A x. D) + (B x. C)) / (B x. D))
 
Theoremdivdivdivi 6966 Division of two ratios. Theorem I.15 of [Apostol] p. 18.
|- A e. CC   &   |- B e. CC   &   |- C e. CC   &   |- D e. CC   &   |- B =/= 0   &   |- D =/= 0   &   |- C =/= 0   =>   |- ((A / B) / (C / D)) = ((A x. D) / (B x. C))
 
Theoremrecdiv 6967 The reciprocal of a ratio.
|- (((A e. CC /\ A =/= 0) /\ (B e. CC /\ B =/= 0)) -> (1 / (A / B)) = (B / A))
 
Theoremdivcan6 6968 Cancellation of inverted fractions.
|- (((A e. CC /\ A =/= 0) /\ (B e. CC /\ B =/= 0)) -> ((A / B) x. (B / A)) = 1)
 
Theoremdivdiv23 6969 Swap denominators in a division.
|- ((A e. CC /\ (B e. CC /\ B =/= 0) /\ (C e. CC /\ C =/= 0)) -> ((A / B) / C) = ((A / C) / B))
 
Theoremdivdiv23i 6970 Swap denominators in a division.
|- A e. CC   &   |- B e. CC   &   |- C e. CC   &   |- B =/= 0   &   |- C =/= 0   =>   |- ((A / B) / C) = ((A / C) / B)
 
Theoremdivdiv23zi 6971 Swap denominators in a division.
|- A e. CC   &   |- B e. CC   &   |- C e. CC   =>   |- ((B =/= 0 /\ C =/= 0) -> ((A / B) / C) = ((A / C) / B))
 
Theoremdivdiv1 6972 Division into a fraction.
|- ((A e. CC /\ (B e. CC /\ B =/= 0) /\ (C e. CC /\ C =/= 0)) -> ((A / B) / C) = (A / (B x. C)))
 
Theoremdivdiv2 6973 Division by a fraction.
|- ((A e. CC /\ (B e. CC /\ B =/= 0) /\ (C e. CC /\ C =/= 0)) -> (A / (B / C)) = ((A x. C) / B))
 
Theoremrecdiv2 6974 Division into a reciprocal.
|- (((A e. CC /\ A =/= 0) /\ (B e. CC /\ B =/= 0)) -> ((1 / A) / B) = (1 / (A x. B)))
 
Theoremconjmul 6975 Two numbers whose reciprocals sum to 1 are called "conjugates" and satisfy this relationship. Equation 5 of [Kreyszig] p. 12.
|- (((P e. CC /\ P =/= 0) /\ (Q e. CC /\ Q =/= 0)) -> (((1 / P) + (1 / Q)) = 1 <-> ((P - 1) x. (Q - 1)) = 1))
 
Theoremredivcli 6976 Closure law for division of reals.
|- A e. RR   &   |- B e. RR   &   |- B =/= 0   =>   |- (A / B) e. RR
 
Theoremredivclzi 6977 Closure law for division of reals.
|- A e. RR   &   |- B e. RR   =>   |- (B =/= 0 -> (A / B) e. RR)
 
Theoremredivcl 6978 Closure law for division of reals.
|- ((A e. RR /\ B e. RR /\ B =/= 0) -> (A / B) e. RR)
 
Theoremrereccli 6979 Closure law for reciprocal.
|- A e. RR   &   |- A =/= 0   =>   |- (1 / A) e. RR
 
Theoremrerecclzi 6980 Closure law for reciprocal.
|- A e. RR   =>   |- (A =/= 0 -> (1 / A) e. RR)
 
Theoremrereccl 6981 Closure law for reciprocal.
|- ((A e. RR /\ A =/= 0) -> (1 / A) e. RR)
 
Theoremeqnegi 6982 A number equal to its negative is zero.
|- A e. CC   =>   |- (A = -uA <-> A = 0)
 
Theoremeqneg 6983 A number equal to its negative is zero.
|- (A e. CC -> (A = -uA <-> A = 0))
 
Theoremnegeq0 6984 A number is zero iff its negative is zero.
|- (A e. CC -> (A = 0 <-> -uA = 0))
 
Theoremnegne0bi 6985 A number is nonzero iff its negative is nonzero.
|- A e. CC   =>   |- (A =/= 0 <-> -uA =/= 0)
 
Theoremnegne0i 6986 The negative of a nonzero number is nonzero.
|- A e. CC   &   |- A =/= 0   =>   |- -uA =/= 0
 
Ordering on reals (cont.)
 
Theoremelimgt0 6987 Hypothesis for weak deduction theorem to eliminate 0 < A.
|- 0 < if(0 < A, A, 1)
 
Theoremelimge0 6988 Hypothesis for weak deduction theorem to eliminate 0 <_ A.
|- 0 <_ if(0 <_ A, A, 0)
 
Theoremltp1 6989 A number is less than itself plus 1.
|- (A e. RR -> A < (A + 1))
 
Theoremlep1 6990 A number is less than or equal to itself plus 1.
|- (A e. RR -> A <_ (A + 1))
 
Theoremltp1i 6991 A number is less than itself plus 1.
|- A e. RR   =>   |- A < (A + 1)
 
Theoremrecgt0ii 6992 The reciprocal of a positive number is positive. Exercise 4 of [Apostol] p. 21.
|- A e. RR   &   |- 0 < A   =>   |- 0 < (1 / A)
 
Theoremltm1 6993 A number minus 1 is less than itself.
|- (A e. RR -> (A - 1) < A)
 
Theoremletrp1 6994 A transitive property of 'less than or equal' and plus 1.
|- ((A e. RR /\ B e. RR /\ A <_ B) -> A <_ (B + 1))
 
Theoremp1le 6995 A transitive property of plus 1 and 'less than or equal'.
|- ((A e. RR /\ B e. RR /\ (A + 1) <_ B) -> A <_ B)
 
Theoremprodgt0lem 6996 Lemma for prodgt0i 6997.
 
Theoremprodgt0i 6997 Infer that a multiplicand is positive from a nonnegative muliplier and positive product.
|- A e. RR   &   |- B e. RR   =>   |- ((0 <_ A /\ 0 < (A x. B)) -> 0 < B)
 
Theoremprodge0i 6998 Infer that a multiplicand is nonnegative from a positive muliplier and nonnegative product.
|- A e. RR   &   |- B e. RR   =>   |- ((0 < A /\ 0 <_ (A x. B)) -> 0 <_ B)
 
Theoremltmul1ii 6999 Multiplication of both sides of 'less than' by a positive number. Theorem I.19 of [Apostol] p. 20. (Proof shortened by Paul Chapman, 25-Jan-2008.)
|- A e. RR   &   |- B e. RR   &   |- C e. RR   &   |- 0 < C   =>   |- (A < B <-> (A x. C) < (B x. C))
 
Theoremltmul1i 7000 Multiplication of both sides of 'less than' by a positive number. Theorem I.19 of [Apostol] p. 20.
|- A e. RR   &   |- B e. RR   &   |- C e. RR   =>   |- (0 < C -> (A < B <-> (A x. C) < (B x. C)))

MPE Home   Contents Copyright terms: Public domain < Previous  Next >