 Home Intuitionistic Logic ExplorerTheorem List (p. 7 of 95) < Previous  Next > Bad symbols? Try the GIF version. Mirrors  >  Metamath Home Page  >  ILE Home Page  >  Theorem List Contents  >  Recent Proofs       This page: Page List

Theorem List for Intuitionistic Logic Explorer - 601-700   *Has distinct variable group(s)
TypeLabelDescription
Statement

Theoremsylnibr 601 A mixed syllogism inference from an implication and a biconditional. Useful for substituting an consequent with a definition. (Contributed by Wolf Lammen, 16-Dec-2013.)
(φ → ¬ ψ)    &   (χψ)       (φ → ¬ χ)

Theoremsylnbi 602 A mixed syllogism inference from a biconditional and an implication. Useful for substituting an antecedent with a definition. (Contributed by Wolf Lammen, 16-Dec-2013.)
(φψ)    &   ψχ)       φχ)

Theoremsylnbir 603 A mixed syllogism inference from a biconditional and an implication. (Contributed by Wolf Lammen, 16-Dec-2013.)
(ψφ)    &   ψχ)       φχ)

Theoremxchnxbi 604 Replacement of a subexpression by an equivalent one. (Contributed by Wolf Lammen, 27-Sep-2014.)
φψ)    &   (φχ)       χψ)

Theoremxchnxbir 605 Replacement of a subexpression by an equivalent one. (Contributed by Wolf Lammen, 27-Sep-2014.)
φψ)    &   (χφ)       χψ)

Theoremxchbinx 606 Replacement of a subexpression by an equivalent one. (Contributed by Wolf Lammen, 27-Sep-2014.)
(φ ↔ ¬ ψ)    &   (ψχ)       (φ ↔ ¬ χ)

Theoremxchbinxr 607 Replacement of a subexpression by an equivalent one. (Contributed by Wolf Lammen, 27-Sep-2014.)
(φ ↔ ¬ ψ)    &   (χψ)       (φ ↔ ¬ χ)

Theoremmt2bi 608 A false consequent falsifies an antecedent. (Contributed by NM, 19-Aug-1993.) (Proof shortened by Wolf Lammen, 12-Nov-2012.)
φ       ψ ↔ (ψ → ¬ φ))

Theoremmtt 609 Modus-tollens-like theorem. (Contributed by NM, 7-Apr-2001.) (Revised by Mario Carneiro, 31-Jan-2015.)
φ → (¬ ψ ↔ (ψφ)))

Theorempm5.21 610 Two propositions are equivalent if they are both false. Theorem *5.21 of [WhiteheadRussell] p. 124. (Contributed by NM, 21-May-1994.) (Revised by Mario Carneiro, 31-Jan-2015.)
((¬ φ ¬ ψ) → (φψ))

Theorempm5.21im 611 Two propositions are equivalent if they are both false. Closed form of 2false 616. Equivalent to a bi2 121-like version of the xor-connective. (Contributed by Wolf Lammen, 13-May-2013.) (Revised by Mario Carneiro, 31-Jan-2015.)
φ → (¬ ψ → (φψ)))

Theoremnbn2 612 The negation of a wff is equivalent to the wff's equivalence to falsehood. (Contributed by Juha Arpiainen, 19-Jan-2006.) (Revised by Mario Carneiro, 31-Jan-2015.)
φ → (¬ ψ ↔ (φψ)))

Theorembibif 613 Transfer negation via an equivalence. (Contributed by NM, 3-Oct-2007.) (Proof shortened by Wolf Lammen, 28-Jan-2013.)
ψ → ((φψ) ↔ ¬ φ))

Theoremnbn 614 The negation of a wff is equivalent to the wff's equivalence to falsehood. (Contributed by NM, 5-Aug-1993.) (Proof shortened by Wolf Lammen, 3-Oct-2013.)
¬ φ       ψ ↔ (ψφ))

Theoremnbn3 615 Transfer falsehood via equivalence. (Contributed by NM, 11-Sep-2006.)
φ       ψ ↔ (ψ ↔ ¬ φ))

Theorem2false 616 Two falsehoods are equivalent. (Contributed by NM, 4-Apr-2005.) (Revised by Mario Carneiro, 31-Jan-2015.)
¬ φ    &    ¬ ψ       (φψ)

Theorem2falsed 617 Two falsehoods are equivalent (deduction rule). (Contributed by NM, 11-Oct-2013.)
(φ → ¬ ψ)    &   (φ → ¬ χ)       (φ → (ψχ))

Theorempm5.21ni 618 Two propositions implying a false one are equivalent. (Contributed by NM, 16-Feb-1996.) (Proof shortened by Wolf Lammen, 19-May-2013.)
(φψ)    &   (χψ)       ψ → (φχ))

Theorempm5.21nii 619 Eliminate an antecedent implied by each side of a biconditional. (Contributed by NM, 21-May-1999.) (Revised by Mario Carneiro, 31-Jan-2015.)
(φψ)    &   (χψ)    &   (ψ → (φχ))       (φχ)

Theorempm5.21ndd 620 Eliminate an antecedent implied by each side of a biconditional, deduction version. (Contributed by Paul Chapman, 21-Nov-2012.) (Revised by Mario Carneiro, 31-Jan-2015.)
(φ → (χψ))    &   (φ → (θψ))    &   (φ → (ψ → (χθ)))       (φ → (χθ))

Theorempm5.19 621 Theorem *5.19 of [WhiteheadRussell] p. 124. (Contributed by NM, 3-Jan-2005.) (Revised by Mario Carneiro, 31-Jan-2015.)
¬ (φ ↔ ¬ φ)

Theorempm4.8 622 Theorem *4.8 of [WhiteheadRussell] p. 122. This one holds for all propositions, but compare with pm4.81dc 813 which requires a decidability condition. (Contributed by NM, 3-Jan-2005.)
((φ → ¬ φ) ↔ ¬ φ)

Theoremimnan 623 Express implication in terms of conjunction. (Contributed by NM, 9-Apr-1994.) (Revised by Mario Carneiro, 1-Feb-2015.)
((φ → ¬ ψ) ↔ ¬ (φ ψ))

Theoremimnani 624 Express implication in terms of conjunction. (Contributed by Mario Carneiro, 28-Sep-2015.)
¬ (φ ψ)       (φ → ¬ ψ)

Theoremnan 625 Theorem to move a conjunct in and out of a negation. (Contributed by NM, 9-Nov-2003.)
((φ → ¬ (ψ χ)) ↔ ((φ ψ) → ¬ χ))

Theorempm3.24 626 Law of noncontradiction. Theorem *3.24 of [WhiteheadRussell] p. 111 (who call it the "law of contradiction"). (Contributed by NM, 16-Sep-1993.) (Revised by Mario Carneiro, 2-Feb-2015.)
¬ (φ ¬ φ)

Theoremnotnotnot 627 Triple negation. (Contributed by Jim Kingdon, 28-Jul-2018.)
(¬ ¬ ¬ φ ↔ ¬ φ)

1.2.6  Logical disjunction

Syntaxwo 628 Extend wff definition to include disjunction ('or').
wff (φ ψ)

Axiomax-io 629 Definition of 'or'. Axiom 6 of 10 for intuitionistic logic. (Contributed by Mario Carneiro, 31-Jan-2015.)
(((φ χ) → ψ) ↔ ((φψ) (χψ)))

Theoremjaob 630 Disjunction of antecedents. Compare Theorem *4.77 of [WhiteheadRussell] p. 121. (Contributed by NM, 30-May-1994.) (Revised by Mario Carneiro, 31-Jan-2015.)
(((φ χ) → ψ) ↔ ((φψ) (χψ)))

Theoremolc 631 Introduction of a disjunct. Axiom *1.3 of [WhiteheadRussell] p. 96. (Contributed by NM, 30-Aug-1993.) (Revised by NM, 31-Jan-2015.)
(φ → (ψ φ))

Theoremorc 632 Introduction of a disjunct. Theorem *2.2 of [WhiteheadRussell] p. 104. (Contributed by NM, 30-Aug-1993.) (Revised by NM, 31-Jan-2015.)
(φ → (φ ψ))

Theorempm2.67-2 633 Slight generalization of Theorem *2.67 of [WhiteheadRussell] p. 107. (Contributed by NM, 3-Jan-2005.) (Revised by NM, 9-Dec-2012.)
(((φ χ) → ψ) → (φψ))

Theorempm3.44 634 Theorem *3.44 of [WhiteheadRussell] p. 113. (Contributed by NM, 3-Jan-2005.) (Proof shortened by Wolf Lammen, 3-Oct-2013.)
(((ψφ) (χφ)) → ((ψ χ) → φ))

Theoremjaoi 635 Inference disjoining the antecedents of two implications. (Contributed by NM, 5-Apr-1994.) (Revised by NM, 31-Jan-2015.)
(φψ)    &   (χψ)       ((φ χ) → ψ)

Theoremjaod 636 Deduction disjoining the antecedents of two implications. (Contributed by NM, 18-Aug-1994.) (Revised by NM, 4-Apr-2013.)
(φ → (ψχ))    &   (φ → (θχ))       (φ → ((ψ θ) → χ))

Theoremmpjaod 637 Eliminate a disjunction in a deduction. (Contributed by Mario Carneiro, 29-May-2016.)
(φ → (ψχ))    &   (φ → (θχ))    &   (φ → (ψ θ))       (φχ)

Theoremjaao 638 Inference conjoining and disjoining the antecedents of two implications. (Contributed by NM, 30-Sep-1999.)
(φ → (ψχ))    &   (θ → (τχ))       ((φ θ) → ((ψ τ) → χ))

Theoremjaoa 639 Inference disjoining and conjoining the antecedents of two implications. (Contributed by Stefan Allan, 1-Nov-2008.)
(φ → (ψχ))    &   (θ → (τχ))       ((φ θ) → ((ψ τ) → χ))

Theorempm2.53 640 Theorem *2.53 of [WhiteheadRussell] p. 107. This holds intuitionistically, although its converse does not (see pm2.54dc 789). (Contributed by NM, 3-Jan-2005.) (Revised by NM, 31-Jan-2015.)
((φ ψ) → (¬ φψ))

Theoremori 641 Infer implication from disjunction. (Contributed by NM, 11-Jun-1994.) (Revised by Mario Carneiro, 31-Jan-2015.)
(φ ψ)       φψ)

Theoremord 642 Deduce implication from disjunction. (Contributed by NM, 18-May-1994.) (Revised by Mario Carneiro, 31-Jan-2015.)
(φ → (ψ χ))       (φ → (¬ ψχ))

Theoremorel1 643 Elimination of disjunction by denial of a disjunct. Theorem *2.55 of [WhiteheadRussell] p. 107. (Contributed by NM, 12-Aug-1994.) (Proof shortened by Wolf Lammen, 21-Jul-2012.)
φ → ((φ ψ) → ψ))

Theoremorel2 644 Elimination of disjunction by denial of a disjunct. Theorem *2.56 of [WhiteheadRussell] p. 107. (Contributed by NM, 12-Aug-1994.) (Proof shortened by Wolf Lammen, 5-Apr-2013.)
φ → ((ψ φ) → ψ))

Theorempm1.4 645 Axiom *1.4 of [WhiteheadRussell] p. 96. (Contributed by NM, 3-Jan-2005.) (Revised by NM, 15-Nov-2012.)
((φ ψ) → (ψ φ))

Theoremorcom 646 Commutative law for disjunction. Theorem *4.31 of [WhiteheadRussell] p. 118. (Contributed by NM, 5-Aug-1993.) (Proof shortened by Wolf Lammen, 15-Nov-2012.)
((φ ψ) ↔ (ψ φ))

Theoremorcomd 647 Commutation of disjuncts in consequent. (Contributed by NM, 2-Dec-2010.)
(φ → (ψ χ))       (φ → (χ ψ))

Theoremorcoms 648 Commutation of disjuncts in antecedent. (Contributed by NM, 2-Dec-2012.)
((φ ψ) → χ)       ((ψ φ) → χ)

Theoremorci 649 Deduction introducing a disjunct. (Contributed by NM, 19-Jan-2008.) (Revised by Mario Carneiro, 31-Jan-2015.)
φ       (φ ψ)

Theoremolci 650 Deduction introducing a disjunct. (Contributed by NM, 19-Jan-2008.) (Revised by Mario Carneiro, 31-Jan-2015.)
φ       (ψ φ)

Theoremorcd 651 Deduction introducing a disjunct. (Contributed by NM, 20-Sep-2007.)
(φψ)       (φ → (ψ χ))

Theoremolcd 652 Deduction introducing a disjunct. (Contributed by NM, 11-Apr-2008.) (Proof shortened by Wolf Lammen, 3-Oct-2013.)
(φψ)       (φ → (χ ψ))

Theoremorcs 653 Deduction eliminating disjunct. Notational convention: We sometimes suffix with "s" the label of an inference that manipulates an antecedent, leaving the consequent unchanged. The "s" means that the inference eliminates the need for a syllogism (syl 14) -type inference in a proof. (Contributed by NM, 21-Jun-1994.)
((φ ψ) → χ)       (φχ)

Theoremolcs 654 Deduction eliminating disjunct. (Contributed by NM, 21-Jun-1994.) (Proof shortened by Wolf Lammen, 3-Oct-2013.)
((φ ψ) → χ)       (ψχ)

Theorempm2.07 655 Theorem *2.07 of [WhiteheadRussell] p. 101. (Contributed by NM, 3-Jan-2005.)
(φ → (φ φ))

Theorempm2.45 656 Theorem *2.45 of [WhiteheadRussell] p. 106. (Contributed by NM, 3-Jan-2005.)
(¬ (φ ψ) → ¬ φ)

Theorempm2.46 657 Theorem *2.46 of [WhiteheadRussell] p. 106. (Contributed by NM, 3-Jan-2005.)
(¬ (φ ψ) → ¬ ψ)

Theorempm2.47 658 Theorem *2.47 of [WhiteheadRussell] p. 107. (Contributed by NM, 3-Jan-2005.)
(¬ (φ ψ) → (¬ φ ψ))

Theorempm2.48 659 Theorem *2.48 of [WhiteheadRussell] p. 107. (Contributed by NM, 3-Jan-2005.)
(¬ (φ ψ) → (φ ¬ ψ))

Theorempm2.49 660 Theorem *2.49 of [WhiteheadRussell] p. 107. (Contributed by NM, 3-Jan-2005.)
(¬ (φ ψ) → (¬ φ ¬ ψ))

Theorempm2.67 661 Theorem *2.67 of [WhiteheadRussell] p. 107. (Contributed by NM, 3-Jan-2005.) (Revised by NM, 9-Dec-2012.)
(((φ ψ) → ψ) → (φψ))

Theorembiorf 662 A wff is equivalent to its disjunction with falsehood. Theorem *4.74 of [WhiteheadRussell] p. 121. (Contributed by NM, 23-Mar-1995.) (Proof shortened by Wolf Lammen, 18-Nov-2012.)
φ → (ψ ↔ (φ ψ)))

Theorembiortn 663 A wff is equivalent to its negated disjunction with falsehood. (Contributed by NM, 9-Jul-2012.)
(φ → (ψ ↔ (¬ φ ψ)))

Theorembiorfi 664 A wff is equivalent to its disjunction with falsehood. (Contributed by NM, 23-Mar-1995.)
¬ φ       (ψ ↔ (ψ φ))

Theorempm2.621 665 Theorem *2.621 of [WhiteheadRussell] p. 107. (Contributed by NM, 3-Jan-2005.) (Revised by NM, 13-Dec-2013.)
((φψ) → ((φ ψ) → ψ))

Theorempm2.62 666 Theorem *2.62 of [WhiteheadRussell] p. 107. (Contributed by NM, 3-Jan-2005.) (Proof shortened by Wolf Lammen, 13-Dec-2013.)
((φ ψ) → ((φψ) → ψ))

Theoremimorri 667 Infer implication from disjunction. (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (Revised by Mario Carneiro, 31-Jan-2015.)
φ ψ)       (φψ)

Theoremioran 668 Negated disjunction in terms of conjunction. This version of DeMorgan's law is a biconditional for all propositions (not just decidable ones), unlike oranim 806, anordc 862, or ianordc 798. Compare Theorem *4.56 of [WhiteheadRussell] p. 120. (Contributed by NM, 5-Aug-1993.) (Revised by Mario Carneiro, 31-Jan-2015.)
(¬ (φ ψ) ↔ (¬ φ ¬ ψ))

Theorempm3.14 669 Theorem *3.14 of [WhiteheadRussell] p. 111. One direction of De Morgan's law). The biconditional holds for decidable propositions as seen at ianordc 798. The converse holds for decidable propositions, as seen at pm3.13dc 865. (Contributed by NM, 3-Jan-2005.) (Revised by Mario Carneiro, 31-Jan-2015.)
((¬ φ ¬ ψ) → ¬ (φ ψ))

Theorempm3.1 670 Theorem *3.1 of [WhiteheadRussell] p. 111. The converse holds for decidable propositions, as seen at anordc 862. (Contributed by NM, 3-Jan-2005.) (Revised by Mario Carneiro, 31-Jan-2015.)
((φ ψ) → ¬ (¬ φ ¬ ψ))

Theoremjao 671 Disjunction of antecedents. Compare Theorem *3.44 of [WhiteheadRussell] p. 113. (Contributed by NM, 5-Apr-1994.) (Proof shortened by Wolf Lammen, 4-Apr-2013.)
((φψ) → ((χψ) → ((φ χ) → ψ)))

Theorempm1.2 672 Axiom *1.2 (Taut) of [WhiteheadRussell] p. 96. (Contributed by NM, 3-Jan-2005.) (Revised by NM, 10-Mar-2013.)
((φ φ) → φ)

Theoremoridm 673 Idempotent law for disjunction. Theorem *4.25 of [WhiteheadRussell] p. 117. (Contributed by NM, 5-Aug-1993.) (Proof shortened by Andrew Salmon, 16-Apr-2011.) (Proof shortened by Wolf Lammen, 10-Mar-2013.)
((φ φ) ↔ φ)

Theorempm4.25 674 Theorem *4.25 of [WhiteheadRussell] p. 117. (Contributed by NM, 3-Jan-2005.)
(φ ↔ (φ φ))

Theoremorim12i 675 Disjoin antecedents and consequents of two premises. (Contributed by NM, 6-Jun-1994.) (Proof shortened by Wolf Lammen, 25-Jul-2012.)
(φψ)    &   (χθ)       ((φ χ) → (ψ θ))

Theoremorim1i 676 Introduce disjunct to both sides of an implication. (Contributed by NM, 6-Jun-1994.)
(φψ)       ((φ χ) → (ψ χ))

Theoremorim2i 677 Introduce disjunct to both sides of an implication. (Contributed by NM, 6-Jun-1994.)
(φψ)       ((χ φ) → (χ ψ))

Theoremorbi2i 678 Inference adding a left disjunct to both sides of a logical equivalence. (Contributed by NM, 5-Aug-1993.) (Proof shortened by Wolf Lammen, 12-Dec-2012.)
(φψ)       ((χ φ) ↔ (χ ψ))

Theoremorbi1i 679 Inference adding a right disjunct to both sides of a logical equivalence. (Contributed by NM, 5-Aug-1993.)
(φψ)       ((φ χ) ↔ (ψ χ))

Theoremorbi12i 680 Infer the disjunction of two equivalences. (Contributed by NM, 5-Aug-1993.)
(φψ)    &   (χθ)       ((φ χ) ↔ (ψ θ))

Theorempm1.5 681 Axiom *1.5 (Assoc) of [WhiteheadRussell] p. 96. (Contributed by NM, 3-Jan-2005.)
((φ (ψ χ)) → (ψ (φ χ)))

Theoremor12 682 Swap two disjuncts. (Contributed by NM, 5-Aug-1993.) (Proof shortened by Wolf Lammen, 14-Nov-2012.)
((φ (ψ χ)) ↔ (ψ (φ χ)))

