Home Intuitionistic Logic ExplorerTheorem List (p. 25 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 - 2401-2500   *Has distinct variable group(s)
TypeLabelDescription
Statement

Theoremr19.21bi 2401 Inference from Theorem 19.21 of [Margaris] p. 90. (Restricted quantifier version.) (Contributed by NM, 20-Nov-1994.)
(φx A ψ)       ((φ x A) → ψ)

Theoremrspec2 2402 Specialization rule for restricted quantification. (Contributed by NM, 20-Nov-1994.)
x A y B φ       ((x A y B) → φ)

Theoremrspec3 2403 Specialization rule for restricted quantification. (Contributed by NM, 20-Nov-1994.)
x A y B z 𝐶 φ       ((x A y B z 𝐶) → φ)

Theoremr19.21be 2404 Inference from Theorem 19.21 of [Margaris] p. 90. (Restricted quantifier version.) (Contributed by NM, 21-Nov-1994.)
(φx A ψ)       x A (φψ)

Theoremnrex 2405 Inference adding restricted existential quantifier to negated wff. (Contributed by NM, 16-Oct-2003.)
(x A → ¬ ψ)        ¬ x A ψ

Theoremnrexdv 2406* Deduction adding restricted existential quantifier to negated wff. (Contributed by NM, 16-Oct-2003.)
((φ x A) → ¬ ψ)       (φ → ¬ x A ψ)

Theoremrexim 2407 Theorem 19.22 of [Margaris] p. 90. (Restricted quantifier version.) (Contributed by NM, 22-Nov-1994.) (Proof shortened by Andrew Salmon, 30-May-2011.)
(x A (φψ) → (x A φx A ψ))

Theoremreximia 2408 Inference quantifying both antecedent and consequent. (Contributed by NM, 10-Feb-1997.)
(x A → (φψ))       (x A φx A ψ)

Theoremreximi2 2409 Inference quantifying both antecedent and consequent, based on Theorem 19.22 of [Margaris] p. 90. (Contributed by NM, 8-Nov-2004.)
((x A φ) → (x B ψ))       (x A φx B ψ)

Theoremreximi 2410 Inference quantifying both antecedent and consequent. (Contributed by NM, 18-Oct-1996.)
(φψ)       (x A φx A ψ)

Theoremreximdai 2411 Deduction from Theorem 19.22 of [Margaris] p. 90. (Restricted quantifier version.) (Contributed by NM, 31-Aug-1999.)
xφ    &   (φ → (x A → (ψχ)))       (φ → (x A ψx A χ))

Theoremreximdv2 2412* Deduction quantifying both antecedent and consequent, based on Theorem 19.22 of [Margaris] p. 90. (Contributed by NM, 17-Sep-2003.)
(φ → ((x A ψ) → (x B χ)))       (φ → (x A ψx B χ))

Theoremreximdvai 2413* Deduction quantifying both antecedent and consequent, based on Theorem 19.22 of [Margaris] p. 90. (Contributed by NM, 14-Nov-2002.)
(φ → (x A → (ψχ)))       (φ → (x A ψx A χ))

Theoremreximdv 2414* Deduction from Theorem 19.22 of [Margaris] p. 90. (Restricted quantifier version with strong hypothesis.) (Contributed by NM, 24-Jun-1998.)
(φ → (ψχ))       (φ → (x A ψx A χ))

Theoremreximdva 2415* Deduction quantifying both antecedent and consequent, based on Theorem 19.22 of [Margaris] p. 90. (Contributed by NM, 22-May-1999.)
((φ x A) → (ψχ))       (φ → (x A ψx A χ))

Theoremr19.12 2416* Theorem 19.12 of [Margaris] p. 89 with restricted quantifiers. (Contributed by NM, 15-Oct-2003.) (Proof shortened by Andrew Salmon, 30-May-2011.)
(x A y B φy B x A φ)

Theoremr19.23t 2417 Closed theorem form of r19.23 2418. (Contributed by NM, 4-Mar-2013.) (Revised by Mario Carneiro, 8-Oct-2016.)
(Ⅎxψ → (x A (φψ) ↔ (x A φψ)))

Theoremr19.23 2418 Theorem 19.23 of [Margaris] p. 90 with restricted quantifiers. (Contributed by NM, 22-Oct-2010.) (Proof shortened by Mario Carneiro, 8-Oct-2016.)
xψ       (x A (φψ) ↔ (x A φψ))

Theoremr19.23v 2419* Theorem 19.23 of [Margaris] p. 90 with restricted quantifiers. (Contributed by NM, 31-Aug-1999.)
(x A (φψ) ↔ (x A φψ))

Theoremrexlimi 2420 Inference from Theorem 19.21 of [Margaris] p. 90. (Restricted quantifier version.) (Contributed by NM, 30-Nov-2003.) (Proof shortened by Andrew Salmon, 30-May-2011.)
xψ    &   (x A → (φψ))       (x A φψ)

Theoremrexlimiv 2421* Inference from Theorem 19.23 of [Margaris] p. 90. (Restricted quantifier version.) (Contributed by NM, 20-Nov-1994.)
(x A → (φψ))       (x A φψ)

Theoremrexlimiva 2422* Inference from Theorem 19.23 of [Margaris] p. 90 (restricted quantifier version). (Contributed by NM, 18-Dec-2006.)
((x A φ) → ψ)       (x A φψ)

Theoremrexlimivw 2423* Weaker version of rexlimiv 2421. (Contributed by FL, 19-Sep-2011.)
(φψ)       (x A φψ)

Theoremrexlimd 2424 Deduction from Theorem 19.23 of [Margaris] p. 90 (restricted quantifier version). (Contributed by NM, 27-May-1998.) (Proof shortened by Andrew Salmon, 30-May-2011.)
xφ    &   xχ    &   (φ → (x A → (ψχ)))       (φ → (x A ψχ))

Theoremrexlimd2 2425 Version of rexlimd 2424 with deduction version of second hypothesis. (Contributed by NM, 21-Jul-2013.) (Revised by Mario Carneiro, 8-Oct-2016.)
xφ    &   (φ → Ⅎxχ)    &   (φ → (x A → (ψχ)))       (φ → (x A ψχ))

Theoremrexlimdv 2426* Inference from Theorem 19.23 of [Margaris] p. 90 (restricted quantifier version). (Contributed by NM, 14-Nov-2002.) (Proof shortened by Eric Schmidt, 22-Dec-2006.)
(φ → (x A → (ψχ)))       (φ → (x A ψχ))

Theoremrexlimdva 2427* Inference from Theorem 19.23 of [Margaris] p. 90 (restricted quantifier version). (Contributed by NM, 20-Jan-2007.)
((φ x A) → (ψχ))       (φ → (x A ψχ))

Theoremrexlimdvaa 2428* Inference from Theorem 19.23 of [Margaris] p. 90 (restricted quantifier version). (Contributed by Mario Carneiro, 15-Jun-2016.)
((φ (x A ψ)) → χ)       (φ → (x A ψχ))

Theoremrexlimdv3a 2429* Inference from Theorem 19.23 of [Margaris] p. 90 (restricted quantifier version). Frequently-used variant of rexlimdv 2426. (Contributed by NM, 7-Jun-2015.)
((φ x A ψ) → χ)       (φ → (x A ψχ))

Theoremrexlimdvw 2430* Inference from Theorem 19.23 of [Margaris] p. 90 (restricted quantifier version). (Contributed by NM, 18-Jun-2014.)
(φ → (ψχ))       (φ → (x A ψχ))

Theoremrexlimddv 2431* Restricted existential elimination rule of natural deduction. (Contributed by Mario Carneiro, 15-Jun-2016.)
(φx A ψ)    &   ((φ (x A ψ)) → χ)       (φχ)

Theoremrexlimivv 2432* Inference from Theorem 19.23 of [Margaris] p. 90 (restricted quantifier version). (Contributed by NM, 17-Feb-2004.)
((x A y B) → (φψ))       (x A y B φψ)

Theoremrexlimdvv 2433* Inference from Theorem 19.23 of [Margaris] p. 90. (Restricted quantifier version.) (Contributed by NM, 22-Jul-2004.)
(φ → ((x A y B) → (ψχ)))       (φ → (x A y B ψχ))

Theoremrexlimdvva 2434* Inference from Theorem 19.23 of [Margaris] p. 90. (Restricted quantifier version.) (Contributed by NM, 18-Jun-2014.)
((φ (x A y B)) → (ψχ))       (φ → (x A y B ψχ))

Theoremr19.26 2435 Theorem 19.26 of [Margaris] p. 90 with restricted quantifiers. (Contributed by NM, 28-Jan-1997.) (Proof shortened by Andrew Salmon, 30-May-2011.)
(x A (φ ψ) ↔ (x A φ x A ψ))

Theoremr19.26-2 2436 Theorem 19.26 of [Margaris] p. 90 with 2 restricted quantifiers. (Contributed by NM, 10-Aug-2004.)
(x A y B (φ ψ) ↔ (x A y B φ x A y B ψ))

Theoremr19.26-3 2437 Theorem 19.26 of [Margaris] p. 90 with 3 restricted quantifiers. (Contributed by FL, 22-Nov-2010.)
(x A (φ ψ χ) ↔ (x A φ x A ψ x A χ))

Theoremr19.26m 2438 Theorem 19.26 of [Margaris] p. 90 with mixed quantifiers. (Contributed by NM, 22-Feb-2004.)
(x((x Aφ) (x Bψ)) ↔ (x A φ x B ψ))

Theoremralbi 2439 Distribute a restricted universal quantifier over a biconditional. Theorem 19.15 of [Margaris] p. 90 with restricted quantification. (Contributed by NM, 6-Oct-2003.)
(x A (φψ) → (x A φx A ψ))

Theoremrexbi 2440 Distribute a restricted existential quantifier over a biconditional. Theorem 19.18 of [Margaris] p. 90 with restricted quantification. (Contributed by Jim Kingdon, 21-Jan-2019.)
(x A (φψ) → (x A φx A ψ))

Theoremralbiim 2441 Split a biconditional and distribute quantifier. (Contributed by NM, 3-Jun-2012.)
(x A (φψ) ↔ (x A (φψ) x A (ψφ)))

Theoremr19.27av 2442* Restricted version of one direction of Theorem 19.27 of [Margaris] p. 90. (The other direction doesn't hold when A is empty.) (Contributed by NM, 3-Jun-2004.) (Proof shortened by Andrew Salmon, 30-May-2011.)
((x A φ ψ) → x A (φ ψ))

Theoremr19.28av 2443* Restricted version of one direction of Theorem 19.28 of [Margaris] p. 90. (The other direction doesn't hold when A is empty.) (Contributed by NM, 2-Apr-2004.)
((φ x A ψ) → x A (φ ψ))

Theoremr19.29 2444 Theorem 19.29 of [Margaris] p. 90 with restricted quantifiers. (Contributed by NM, 31-Aug-1999.) (Proof shortened by Andrew Salmon, 30-May-2011.)
((x A φ x A ψ) → x A (φ ψ))

Theoremr19.29r 2445 Variation of Theorem 19.29 of [Margaris] p. 90 with restricted quantifiers. (Contributed by NM, 31-Aug-1999.)
((x A φ x A ψ) → x A (φ ψ))

Theoremr19.29af2 2446 A commonly used pattern based on r19.29 2444 (Contributed by Thierry Arnoux, 17-Dec-2017.)
xφ    &   xχ    &   (((φ x A) ψ) → χ)    &   (φx A ψ)       (φχ)

Theoremr19.29af 2447* A commonly used pattern based on r19.29 2444 (Contributed by Thierry Arnoux, 29-Nov-2017.)
xφ    &   (((φ x A) ψ) → χ)    &   (φx A ψ)       (φχ)

Theoremr19.29a 2448* A commonly used pattern based on r19.29 2444 (Contributed by Thierry Arnoux, 22-Nov-2017.)
(((φ x A) ψ) → χ)    &   (φx A ψ)       (φχ)

Theoremr19.29d2r 2449 Theorem 19.29 of [Margaris] p. 90 with two restricted quantifiers, deduction version (Contributed by Thierry Arnoux, 30-Jan-2017.)
(φx A y B ψ)    &   (φx A y B χ)       (φx A y B (ψ χ))

Theoremr19.29vva 2450* A commonly used pattern based on r19.29 2444, version with two restricted quantifiers. (Contributed by Thierry Arnoux, 26-Nov-2017.)
((((φ x A) y B) ψ) → χ)    &   (φx A y B ψ)       (φχ)

Theoremr19.32r 2451 One direction of Theorem 19.32 of [Margaris] p. 90 with restricted quantifiers. For decidable propositions this is an equivalence. (Contributed by Jim Kingdon, 19-Aug-2018.)
xφ       ((φ x A ψ) → x A (φ ψ))

Theoremr19.32vr 2452* One direction of Theorem 19.32 of [Margaris] p. 90 with restricted quantifiers. For decidable propositions this is an equivalence, as seen at r19.32vdc 2453. (Contributed by Jim Kingdon, 19-Aug-2018.)
((φ x A ψ) → x A (φ ψ))

Theoremr19.32vdc 2453* Theorem 19.32 of [Margaris] p. 90 with restricted quantifiers, where φ is decidable. (Contributed by Jim Kingdon, 4-Jun-2018.)
(DECID φ → (x A (φ ψ) ↔ (φ x A ψ)))

Theoremr19.35-1 2454 Restricted quantifier version of 19.35-1 1512. (Contributed by Jim Kingdon, 4-Jun-2018.)
(x A (φψ) → (x A φx A ψ))

Theoremr19.36av 2455* One direction of a restricted quantifier version of Theorem 19.36 of [Margaris] p. 90. In classical logic, the converse would hold if A has at least one element, but in intuitionistic logic, that is not a sufficient condition. (Contributed by NM, 22-Oct-2003.)
(x A (φψ) → (x A φψ))

Theoremr19.37 2456 Restricted version of one direction of Theorem 19.37 of [Margaris] p. 90. In classical logic the converse would hold if A has at least one element, but that is not sufficient in intuitionistic logic. (Contributed by FL, 13-May-2012.) (Revised by Mario Carneiro, 11-Dec-2016.)
xφ       (x A (φψ) → (φx A ψ))

Theoremr19.37av 2457* Restricted version of one direction of Theorem 19.37 of [Margaris] p. 90. (Contributed by NM, 2-Apr-2004.)
(x A (φψ) → (φx A ψ))

Theoremr19.40 2458 Restricted quantifier version of Theorem 19.40 of [Margaris] p. 90. (Contributed by NM, 2-Apr-2004.)
(x A (φ ψ) → (x A φ x A ψ))

Theoremr19.41 2459 Restricted quantifier version of Theorem 19.41 of [Margaris] p. 90. (Contributed by NM, 1-Nov-2010.)
xψ       (x A (φ ψ) ↔ (x A φ ψ))

Theoremr19.41v 2460* Restricted quantifier version of Theorem 19.41 of [Margaris] p. 90. (Contributed by NM, 17-Dec-2003.)
(x A (φ ψ) ↔ (x A φ ψ))

Theoremr19.42v 2461* Restricted version of Theorem 19.42 of [Margaris] p. 90. (Contributed by NM, 27-May-1998.)
(x A (φ ψ) ↔ (φ x A ψ))

Theoremr19.43 2462 Restricted version of Theorem 19.43 of [Margaris] p. 90. (Contributed by NM, 27-May-1998.) (Proof rewritten by Jim Kingdon, 5-Jun-2018.)
(x A (φ ψ) ↔ (x A φ x A ψ))

Theoremr19.44av 2463* One direction of a restricted quantifier version of Theorem 19.44 of [Margaris] p. 90. The other direction doesn't hold when A is empty. (Contributed by NM, 2-Apr-2004.)
(x A (φ ψ) → (x A φ ψ))

Theoremr19.45av 2464* Restricted version of one direction of Theorem 19.45 of [Margaris] p. 90. (The other direction doesn't hold when A is empty.) (Contributed by NM, 2-Apr-2004.)
(x A (φ ψ) → (φ x A ψ))

Theoremralcomf 2465* Commutation of restricted quantifiers. (Contributed by Mario Carneiro, 14-Oct-2016.)
yA    &   xB       (x A y B φy B x A φ)

Theoremrexcomf 2466* Commutation of restricted quantifiers. (Contributed by Mario Carneiro, 14-Oct-2016.)
yA    &   xB       (x A y B φy B x A φ)

Theoremralcom 2467* Commutation of restricted quantifiers. (Contributed by NM, 13-Oct-1999.) (Revised by Mario Carneiro, 14-Oct-2016.)
(x A y B φy B x A φ)

Theoremrexcom 2468* Commutation of restricted quantifiers. (Contributed by NM, 19-Nov-1995.) (Revised by Mario Carneiro, 14-Oct-2016.)
(x A y B φy B x A φ)

Theoremrexcom13 2469* Swap 1st and 3rd restricted existential quantifiers. (Contributed by NM, 8-Apr-2015.)
(x A y B z 𝐶 φz 𝐶 y B x A φ)

Theoremrexrot4 2470* Rotate existential restricted quantifiers twice. (Contributed by NM, 8-Apr-2015.)
(x A y B z 𝐶 w 𝐷 φz 𝐶 w 𝐷 x A y B φ)

Theoremralcom3 2471 A commutative law for restricted quantifiers that swaps the domain of the restriction. (Contributed by NM, 22-Feb-2004.)
(x A (x Bφ) ↔ x B (x Aφ))

Theoremreean 2472* Rearrange existential quantifiers. (Contributed by NM, 27-Oct-2010.) (Proof shortened by Andrew Salmon, 30-May-2011.)
yφ    &   xψ       (x A y B (φ ψ) ↔ (x A φ y B ψ))

Theoremreeanv 2473* Rearrange existential quantifiers. (Contributed by NM, 9-May-1999.)
(x A y B (φ ψ) ↔ (x A φ y B ψ))

Theorem3reeanv 2474* Rearrange three existential quantifiers. (Contributed by Jeff Madsen, 11-Jun-2010.)
(x A y B z 𝐶 (φ ψ χ) ↔ (x A φ y B ψ z 𝐶 χ))

Theoremnfreu1 2475 x is not free in ∃!x Aφ. (Contributed by NM, 19-Mar-1997.)
x∃!x A φ

Theoremnfrmo1 2476 x is not free in ∃*x Aφ. (Contributed by NM, 16-Jun-2017.)
x∃*x A φ

Theoremnfreudxy 2477* Not-free deduction for restricted uniqueness. This is a version where x and y are distinct. (Contributed by Jim Kingdon, 6-Jun-2018.)
yφ    &   (φxA)    &   (φ → Ⅎxψ)       (φ → Ⅎx∃!y A ψ)

Theoremnfreuxy 2478* Not-free for restricted uniqueness. This is a version where x and y are distinct. (Contributed by Jim Kingdon, 6-Jun-2018.)
xA    &   xφ       x∃!y A φ

Theoremrabid 2479 An "identity" law of concretion for restricted abstraction. Special case of Definition 2.1 of [Quine] p. 16. (Contributed by NM, 9-Oct-2003.)
(x {x Aφ} ↔ (x A φ))

Theoremrabid2 2480* An "identity" law for restricted class abstraction. (Contributed by NM, 9-Oct-2003.) (Proof shortened by Andrew Salmon, 30-May-2011.)
(A = {x Aφ} ↔ x A φ)

Theoremrabbi 2481 Equivalent wff's correspond to equal restricted class abstractions. Closed theorem form of rabbidva 2542. (Contributed by NM, 25-Nov-2013.)
(x A (ψχ) ↔ {x Aψ} = {x Aχ})

Theoremrabswap 2482 Swap with a membership relation in a restricted class abstraction. (Contributed by NM, 4-Jul-2005.)
{x Ax B} = {x Bx A}

Theoremnfrab1 2483 The abstraction variable in a restricted class abstraction isn't free. (Contributed by NM, 19-Mar-1997.)
x{x Aφ}

Theoremnfrabxy 2484* A variable not free in a wff remains so in a restricted class abstraction. (Contributed by Jim Kingdon, 19-Jul-2018.)
xφ    &   xA       x{y Aφ}

Theoremreubida 2485 Formula-building rule for restricted existential quantifier (deduction rule). (Contributed by Mario Carneiro, 19-Nov-2016.)
xφ    &   ((φ x A) → (ψχ))       (φ → (∃!x A ψ∃!x A χ))

Theoremreubidva 2486* Formula-building rule for restricted existential quantifier (deduction rule). (Contributed by NM, 13-Nov-2004.)
((φ x A) → (ψχ))       (φ → (∃!x A ψ∃!x A χ))

Theoremreubidv 2487* Formula-building rule for restricted existential quantifier (deduction rule). (Contributed by NM, 17-Oct-1996.)
(φ → (ψχ))       (φ → (∃!x A ψ∃!x A χ))

Theoremreubiia 2488 Formula-building rule for restricted existential quantifier (inference rule). (Contributed by NM, 14-Nov-2004.)
(x A → (φψ))       (∃!x A φ∃!x A ψ)

Theoremreubii 2489 Formula-building rule for restricted existential quantifier (inference rule). (Contributed by NM, 22-Oct-1999.)
(φψ)       (∃!x A φ∃!x A ψ)

Theoremrmobida 2490 Formula-building rule for restricted existential quantifier (deduction rule). (Contributed by NM, 16-Jun-2017.)
xφ    &   ((φ x A) → (ψχ))       (φ → (∃*x A ψ∃*x A χ))

Theoremrmobidva 2491* Formula-building rule for restricted existential quantifier (deduction rule). (Contributed by NM, 16-Jun-2017.)
((φ x A) → (ψχ))       (φ → (∃*x A ψ∃*x A χ))

Theoremrmobidv 2492* Formula-building rule for restricted existential quantifier (deduction rule). (Contributed by NM, 16-Jun-2017.)
(φ → (ψχ))       (φ → (∃*x A ψ∃*x A χ))

Theoremrmobiia 2493 Formula-building rule for restricted existential quantifier (inference rule). (Contributed by NM, 16-Jun-2017.)
(x A → (φψ))       (∃*x A φ∃*x A ψ)

Theoremrmobii 2494 Formula-building rule for restricted existential quantifier (inference rule). (Contributed by NM, 16-Jun-2017.)
(φψ)       (∃*x A φ∃*x A ψ)

Theoremraleqf 2495 Equality theorem for restricted universal quantifier, with bound-variable hypotheses instead of distinct variable restrictions. (Contributed by NM, 7-Mar-2004.) (Revised by Andrew Salmon, 11-Jul-2011.)
xA    &   xB       (A = B → (x A φx B φ))

Theoremrexeqf 2496 Equality theorem for restricted existential quantifier, with bound-variable hypotheses instead of distinct variable restrictions. (Contributed by NM, 9-Oct-2003.) (Revised by Andrew Salmon, 11-Jul-2011.)
xA    &   xB       (A = B → (x A φx B φ))

Theoremreueq1f 2497 Equality theorem for restricted uniqueness quantifier, with bound-variable hypotheses instead of distinct variable restrictions. (Contributed by NM, 5-Apr-2004.) (Revised by Andrew Salmon, 11-Jul-2011.)
xA    &   xB       (A = B → (∃!x A φ∃!x B φ))

Theoremrmoeq1f 2498 Equality theorem for restricted uniqueness quantifier, with bound-variable hypotheses instead of distinct variable restrictions. (Contributed by Alexander van der Vekens, 17-Jun-2017.)
xA    &   xB       (A = B → (∃*x A φ∃*x B φ))

Theoremraleq 2499* Equality theorem for restricted universal quantifier. (Contributed by NM, 16-Nov-1995.)
(A = B → (x A φx B φ))

Theoremrexeq 2500* Equality theorem for restricted existential quantifier. (Contributed by NM, 29-Oct-1995.)
(A = B → (x A φx B φ))

Page List
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-9447
 Copyright terms: Public domain < Previous  Next >