![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > helloworld | Structured version Visualization version GIF version |
Description: The classic "Hello world" benchmark has been translated into 314 computer programming languages - see http://helloworldcollection.de. However, for many years it eluded a proof that it is more than just a conjecture, even though a wily mathematician once claimed, "I have discovered a truly marvelous proof of this, which this margin is too narrow to contain." Using an IBM 709 mainframe, a team of mathematicians led by Prof. Loof Lirpa, at the New College of Tahiti, were finally able to put it to rest with a remarkably short proof only four lines long. (Contributed by Prof. Loof Lirpa, 1-Apr-2007.) (Proof modification is discouraged.) (New usage is discouraged.) |
Ref | Expression |
---|---|
helloworld | ⊢ ¬ (ℎ ∈ (𝐿𝐿0) ∧ 𝑊∅(R1𝑑)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | noel 4330 | . . 3 ⊢ ¬ ⟨𝑊, (R1𝑑)⟩ ∈ ∅ | |
2 | df-br 5149 | . . 3 ⊢ (𝑊∅(R1𝑑) ↔ ⟨𝑊, (R1𝑑)⟩ ∈ ∅) | |
3 | 1, 2 | mtbir 322 | . 2 ⊢ ¬ 𝑊∅(R1𝑑) |
4 | 3 | intnan 487 | 1 ⊢ ¬ (ℎ ∈ (𝐿𝐿0) ∧ 𝑊∅(R1𝑑)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 ∧ wa 396 ∈ wcel 2106 ∅c0 4322 ⟨cop 4634 class class class wbr 5148 (class class class)co 7408 Rcnr 10859 0cc0 11109 1c1 11110 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-ext 2703 |
This theorem depends on definitions: df-bi 206 df-an 397 df-tru 1544 df-fal 1554 df-ex 1782 df-sb 2068 df-clab 2710 df-cleq 2724 df-clel 2810 df-dif 3951 df-nul 4323 df-br 5149 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |