A statement proved from itself
Lax771644.SelfReferentialProof · concepts/Lax771644/SelfReferentialProof.lean · lax-771644
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Theorem
A one-element cycle: the only proof of this statement assumes the statement itself. It stays unproven, and the drawing has to cope with a turnstile whose assumption and conclusion are the same node.
Concept map
Evidence
Each proof establishes this claim relative to its assumptions.
Lean source view on GitHub
| 1 | import Mathlib.Data.Nat.Notation |
| 2 | import Lax771644.Foundations |
| 3 | |
| 4 | /-! |
| 5 | --- |
| 6 | title: A statement proved from itself |
| 7 | type: theorem |
| 8 | --- |
| 9 | A one-element cycle: the only proof of this statement assumes the statement |
| 10 | itself. It stays unproven, and the drawing has to cope with a turnstile whose |
| 11 | assumption and conclusion are the same node. |
| 12 | |
| 13 | # Formalization notes |
| 14 | |
| 15 | Nothing subtle happens on the Lean side: an axiom may be used to prove a |
| 16 | theorem of its own type, and the archive then records the statement in its own |
| 17 | assumption set. |
| 18 | -/ |
| 19 | |
| 20 | namespace Lax771644.SelfReferentialProof |
| 21 | |
| 22 | /-- Descent from stage 310 to stage 300. -/ |
| 23 | axiom selfRung : Foundations.Descent 310 300 |
| 24 | |
| 25 | end Lax771644.SelfReferentialProof |
| 26 |
Formalization notes
Nothing subtle happens on the Lean side: an axiom may be used to prove a theorem of its own type, and the archive then records the statement in its own assumption set.
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments