Theorem prn0 11113

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 11112	. . 3 ⊢ (𝐴 ∈ P ↔ ((𝐴 ∈ V ∧ ∅ ⊊ 𝐴 ∧ 𝐴 ⊊ Q) ∧ ∀𝑥 ∈ 𝐴 (∀𝑦(𝑦 <Q 𝑥 → 𝑦 ∈ 𝐴) ∧ ∃𝑦 ∈ 𝐴 𝑥 <Q 𝑦)))
2		simpl2 1211	. . 3 ⊢ (((𝐴 ∈ V ∧ ∅ ⊊ 𝐴 ∧ 𝐴 ⊊ Q) ∧ ∀𝑥 ∈ 𝐴 (∀𝑦(𝑦 <Q 𝑥 → 𝑦 ∈ 𝐴) ∧ ∃𝑦 ∈ 𝐴 𝑥 <Q 𝑦)) → ∅ ⊊ 𝐴)
3	1, 2	sylbi 220	. 2 ⊢ (𝐴 ∈ P → ∅ ⊊ 𝐴)
4		0pss 4363	. 2 ⊢ (∅ ⊊ 𝐴 ↔ 𝐴 ≠ ∅)
5	3, 4	sylib 221	1 ⊢ (𝐴 ∈ P → 𝐴 ≠ ∅)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103  ∀wal 1568   ∈ wcel 2147   ≠ wne 2959  ∀wral 3080  ∃wrex 3090  Vcvv 3454   ⊊ wpss 4016  ∅c0 4281   class class class wbr 5108  Qcnq 10976   <_Q cltq 10982  Pcnp 10983

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735

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 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ne 2960  df-ral 3081  df-rex 3091  df-v 3456  df-ss 3901  df-pss 4017  df-dif 4050  df-nul 4282  df-np 11105

This theorem is used by:  0npr  11116  npomex  11120  genpn0  11127  prlem934  11157  ltaddpr  11158  prlem936  11171  reclem2pr  11172  suplem1pr  11176