![]() |
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 4295 | . . 3 ⊢ ¬ ⟨𝑊, (R1𝑑)⟩ ∈ ∅ | |
2 | df-br 5111 | . . 3 ⊢ (𝑊∅(R1𝑑) ↔ ⟨𝑊, (R1𝑑)⟩ ∈ ∅) | |
3 | 1, 2 | mtbir 323 | . 2 ⊢ ¬ 𝑊∅(R1𝑑) |
4 | 3 | intnan 488 | 1 ⊢ ¬ (ℎ ∈ (𝐿𝐿0) ∧ 𝑊∅(R1𝑑)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 ∧ wa 397 ∈ wcel 2107 ∅c0 4287 ⟨cop 4597 class class class wbr 5110 (class class class)co 7362 Rcnr 10808 0cc0 11058 1c1 11059 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-ext 2708 |
This theorem depends on definitions: df-bi 206 df-an 398 df-tru 1545 df-fal 1555 df-ex 1783 df-sb 2069 df-clab 2715 df-cleq 2729 df-clel 2815 df-dif 3918 df-nul 4288 df-br 5111 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |