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-10682

Color key:    Metamath Proof Explorer  Metamath Proof Explorer (1-8757)   Hilbert Space Explorer  Hilbert Space Explorer (8758-10682)  

Statement List for Metamath Proof Explorer - 6601-6700 - Page 67 of 107
TypeLabelDescription
Statement
 
Theorembernneq 6601 Bernoulli's inequality, due to Johan Bernoulli (1667-1748).
|- ((A e. RR /\ N e. NN0 /\ -u1 <_ A) -> (1 + (A x. N)) <_ ((1 + A)^N))
 
Theorembernneq2 6602 Variation of Bernoulli's inequality bernneq 6601.
|- ((A e. RR /\ N e. NN0 /\ 0 <_ A) -> (((A - 1) x. N) + 1) <_ (A^N))
 
Theoremexpnbndt 6603 Exponentiation with a mantissa greater than 1 has no upper bound.
|- ((A e. RR /\ B e. RR /\ 1 < B) -> E.k e. NN A < (B^k))
 
Discriminant
 
Theoremdiscrlem1 6604 Lemma for discriminant theorem.
 
Theoremdiscrlem2 6605 Lemma for discriminant theorem.
 
Theoremdiscrlem3 6606 Lemma for discriminant theorem.
 
Theoremdiscrlem 6607 If a quadratic polynomial with real coefficients is nonnegative for all values, then its discriminant is non-positive. The antecedent 0 <_ A is redundant but simplifies the proof.
|- A e. RR   &   |- B e. RR   &   |- C e. RR   &   |- A.x e. RR 0 <_ (((A x. (x^2)) + (B x. x)) + C)   =>   |- (0 <_ A -> ((B^2) - (4 x. (A x. C))) <_ 0)
 
More natural number properties
 
Theoremnnsqcl 6608 The square of a natural number is a natural number.
|- N e. NN   =>   |- (N^2) e. NN
 
Theoremnnlesq 6609 A natural number is less than or equal to its square.
|- N e. NN   =>   |- N <_ (N^2)
 
Theoremnnesq 6610 A natural number is even iff its square is even.
|- N e. NN   =>   |- ((N / 2) e. NN <-> ((N^2) / 2) e. NN)
 
Ordered pair theorem for nonnegative integers
 
Theoremnn0le2msqt 6611 The square function on nonnegative integers is monotonic. (Contributed by Raph Levien, 10-Dec-2002.)
|- A e. NN0   &   |- B e. NN0   =>   |- (A <_ B <-> (A x. A) <_ (B x. B))
 
Theoremnn0opthlem1 6612 A rather pretty lemma for nn0opth 6614. (Contributed by Raph Levien, 10-Dec-2002.)
|- A e. NN0   &   |- C e. NN0   =>   |- (A < C <-> ((A x. A) + (2 x. A)) < (C x. C))
 
Theoremnn0opthlem2 6613 Lemma for nn0opth 6614.
 
Theoremnn0opth 6614 An ordered pair theorem for nonnegative integers. Theorem 17.3 of [Quine] p. 124. We can represent an ordered pair of nonnegative integers A and B by (((A + B) x. (A + B)) + B). If two such ordered pairs are equal, their first elements are equal and their second elements are equal. Contrast this ordered pair representation with the standard one df-op 2412 that works for any set. (Contributed by Raph Levien, 10-Dec-2002.)
|- A e. NN0   &   |- B e. NN0   &   |- C e. NN0   &   |- D e. NN0   =>   |- ((((A + B) x. (A + B)) + B) = (((C + D) x. (C + D)) + D) <-> (A = C /\ B = D))
 
Theoremnn0opth2 6615 An ordered pair theorem for nonnegative integers. Theorem 17.3 of [Quine] p. 124. See nn0opth 6614.
|- A e. NN0   &   |- B e. NN0   &   |- C e. NN0   &   |- D e. NN0   =>   |- ((((A + B)^2) + B) = (((C + D)^2) + D) <-> (A = C /\ B = D))
 
Theoremnn0opth2t 6616 An ordered pair theorem for nonnegative integers. Theorem 17.3 of [Quine] p. 124. See nn0opth 6614.
|- (((A e. NN0 /\ B e. NN0) /\ (C e. NN0 /\ D e. NN0)) -> ((((A + B)^2) + B) = (((C + D)^2) + D) <-> (A = C /\ B = D)))
 
Square root
 
Syntaxcsqr 6617 Extend class notation to include positive square root of a positive real number.
class sqr
 
Definitiondf-sqr 6618 Define a function whose value is the square root of a nonnegative real number. The square root of x is the supremum of all reals whose square is less than x. See sqrcl 6648 for its closure, sqrval 6619 for its value, sqrsq 6668 and sqsqr 6669 for its relationship to squares, and sqr11 6651 for uniqueness.
|- sqr = {<.x, y>. | ((x e. RR /\ 0 <_ x) /\ y = sup({z e. RR | (0 <_ z /\ (z x. z) <_ x)}, RR, < ))}
 
Theoremsqrval 6619 Value of square root function.
|- ((A e. RR /\ 0 <_ A) -> (sqr` A) = sup({x e. RR | (0 <_ x /\ (x x. x) <_ A)}, RR, < ))
 
Theoremsqr0 6620 Square root of zero.
|- (sqr` 0) = 0
 
Theoremsqrlem1 6621 Lemma for square root theorem.
 
Theoremsqrlem2 6622 Lemma for square root theorem.
 
Theoremsqrlem3 6623 Lemma for square root theorem.
 
Theoremsqrlem4 6624 Lemma for square root theorem.
 
Theoremsqrlem5 6625 Lemma for square root theorem.
 
Theoremsqrlem6 6626 Lemma for square root theorem.
 
Theoremsqrlem7 6627 Lemma for square root theorem.
 
Theoremsqrlem8 6628 Lemma for square root theorem.
 
Theoremsqrlem9 6629 Lemma for square root theorem.
 
Theoremsqrlem10 6630 Lemma for square root theorem.
 
Theoremsqrlem11 6631 Lemma for square root theorem.
 
Theoremsqrlem12 6632 Lemma for square root theorem.
 
Theoremsqrlem13 6633 Lemma for square root theorem.
 
Theoremsqrlem14 6634 Lemma for square root theorem.
 
Theoremsqrlem15 6635 Lemma for square root theorem.
 
Theoremsqrlem16 6636 Lemma for square root theorem.
 
Theoremsqrlem17 6637 Lemma for square root theorem.
 
Theoremsqrlem18 6638 Lemma for square root theorem.
 
Theoremsqrlem19 6639 Lemma for square root theorem.
 
Theoremsqrlem20 6640 Lemma for square root theorem.
 
Theoremsqrlem21 6641 Lemma for square root theorem.
 
Theoremsqrlem22 6642 Lemma for square root theorem.
 
Theoremsqrlem23 6643 Lemma for square root theorem.
 
Theoremsqrlem24 6644 Lemma for square root closure.
 
Theoremsqrgt0i 6645 The square root of a positive real is positive.
|- A e. RR   &   |- 0 < A   =>   |- 0 < (sqr`
 A)
 
Theoremsqrlem26 6646 Lemma for square root theorem.
 
Theoremsqrth 6647 Square root theorem. Theorem I.35 of [Apostol] p. 29.

(A bit of trivia: This theorem was added to the database before the number 2 was defined and before exponents were defined. Thus you will see (1 + 1) and (x x. x) throughout its lemmas.)

|- A e. RR   =>   |- (0 <_ A -> ((sqr` A) x. (sqr` A)) = A)
 
Theoremsqrcl 6648 The square root of a nonnegative real is a real.
|- A e. RR   =>   |- (0 <_ A -> (sqr`
 A) e. RR)
 
Theoremsqrgt0 6649 The square root of a positive real is positive.
|- A e. RR   =>   |- (0 < A -> 0 < (sqr` A))
 
Theoremsqrge0 6650 The square root of a nonnegative real is nonnegative.
|- A e. RR   =>   |- (0 <_ A -> 0 <_ (sqr` A))
 
Theoremsqr11 6651 The square root function is one-to-one.
|- A e. RR   &   |- B e. RR   =>   |- ((0 <_ A /\ 0 <_ B) -> ((sqr` A) = (sqr` B) <-> A = B))
 
Theoremsqrmuli 6652 Square root distributes over multiplication.
|- A e. RR   &   |- B e. RR   &   |- 0 <_ A   &   |- 0 <_ B   =>   |- (sqr` (A x. B)) = ((sqr` A) x. (sqr` B))
 
Theoremsqrmul 6653 Square root distributes over multiplication.
|- A e. RR   &   |- B e. RR   =>   |- ((0 <_ A /\ 0 <_ B) -> (sqr` (A x. B)) = ((sqr` A) x. (sqr` B)))
 
Theoremsqrmsq2 6654 Relationship between square root and squares.
|- A e. RR   &   |- B e. RR   =>   |- ((0 <_ A /\ 0 <_ B) -> ((sqr` A) = B <-> A = (B x. B)))
 
Theoremsqrle 6655 Square root is monotonic.
|- A e. RR   &   |- B e. RR   =>   |- ((0 <_ A /\ 0 <_ B) -> (A <_ B <-> (sqr`
 A) <_ (sqr` B)))
 
Theoremsqrlt 6656 Square root is strictly monotonic. (Contributed by Roy F. Longton, 8-Aug-2005.)
|- A e. RR   &   |- B e. RR   =>   |- ((0 <_ A /\ 0 <_ B) -> (A < B <-> (sqr`
 A) < (sqr` B)))
 
Theoremsqrmsq 6657 Square root of square.
|- A e. RR   =>   |- (0 <_ A -> (sqr`
 (A x. A)) = A)
 
Theoremsqrclt 6658 The square root of a nonnegative real is a real.
|- ((A e. RR /\ 0 <_ A) -> (sqr` A) e. RR)
 
Theoremsqrgt0t 6659 The square root of a positive real is positive.
|- ((A e. RR /\ 0 < A) -> 0 < (sqr` A))
 
Theoremsqrge0t 6660 The square root of a nonnegative real is nonnegative.
|- ((A e. RR /\ 0 <_ A) -> 0 <_ (sqr` A))
 
Theoremsqrlet 6661 Square root is monotonic.
|- (((A e. RR /\ B e. RR) /\ (0 <_ A /\ 0 <_ B)) -> (A <_ B <-> (sqr` A) <_ (sqr` B)))
 
Theoremsqr00t 6662 A square root is zero iff its argument is 0.
|- ((A e. RR /\ 0 <_ A) -> ((sqr` A) = 0 <-> A = 0))
 
Theoremrpsqrclt 6663 The square root of a positive real is a postive real.
|- (A e. RR+ -> (sqr` A) e. RR+)
 
Theoremsqr1 6664 The square root of 1 is 1.
|- (sqr` 1) = 1
 
Theoremsqr4 6665 The square root of 4 is 2.
|- (sqr` 4) = 2
 
Theoremsqr9 6666 The square root of 9 is 3.
|- (sqr` 9) = 3
 
Theoremsqr2gt1lt2 6667 The square root of 2 is bounded by 1 and 2. (Contributed by Roy F. Longton, 8-Aug-2005.)
|- (1 < (sqr` 2) /\ (sqr` 2) < 2)
 
Theoremsqrsq 6668 Square root of square.
|- A e. RR   =>   |- (0 <_ A -> (sqr`
 (A^2)) = A)
 
Theoremsqsqr 6669 Square of square root.
|- A e. RR   =>   |- (0 <_ A -> ((sqr` A)^2) = A)
 
Theoremsqrsqt 6670 Square root of square.
|- ((A e. RR /\ 0 <_ A) -> (sqr` (A^2)) = A)
 
Theoremsqsqrt 6671 Square of square root.
|- ((A e. RR /\ 0 <_ A) -> ((sqr` A)^2) = A)
 
Irrationality of square root of 2
 
Theoremsqr2irrlem1 6672 Lemma for irrationality of square root of 2. Technical lemma used to simplify the main induction step.
 
Theoremsqr2irrlem2 6673 Lemma for irrationality of square root of 2. Eliminates hypotheses with weak deduction theorem.
 
Theoremsqr2irrlem3 6674 Main theorem for irrationality of square root of 2. There are no natural numbers such that the square of one is twice the square of the other. Uses strong induction.
|- -. E.x e. NN E.y e. NN (x^2) = (2 x. (y^2))
 
Theoremsqr2irrlem4 6675 Lemma for irrationality of square root of 2.
 
Theoremsqr2irrlem5 6676 Lemma for irrationality of square root of 2. Eliminates hypotheses with weak deduction theorem.
 
Theoremsqr2irr 6677 The square root of 2 is irrational.
|- (sqr` 2) e/ QQ
 
Theoremsqr2re 6678 The square root of 2 exists and is a real number.
|- (sqr` 2) e. RR
 
Imaginary and complex number properties
 
Theoremirec 6679 The reciprocal of i.
|- (1 / i) = -ui
 
Theoremi2 6680 i squared.
|- (i^2) = -u1
 
Theoremi3 6681 i cubed.
|- (i^3) = -ui
 
Theoremi4 6682 i to the fourth power.
|- (i^4) = 1
 
Theoreminelr 6683 The imaginary unit i is not a real number.
|- -. i e. RR
 
Theoremcrulem 6684 Lemma for cru 6685.
 
Theoremcru 6685 The representation of complex numbers in terms of real and imaginary parts is unique. Proposition 10-1.3 of [Gleason] p. 130.
|- A e. RR   &   |- B e. RR   &   |- C e. RR   &   |- D e. RR   =>   |- ((A + (i x. B)) = (C + (i x. D)