BT011F · Bertrand theorem

prime_five

Alpha v34 checked-use theorem · independently kernel and Lean verified; not Stable

A native checked trial-division certificate for 5.

Current library: Alpha v34, 4,223 checked-use theorems; Stable remains 432. Historical first admissions, original proof editions, and non-admitted aliases are preserved. Exact original first-admission records.

Statement with defined notation

Prime(5)

Every purple notation token opens its conservative definition. Expanding the displayed statement recovers the exact first-order Peano-arithmetic formula checked by the unchanged kernel.

Definitions used by this theorem

In the theorem statement

1 occurrences

In local proof propositions

10 occurrences

Exact expanded native-PA statement
(~(5 = 1) /\ forall bpr_left_bb8cert_prime_five bpr_right_bb8cert_prime_five. 5 = bpr_left_bb8cert_prime_five * bpr_right_bb8cert_prime_five -> bpr_left_bb8cert_prime_five = 1 \/ bpr_right_bb8cert_prime_five = 1)

Proof neighborhood

Direct theorem prerequisites

Direct theorem dependents

Definition-aware tactic body

Only local propositions introduced by have or suffices are compacted. Every changed line has an exact-AST conservative-expansion receipt; the kernel still receives the immutable original tactic script.

Read the argument

Proof checkpoints

120 script commands · 69 reading checkpoints · 13 local claims

This is a reading aid, not a new proof or a proof-tree certificate. Checkpoint groups are consecutive commands, not inferred branch boundaries. Every step links to the preserved script.

Definition notation is shown below. Open the paired exact edition for the original native formulas. Source pairing is not a new equivalence certificate.

Named ingredients (5)
01Establish hn0L1–4

Establish this local claim before using it. It is not an additional assumption. The following proof commands apply PA1.

  1. L1
    have hn0 : ~(5 = 0)
  2. L2
    intro hzero
  3. L3
    apply PA1
  4. L4
    exact hzero
02Establish hn1L5–9

Establish this local claim before using it. It is not an additional assumption. The following proof commands apply PA1.

  1. L5
    have hn1 : ~(5 = 1)
  2. L6
    intro hone
  3. L7
    apply PA1
  4. L8
    apply PA2
  5. L9
    exact hone
03Establish hsquareL10–10

Establish this local claim before using it. It is not an additional assumption.

  1. L10
    have hsquare : Lt(5,3 · 3)Definitions: Lt(5,3 · 3)Original native command in the exact edition
04Construct an explicit witnessL11–11

Supply the displayed value, then prove that it has the required property.

  1. L11
    exists 3
05Calculate and transport equalitiesL12–12

Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.

  1. L12
    norm_num
06Use earlier factsL13–18

Instantiate or apply named facts and discharge the corresponding proof obligations.

  1. L13
    specialize prime_of_no_small_prime_divisor_below_square 2
  2. L14
    specialize prime_of_no_small_prime_divisor_below_square (5)
  3. L15
    apply prime_of_no_small_prime_divisor_below_square
  4. L16
    exact hn0
  5. L17
    exact hn1
  6. L18
    exact hsquare
07Fix variables and assumptionsL19–22

Work with arbitrary variables or the premises of the current implication.

  1. L19
    intro p
  2. L20
    intro hp
  3. L21
    intro hp_bound
  4. L22
    intro hdivides
08Establish hbound_22L23–23

Establish this local claim before using it. It is not an additional assumption.

  1. L23
    have hbound_22 : Lt(1,22)Definitions: Lt(1,22)Original native command in the exact edition
09Construct an explicit witnessL24–24

Supply the displayed value, then prove that it has the required property.

  1. L24
    exists 20
10Calculate and transport equalitiesL25–25

Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.

  1. L25
    norm_num
11Establish hp_22L26–32

Establish this local claim before using it. It is not an additional assumption. The following proof commands apply le trans.

  1. L26
  2. L27
    specialize le_trans p
  3. L28
    specialize le_trans 2
  4. L29
    specialize le_trans 22
  5. L30
    apply le_trans
  6. L31
    exact hp_bound
  7. L32
    exact hbound_22
