Theorem prn0 11067

Description: A positive real is not empty. (Contributed by NM, 15-May-1996.) (Revised by Mario Carneiro, 11-May-2013.) (New usage is discouraged.)

Assertion

Ref	Expression
prn0	⊢ (𝐴 ∈ P → 𝐴 ≠ ∅)

Proof of Theorem prn0

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		elnpi 11066	. . 3 ⊢ (𝐴 ∈ P ↔ ((𝐴 ∈ V ∧ ∅ ⊊ 𝐴 ∧ 𝐴 ⊊ Q) ∧ ∀𝑥 ∈ 𝐴 (∀𝑦(𝑦 <Q 𝑥 → 𝑦 ∈ 𝐴) ∧ ∃𝑦 ∈ 𝐴 𝑥 <Q 𝑦)))
2		simpl2 1211	. . 3 ⊢ (((𝐴 ∈ V ∧ ∅ ⊊ 𝐴 ∧ 𝐴 ⊊ Q) ∧ ∀𝑥 ∈ 𝐴 (∀𝑦(𝑦 <Q 𝑥 → 𝑦 ∈ 𝐴) ∧ ∃𝑦 ∈ 𝐴 𝑥 <Q 𝑦)) → ∅ ⊊ 𝐴)
3	1, 2	sylbi 220	. 2 ⊢ (𝐴 ∈ P → ∅ ⊊ 𝐴)
4		0pss 4360	. 2 ⊢ (∅ ⊊ 𝐴 ↔ 𝐴 ≠ ∅)
5	3, 4	sylib 221	1 ⊢ (𝐴 ∈ P → 𝐴 ≠ ∅)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103  ∀wal 1568   ∈ wcel 2145   ≠ wne 2956  ∀wral 3077  ∃wrex 3087  Vcvv 3451   ⊊ wpss 3900  ∅c0 4279   class class class wbr 5103  Qcnq 10930   <_Q cltq 10936  Pcnp 10937

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2733

This proof depends on definitions:  df-bi 210  df-an 402  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-ne 2957  df-ral 3078  df-rex 3088  df-v 3453  df-dif 3902  df-ss 3916  df-pss 3919  df-nul 4280  df-np 11059

This theorem is used by:  0npr  11070  npomex  11074  genpn0  11081  prlem934  11111  ltaddpr  11112  prlem936  11125  reclem2pr  11126  suplem1pr  11130