xrpnfdc - Intuitionistic Logic Explorer

	Intuitionistic Logic Explorer		< Previous Next > Nearby theorems
Mirrors > Home > ILE Home > Th. List > xrpnfdc		GIF version

Theorem xrpnfdc 10046

Description: An extended real is or is not plus infinity. (Contributed by Jim Kingdon, 13-Apr-2023.)

**Assertion**
Ref	Expression
xrpnfdc	⊢ (𝐴 ∈ ℝ^* → DECID 𝐴 = +∞)

**Proof of Theorem xrpnfdc**
Step	Hyp	Ref	Expression
1		elxr 9980	. 2 ⊢ (𝐴 ∈ ℝ^* ↔ (𝐴 ∈ ℝ ∨ 𝐴 = +∞ ∨ 𝐴 = -∞))
2		renepnf 8202	. . . . . 6 ⊢ (𝐴 ∈ ℝ → 𝐴 ≠ +∞)
3	2	neneqd 2421	. . . . 5 ⊢ (𝐴 ∈ ℝ → ¬ 𝐴 = +∞)
4	3	olcd 739	. . . 4 ⊢ (𝐴 ∈ ℝ → (𝐴 = +∞ ∨ ¬ 𝐴 = +∞))
5		df-dc 840	. . . 4 ⊢ (DECID 𝐴 = +∞ ↔ (𝐴 = +∞ ∨ ¬ 𝐴 = +∞))
6	4, 5	sylibr 134	. . 3 ⊢ (𝐴 ∈ ℝ → DECID 𝐴 = +∞)
7		orc 717	. . . 4 ⊢ (𝐴 = +∞ → (𝐴 = +∞ ∨ ¬ 𝐴 = +∞))
8	7, 5	sylibr 134	. . 3 ⊢ (𝐴 = +∞ → DECID 𝐴 = +∞)
9		mnfnepnf 8210	. . . . . . 7 ⊢ -∞ ≠ +∞
10	9	neii 2402	. . . . . 6 ⊢ ¬ -∞ = +∞
11		eqeq1 2236	. . . . . 6 ⊢ (𝐴 = -∞ → (𝐴 = +∞ ↔ -∞ = +∞))
12	10, 11	mtbiri 679	. . . . 5 ⊢ (𝐴 = -∞ → ¬ 𝐴 = +∞)
13	12	olcd 739	. . . 4 ⊢ (𝐴 = -∞ → (𝐴 = +∞ ∨ ¬ 𝐴 = +∞))
14	13, 5	sylibr 134	. . 3 ⊢ (𝐴 = -∞ → DECID 𝐴 = +∞)
15	6, 8, 14	3jaoi 1337	. 2 ⊢ ((𝐴 ∈ ℝ ∨ 𝐴 = +∞ ∨ 𝐴 = -∞) → DECID 𝐴 = +∞)
16	1, 15	sylbi 121	1 ⊢ (𝐴 ∈ ℝ^* → DECID 𝐴 = +∞)

Colors of variables: wff set class

Syntax hints: ¬ wn 3 → wi 4 ∨ wo 713 DECID wdc 839 ∨ w3o 1001 = wceq 1395 ∈ wcel 2200 ℝcr 8006 +∞cpnf 8186 -∞cmnf 8187 ℝ^*cxr 8188

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-sep 4202 ax-pow 4258 ax-un 4524 ax-cnex 8098 ax-resscn 8099

This theorem depends on definitions: df-bi 117 df-dc 840 df-3or 1003 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-nel 2496 df-rex 2514 df-rab 2517 df-v 2801 df-un 3201 df-in 3203 df-ss 3210 df-pw 3651 df-sn 3672 df-pr 3673 df-uni 3889 df-pnf 8191 df-mnf 8192 df-xr 8193

This theorem is referenced by: xaddf 10048 xaddval 10049 xaddpnf1 10050 xaddcom 10065 xnegdi 10072 xleadd1a 10077 xlesubadd 10087 xrmaxiflemcl 11764 xrmaxifle 11765 xrmaxiflemab 11766 xrmaxiflemlub 11767 xrmaxiflemcom 11768 xrmaxadd 11780 xblss2ps 15086 xblss2 15087