HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Definition df-pnf 5684
Description: Define plus infinity. Note that the definition is arbitrary, requiring only that +oo be a set not in RR and different from -oo (df-mnf 5685). We use P~U.CC to make it independent of the construction of CC, and Cantor's Theorem will show that it is different from any member of CC and therefore RR. See pnfnre 5693, mnfnre 5694, and pnfnemnf 5733.

A simpler possibility is to define +oo as CC and -oo as {CC}, but that approach requires the Axiom of Regularity to show that +oo and -oo are different from each other and from all members of RR.

Assertion
Ref Expression
df-pnf |- +oo = P~U.CC

Detailed syntax breakdown of Definition df-pnf
StepHypRef Expression
1 cpnf 5680 . 2 class +oo
2 cc 5429 . . . 4 class CC
32cuni 2608 . . 3 class U.CC
43cpw 2495 . 2 class P~U.CC
51, 4wceq 1018 1 wff +oo = P~U.CC
Colors of variables: wff set class
This definition is referenced by:  pnfxr 5690  mnfxr 5691  pnfnre 5693  mnfnre 5694
Copyright terms: Public domain