12Establish hcasesL33–37

Establish this local claim before using it. It is not an additional assumption. The following proof commands apply prime le twenty two cases.

  1. L33
    have hcases : p = 2 \/ (p = 3 \/ (p = 5 \/ (p = 7 \/ (p = 11 \/ (p = 13 \/ (p = 17 \/ (p = 19)))))))
  2. L34
    specialize prime_le_twenty_two_cases p
  3. L35
    apply prime_le_twenty_two_cases
  4. L36
    exact hp
  5. L37
    exact hp_22
13Separate the logical casesL38–38

Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.

  1. L38
    cases hcases
14Calculate and transport equalitiesL39–39

Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.

  1. L39
    rewrite hcases_left at hdivides
15Use earlier factsL40–44

Instantiate or apply named facts and discharge the corresponding proof obligations.

  1. L40
    specialize nonzero_remainder_not_multiple 2
  2. L41
    specialize nonzero_remainder_not_multiple (5)
  3. L42
    specialize nonzero_remainder_not_multiple 2
  4. L43
    specialize nonzero_remainder_not_multiple 1
  5. L44
    apply nonzero_remainder_not_multiple
16Calculate and transport equalitiesL45–45

Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.

  1. L45
    norm_num
17Fix variables and assumptionsL46–46

Work with arbitrary variables or the premises of the current implication.

  1. L46
    intro hrem_2_zero
18Use earlier factsL47–48

Instantiate or apply named facts and discharge the corresponding proof obligations.

  1. L47
    apply PA1
  2. L48
    exact hrem_2_zero
19Construct an explicit witnessL49–49

Supply the displayed value, then prove that it has the required property.

  1. L49
    exists 0
20Calculate and transport equalitiesL50–50

Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.

  1. L50
    norm_num
21Use earlier factsL51–51

Instantiate or apply named facts and discharge the corresponding proof obligations.

  1. L51
    exact hdivides
22Separate the logical casesL52–52

Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.

  1. L52
    cases hcases_right
23Establish htoo_large_3L53–53

Establish this local claim before using it. It is not an additional assumption.

  1. L53
    have htoo_large_3 : Lt(2,3)Definitions: Lt(2,3)Original native command in the exact edition
24Construct an explicit witnessL54–54

Supply the displayed value, then prove that it has the required property.

  1. L54
    exists 0
25Calculate and transport equalitiesL55–55

Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.

  1. L55
    norm_num
26Use earlier factsL56–59

Instantiate or apply named facts and discharge the corresponding proof obligations.

  1. L56
    specialize lt_not_le 2
  2. L57
    specialize lt_not_le 3
  3. L58
    apply lt_not_le
  4. L59
    exact htoo_large_3
27Calculate and transport equalitiesL60–60

Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.

  1. L60
    rewrite hcases_right_left at hp_bound
28Use earlier factsL61–61

Instantiate or apply named facts and discharge the corresponding proof obligations.

  1. L61
    exact hp_bound
29Separate the logical casesL62–62

Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.

  1. L62
    cases hcases_right_right
30Establish htoo_large_5L63–63

Establish this local claim before using it. It is not an additional assumption.

  1. L63
    have htoo_large_5 : Lt(2,5)Definitions: Lt(2,5)Original native command in the exact edition
31Construct an explicit witnessL64–64

Supply the displayed value, then prove that it has the required property.

  1. L64
    exists 2
32Calculate and transport equalitiesL65–65

Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.

  1. L65
    norm_num
33Use earlier factsL66–69

Instantiate or apply named facts and discharge the corresponding proof obligations.

  1. L66
    specialize lt_not_le 2
  2. L67
    specialize lt_not_le 5
  3. L68
    apply lt_not_le
  4. L69
    exact htoo_large_5
34Calculate and transport equalitiesL70–70

Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.

  1. L70
    rewrite hcases_right_right_left at hp_bound
35Use earlier factsL71–71

Instantiate or apply named facts and discharge the corresponding proof obligations.

  1. L71
    exact hp_bound
36Separate the logical casesL72–72

Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.

  1. L72
    cases hcases_right_right_right
37Establish htoo_large_7L73–73

Establish this local claim before using it. It is not an additional assumption.

  1. L73
    have htoo_large_7 : Lt(2,7)Definitions: Lt(2,7)Original native command in the exact edition
38Construct an explicit witnessL74–74

Supply the displayed value, then prove that it has the required property.

  1. L74
    exists 4
39Calculate and transport equalitiesL75–75

Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.

  1. L75
    norm_num
40Use earlier factsL76–79

Instantiate or apply named facts and discharge the corresponding proof obligations.

  1. L76
    specialize lt_not_le 2
  2. L77
    specialize lt_not_le 7
  3. L78
    apply lt_not_le
  4. L79
    exact htoo_large_7
41Calculate and transport equalitiesL80–80

Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.

  1. L80
    rewrite hcases_right_right_right_left at hp_bound
42Use earlier factsL81–81

Instantiate or apply named facts and discharge the corresponding proof obligations.

  1. L81
    exact hp_bound
43Separate the logical casesL82–82

Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.

  1. L82
    cases hcases_right_right_right_right
44Establish htoo_large_11L83–83

Establish this local claim before using it. It is not an additional assumption.

  1. L83
    have htoo_large_11 : Lt(2,11)Definitions: Lt(2,11)Original native command in the exact edition
45Construct an explicit witnessL84–84

Supply the displayed value, then prove that it has the required property.

  1. L84
    exists 8
46Calculate and transport equalitiesL85–85

Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.

  1. L85
    norm_num
47Use earlier factsL86–89

Instantiate or apply named facts and discharge the corresponding proof obligations.

  1. L86
    specialize lt_not_le 2
  2. L87
    specialize lt_not_le 11
  3. L88
    apply lt_not_le
  4. L89
    exact htoo_large_11
48Calculate and transport equalitiesL90–90

Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.

  1. L90
    rewrite hcases_right_right_right_right_left at hp_bound
49Use earlier factsL91–91

Instantiate or apply named facts and discharge the corresponding proof obligations.

  1. L91
    exact hp_bound
50Separate the logical casesL92–92

Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.

  1. L92
    cases hcases_right_right_right_right_right
51Establish htoo_large_13L93–93

Establish this local claim before using it. It is not an additional assumption.

  1. L93
    have htoo_large_13 : Lt(2,13)Definitions: Lt(2,13)Original native command in the exact edition
52Construct an explicit witnessL94–94

Supply the displayed value, then prove that it has the required property.

  1. L94
    exists 10
53Calculate and transport equalitiesL95–95

Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.

  1. L95
    norm_num
54Use earlier factsL96–99

Instantiate or apply named facts and discharge the corresponding proof obligations.

  1. L96
    specialize lt_not_le 2
  2. L97
    specialize lt_not_le 13
  3. L98
    apply lt_not_le
  4. L99
    exact htoo_large_13
55Calculate and transport equalitiesL100–100

Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.

  1. L100
    rewrite hcases_right_right_right_right_right_left at hp_bound
56Use earlier factsL101–101

Instantiate or apply named facts and discharge the corresponding proof obligations.

  1. L101
    exact hp_bound
57Separate the logical casesL102–102

Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.

  1. L102
    cases hcases_right_right_right_right_right_right
58Establish htoo_large_17L103–103

Establish this local claim before using it. It is not an additional assumption.

  1. L103
    have htoo_large_17 : Lt(2,17)Definitions: Lt(2,17)Original native command in the exact edition
59Construct an explicit witnessL104–104

Supply the displayed value, then prove that it has the required property.

  1. L104
    exists 14
60Calculate and transport equalitiesL105–105

Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.

  1. L105
    norm_num
61Use earlier factsL106–109

Instantiate or apply named facts and discharge the corresponding proof obligations.

  1. L106
    specialize lt_not_le 2
  2. L107
    specialize lt_not_le 17
  3. L108
    apply lt_not_le
  4. L109
    exact htoo_large_17
62Calculate and transport equalitiesL110–110

Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.

  1. L110
    rewrite hcases_right_right_right_right_right_right_left at hp_bound
63Use earlier factsL111–111

Instantiate or apply named facts and discharge the corresponding proof obligations.

  1. L111
    exact hp_bound
64Establish htoo_large_19L112–112

Establish this local claim before using it. It is not an additional assumption.

  1. L112
    have htoo_large_19 : Lt(2,19)Definitions: Lt(2,19)Original native command in the exact edition
65Construct an explicit witnessL113–113

Supply the displayed value, then prove that it has the required property.

  1. L113
    exists 16
66Calculate and transport equalitiesL114–114

Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.

  1. L114
    norm_num
67Use earlier factsL115–118

Instantiate or apply named facts and discharge the corresponding proof obligations.

  1. L115
    specialize lt_not_le 2
  2. L116
    specialize lt_not_le 19
  3. L117
    apply lt_not_le
  4. L118
    exact htoo_large_19
68Calculate and transport equalitiesL119–119

Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.

  1. L119
    rewrite hcases_right_right_right_right_right_right_right at hp_bound
69Use earlier factsL120–120

Instantiate or apply named facts and discharge the corresponding proof obligations.

  1. L120
    exact hp_bound

Library-wide reading audit

Original defined command ledger · 120 lines
  1. 0001have hn0 : ~(5 = 0)
  2. 0002intro hzero
  3. 0003apply PA1
  4. 0004exact hzero
  5. 0005have hn1 : ~(5 = 1)
  6. 0006intro hone
  7. 0007apply PA1
  8. 0008apply PA2
  9. 0009exact hone
  10. 0010have hsquare : Lt(5,3 · 3)
    Exact native replay linehave hsquare : exists bpr_gap_bb8cert_prime_five_square. bpr_gap_bb8cert_prime_five_square + S (5) = S 2 * S 2
  11. 0011exists 3
  12. 0012norm_num
  13. 0013specialize prime_of_no_small_prime_divisor_below_square 2
  14. 0014specialize prime_of_no_small_prime_divisor_below_square (5)
  15. 0015apply prime_of_no_small_prime_divisor_below_square
  16. 0016exact hn0
  17. 0017exact hn1
  18. 0018exact hsquare
  19. 0019intro p
  20. 0020intro hp
  21. 0021intro hp_bound
  22. 0022intro hdivides
  23. 0023have hbound_22 : Lt(1,22)
    Exact native replay linehave hbound_22 : exists k. k + 2 = 22
  24. 0024exists 20
  25. 0025norm_num
  26. 0026have hp_22 : Le(p,22)
    Exact native replay linehave hp_22 : exists k. k + p = 22
  27. 0027specialize le_trans p
  28. 0028specialize le_trans 2
  29. 0029specialize le_trans 22
  30. 0030apply le_trans
  31. 0031exact hp_bound
  32. 0032exact hbound_22
  33. 0033have hcases : p = 2 \/ (p = 3 \/ (p = 5 \/ (p = 7 \/ (p = 11 \/ (p = 13 \/ (p = 17 \/ (p = 19)))))))
  34. 0034specialize prime_le_twenty_two_cases p
  35. 0035apply prime_le_twenty_two_cases
  36. 0036exact hp
  37. 0037exact hp_22
  38. 0038cases hcases
  39. 0039rewrite hcases_left at hdivides
  40. 0040specialize nonzero_remainder_not_multiple 2
  41. 0041specialize nonzero_remainder_not_multiple (5)
  42. 0042specialize nonzero_remainder_not_multiple 2
  43. 0043specialize nonzero_remainder_not_multiple 1
  44. 0044apply nonzero_remainder_not_multiple
  45. 0045norm_num
  46. 0046intro hrem_2_zero
  47. 0047apply PA1
  48. 0048exact hrem_2_zero
  49. 0049exists 0
  50. 0050norm_num
  51. 0051exact hdivides
  52. 0052cases hcases_right
  53. 0053have htoo_large_3 : Lt(2,3)
    Exact native replay linehave htoo_large_3 : exists k. k + S 2 = 3
  54. 0054exists 0
  55. 0055norm_num
  56. 0056specialize lt_not_le 2
  57. 0057specialize lt_not_le 3
  58. 0058apply lt_not_le
  59. 0059exact htoo_large_3
  60. 0060rewrite hcases_right_left at hp_bound
  61. 0061exact hp_bound
  62. 0062cases hcases_right_right
  63. 0063have htoo_large_5 : Lt(2,5)
    Exact native replay linehave htoo_large_5 : exists k. k + S 2 = 5
  64. 0064exists 2
  65. 0065norm_num
  66. 0066specialize lt_not_le 2
  67. 0067specialize lt_not_le 5
  68. 0068apply lt_not_le
  69. 0069exact htoo_large_5
  70. 0070rewrite hcases_right_right_left at hp_bound
  71. 0071exact hp_bound
  72. 0072cases hcases_right_right_right
  73. 0073have htoo_large_7 : Lt(2,7)
    Exact native replay linehave htoo_large_7 : exists k. k + S 2 = 7
  74. 0074exists 4
  75. 0075norm_num
  76. 0076specialize lt_not_le 2
  77. 0077specialize lt_not_le 7
  78. 0078apply lt_not_le
  79. 0079exact htoo_large_7
  80. 0080rewrite hcases_right_right_right_left at hp_bound
  81. 0081exact hp_bound
  82. 0082cases hcases_right_right_right_right
  83. 0083have htoo_large_11 : Lt(2,11)
    Exact native replay linehave htoo_large_11 : exists k. k + S 2 = 11
  84. 0084exists 8
  85. 0085norm_num
  86. 0086specialize lt_not_le 2
  87. 0087specialize lt_not_le 11
  88. 0088apply lt_not_le
  89. 0089exact htoo_large_11
  90. 0090rewrite hcases_right_right_right_right_left at hp_bound
  91. 0091exact hp_bound
  92. 0092cases hcases_right_right_right_right_right
  93. 0093have htoo_large_13 : Lt(2,13)
    Exact native replay linehave htoo_large_13 : exists k. k + S 2 = 13
  94. 0094exists 10
  95. 0095norm_num
  96. 0096specialize lt_not_le 2
  97. 0097specialize lt_not_le 13
  98. 0098apply lt_not_le
  99. 0099exact htoo_large_13
  100. 0100rewrite hcases_right_right_right_right_right_left at hp_bound
  101. 0101exact hp_bound
  102. 0102cases hcases_right_right_right_right_right_right
  103. 0103have htoo_large_17 : Lt(2,17)
    Exact native replay linehave htoo_large_17 : exists k. k + S 2 = 17
  104. 0104exists 14
  105. 0105norm_num
  106. 0106specialize lt_not_le 2
  107. 0107specialize lt_not_le 17
  108. 0108apply lt_not_le
  109. 0109exact htoo_large_17
  110. 0110rewrite hcases_right_right_right_right_right_right_left at hp_bound
  111. 0111exact hp_bound
  112. 0112have htoo_large_19 : Lt(2,19)
    Exact native replay linehave htoo_large_19 : exists k. k + S 2 = 19
  113. 0113exists 16
  114. 0114norm_num
  115. 0115specialize lt_not_le 2
  116. 0116specialize lt_not_le 19
  117. 0117apply lt_not_le
  118. 0118exact htoo_large_19
  119. 0119rewrite hcases_right_right_right_right_right_right_right at hp_bound
  120. 0120exact hp_bound