Theoremorass 683 Associative law for disjunction. Theorem *4.33 of [WhiteheadRussell] p. 118. (Contributed by NM, 5-Aug-1993.) (Proof shortened by Andrew Salmon, 26-Jun-2011.)
(((φ ψ) χ) ↔ (φ (ψ χ)))

Theorempm2.31 684 Theorem *2.31 of [WhiteheadRussell] p. 104. (Contributed by NM, 3-Jan-2005.)
((φ (ψ χ)) → ((φ ψ) χ))

Theorempm2.32 685 Theorem *2.32 of [WhiteheadRussell] p. 105. (Contributed by NM, 3-Jan-2005.)
(((φ ψ) χ) → (φ (ψ χ)))

Theoremor32 686 A rearrangement of disjuncts. (Contributed by NM, 18-Oct-1995.) (Proof shortened by Andrew Salmon, 26-Jun-2011.)
(((φ ψ) χ) ↔ ((φ χ) ψ))

Theoremor4 687 Rearrangement of 4 disjuncts. (Contributed by NM, 12-Aug-1994.)
(((φ ψ) (χ θ)) ↔ ((φ χ) (ψ θ)))

Theoremor42 688 Rearrangement of 4 disjuncts. (Contributed by NM, 10-Jan-2005.)
(((φ ψ) (χ θ)) ↔ ((φ χ) (θ ψ)))

Theoremorordi 689 Distribution of disjunction over disjunction. (Contributed by NM, 25-Feb-1995.)
((φ (ψ χ)) ↔ ((φ ψ) (φ χ)))

Theoremorordir 690 Distribution of disjunction over disjunction. (Contributed by NM, 25-Feb-1995.)
(((φ ψ) χ) ↔ ((φ χ) (ψ χ)))

Theorempm2.3 691 Theorem *2.3 of [WhiteheadRussell] p. 104. (Contributed by NM, 3-Jan-2005.)
((φ (ψ χ)) → (φ (χ ψ)))

Theorempm2.41 692 Theorem *2.41 of [WhiteheadRussell] p. 106. (Contributed by NM, 3-Jan-2005.)
((ψ (φ ψ)) → (φ ψ))

Theorempm2.42 693 Theorem *2.42 of [WhiteheadRussell] p. 106. (Contributed by NM, 3-Jan-2005.)
((¬ φ (φψ)) → (φψ))

Theorempm2.4 694 Theorem *2.4 of [WhiteheadRussell] p. 106. (Contributed by NM, 3-Jan-2005.)
((φ (φ ψ)) → (φ ψ))

Theorempm4.44 695 Theorem *4.44 of [WhiteheadRussell] p. 119. (Contributed by NM, 3-Jan-2005.)
(φ ↔ (φ (φ ψ)))

Theoremmtord 696 A modus tollens deduction involving disjunction. (Contributed by Jeff Hankins, 15-Jul-2009.) (Revised by Mario Carneiro, 31-Jan-2015.)
(φ → ¬ χ)    &   (φ → ¬ θ)    &   (φ → (ψ → (χ θ)))       (φ → ¬ ψ)

Theorempm4.45 697 Theorem *4.45 of [WhiteheadRussell] p. 119. (Contributed by NM, 3-Jan-2005.)
(φ ↔ (φ (φ ψ)))

Theorempm3.48 698 Theorem *3.48 of [WhiteheadRussell] p. 114. (Contributed by NM, 28-Jan-1997.) (Revised by NM, 1-Dec-2012.)
(((φψ) (χθ)) → ((φ χ) → (ψ θ)))

Theoremorim12d 699 Disjoin antecedents and consequents in a deduction. (Contributed by NM, 10-May-1994.)
(φ → (ψχ))    &   (φ → (θτ))       (φ → ((ψ θ) → (χ τ)))

Theoremorim1d 700 Disjoin antecedents and consequents in a deduction. (Contributed by NM, 23-Apr-1995.)
(φ → (ψχ))       (φ → ((ψ θ) → (χ θ)))

Page List
Jump to page: Contents  1 1-100 2 101-200 3 201-300 4 301-400 5 401-500 6 501-600601-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-9457
 Copyright terms: Public domain < Previous  Next >