Theorem suplem1pr 11032

Description: The union of a nonempty, bounded set of positive reals is a positive real. Part of Proposition 9-3.3 of [Gleason] p. 122. (Contributed by NM, 19-May-1996.) (Revised by Mario Carneiro, 12-Jun-2013.) (New usage is discouraged.)

Assertion

Ref	Expression
suplem1pr	⊢ ((𝐴 ≠ ∅ ∧ ∃𝑥 ∈ P ∀𝑦 ∈ 𝐴 𝑦<P 𝑥) → ∪ 𝐴 ∈ P)

Distinct variable group:   𝑥,𝑦,𝐴

Proof of Theorem suplem1pr

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		ltrelpr 10978	. . . . . . . . 9 ⊢ <P ⊆ (P × P)
2	1	brel 5726	. . . . . . . 8 ⊢ (𝑦<P 𝑥 → (𝑦 ∈ P ∧ 𝑥 ∈ P))
3	2	simpld 499	. . . . . . 7 ⊢ (𝑦<P 𝑥 → 𝑦 ∈ P)
4	3	ralimi 3102	. . . . . 6 ⊢ (∀𝑦 ∈ 𝐴 𝑦<P 𝑥 → ∀𝑦 ∈ 𝐴 𝑦 ∈ P)
5		dfss3 3926	. . . . . 6 ⊢ (𝐴 ⊆ P ↔ ∀𝑦 ∈ 𝐴 𝑦 ∈ P)
6	4, 5	sylibr 237	. . . . 5 ⊢ (∀𝑦 ∈ 𝐴 𝑦<P 𝑥 → 𝐴 ⊆ P)
7	6	rexlimivw 3162	. . . 4 ⊢ (∃𝑥 ∈ P ∀𝑦 ∈ 𝐴 𝑦<P 𝑥 → 𝐴 ⊆ P)
8	7	adantl 486	. . 3 ⊢ ((𝐴 ≠ ∅ ∧ ∃𝑥 ∈ P ∀𝑦 ∈ 𝐴 𝑦<P 𝑥) → 𝐴 ⊆ P)
9		n0 4307	. . . . 5 ⊢ (𝐴 ≠ ∅ ↔ ∃𝑧 𝑧 ∈ 𝐴)
10		ssel 3931	. . . . . . 7 ⊢ (𝐴 ⊆ P → (𝑧 ∈ 𝐴 → 𝑧 ∈ P))
11		prn0 10969	. . . . . . . . . 10 ⊢ (𝑧 ∈ P → 𝑧 ≠ ∅)
12		0pss 4367	. . . . . . . . . 10 ⊢ (∅ ⊊ 𝑧 ↔ 𝑧 ≠ ∅)
13	11, 12	sylibr 237	. . . . . . . . 9 ⊢ (𝑧 ∈ P → ∅ ⊊ 𝑧)
14		elssuni 4904	. . . . . . . . 9 ⊢ (𝑧 ∈ 𝐴 → 𝑧 ⊆ ∪ 𝐴)
15		psssstr 4064	. . . . . . . . 9 ⊢ ((∅ ⊊ 𝑧 ∧ 𝑧 ⊆ ∪ 𝐴) → ∅ ⊊ ∪ 𝐴)
16	13, 14, 15	syl2an 607	. . . . . . . 8 ⊢ ((𝑧 ∈ P ∧ 𝑧 ∈ 𝐴) → ∅ ⊊ ∪ 𝐴)
17	16	expcom 418	. . . . . . 7 ⊢ (𝑧 ∈ 𝐴 → (𝑧 ∈ P → ∅ ⊊ ∪ 𝐴))
18	10, 17	sylcom 31	. . . . . 6 ⊢ (𝐴 ⊆ P → (𝑧 ∈ 𝐴 → ∅ ⊊ ∪ 𝐴))
19	18	exlimdv 1963	. . . . 5 ⊢ (𝐴 ⊆ P → (∃𝑧 𝑧 ∈ 𝐴 → ∅ ⊊ ∪ 𝐴))
20	9, 19	biimtrid 245	. . . 4 ⊢ (𝐴 ⊆ P → (𝐴 ≠ ∅ → ∅ ⊊ ∪ 𝐴))
21		prpssnq 10970	. . . . . . 7 ⊢ (𝑥 ∈ P → 𝑥 ⊊ Q)
22	21	adantl 486	. . . . . 6 ⊢ ((𝐴 ⊆ P ∧ 𝑥 ∈ P) → 𝑥 ⊊ Q)
23		ltprord 11010	. . . . . . . . . 10 ⊢ ((𝑦 ∈ P ∧ 𝑥 ∈ P) → (𝑦<P 𝑥 ↔ 𝑦 ⊊ 𝑥))
24		pssss 4052	. . . . . . . . . 10 ⊢ (𝑦 ⊊ 𝑥 → 𝑦 ⊆ 𝑥)
25	23, 24	biimtrdi 256	. . . . . . . . 9 ⊢ ((𝑦 ∈ P ∧ 𝑥 ∈ P) → (𝑦<P 𝑥 → 𝑦 ⊆ 𝑥))
26	2, 25	mpcom 39	. . . . . . . 8 ⊢ (𝑦<P 𝑥 → 𝑦 ⊆ 𝑥)
27	26	ralimi 3102	. . . . . . 7 ⊢ (∀𝑦 ∈ 𝐴 𝑦<P 𝑥 → ∀𝑦 ∈ 𝐴 𝑦 ⊆ 𝑥)
28		unissb 4906	. . . . . . 7 ⊢ (∪ 𝐴 ⊆ 𝑥 ↔ ∀𝑦 ∈ 𝐴 𝑦 ⊆ 𝑥)
29	27, 28	sylibr 237	. . . . . 6 ⊢ (∀𝑦 ∈ 𝐴 𝑦<P 𝑥 → ∪ 𝐴 ⊆ 𝑥)
30		sspsstr 4063	. . . . . . 7 ⊢ ((∪ 𝐴 ⊆ 𝑥 ∧ 𝑥 ⊊ Q) → ∪ 𝐴 ⊊ Q)
31	30	expcom 418	. . . . . 6 ⊢ (𝑥 ⊊ Q → (∪ 𝐴 ⊆ 𝑥 → ∪ 𝐴 ⊊ Q))
32	22, 29, 31	syl2im 41	. . . . 5 ⊢ ((𝐴 ⊆ P ∧ 𝑥 ∈ P) → (∀𝑦 ∈ 𝐴 𝑦<P 𝑥 → ∪ 𝐴 ⊊ Q))
33	32	rexlimdva 3166	. . . 4 ⊢ (𝐴 ⊆ P → (∃𝑥 ∈ P ∀𝑦 ∈ 𝐴 𝑦<P 𝑥 → ∪ 𝐴 ⊊ Q))
34	20, 33	anim12d 620	. . 3 ⊢ (𝐴 ⊆ P → ((𝐴 ≠ ∅ ∧ ∃𝑥 ∈ P ∀𝑦 ∈ 𝐴 𝑦<P 𝑥) → (∅ ⊊ ∪ 𝐴 ∧ ∪ 𝐴 ⊊ Q)))
35	8, 34	mpcom 39	. 2 ⊢ ((𝐴 ≠ ∅ ∧ ∃𝑥 ∈ P ∀𝑦 ∈ 𝐴 𝑦<P 𝑥) → (∅ ⊊ ∪ 𝐴 ∧ ∪ 𝐴 ⊊ Q))
36		prcdnq 10973	. . . . . . . . . . . . 13 ⊢ ((𝑧 ∈ P ∧ 𝑥 ∈ 𝑧) → (𝑦 <Q 𝑥 → 𝑦 ∈ 𝑧))
37	36	ex 417	. . . . . . . . . . . 12 ⊢ (𝑧 ∈ P → (𝑥 ∈ 𝑧 → (𝑦 <Q 𝑥 → 𝑦 ∈ 𝑧)))
38	37	com3r 88	. . . . . . . . . . 11 ⊢ (𝑦 <Q 𝑥 → (𝑧 ∈ P → (𝑥 ∈ 𝑧 → 𝑦 ∈ 𝑧)))
39	10, 38	sylan9 516	. . . . . . . . . 10 ⊢ ((𝐴 ⊆ P ∧ 𝑦 <Q 𝑥) → (𝑧 ∈ 𝐴 → (𝑥 ∈ 𝑧 → 𝑦 ∈ 𝑧)))
40	39	reximdvai 3176	. . . . . . . . 9 ⊢ ((𝐴 ⊆ P ∧ 𝑦 <Q 𝑥) → (∃𝑧 ∈ 𝐴 𝑥 ∈ 𝑧 → ∃𝑧 ∈ 𝐴 𝑦 ∈ 𝑧))
41		eluni2 4876	. . . . . . . . 9 ⊢ (𝑥 ∈ ∪ 𝐴 ↔ ∃𝑧 ∈ 𝐴 𝑥 ∈ 𝑧)
42		eluni2 4876	. . . . . . . . 9 ⊢ (𝑦 ∈ ∪ 𝐴 ↔ ∃𝑧 ∈ 𝐴 𝑦 ∈ 𝑧)
43	40, 41, 42	3imtr4g 299	. . . . . . . 8 ⊢ ((𝐴 ⊆ P ∧ 𝑦 <Q 𝑥) → (𝑥 ∈ ∪ 𝐴 → 𝑦 ∈ ∪ 𝐴))
44	43	ex 417	. . . . . . 7 ⊢ (𝐴 ⊆ P → (𝑦 <Q 𝑥 → (𝑥 ∈ ∪ 𝐴 → 𝑦 ∈ ∪ 𝐴)))
45	44	com23 87	. . . . . 6 ⊢ (𝐴 ⊆ P → (𝑥 ∈ ∪ 𝐴 → (𝑦 <Q 𝑥 → 𝑦 ∈ ∪ 𝐴)))
46	45	alrimdv 1959	. . . . 5 ⊢ (𝐴 ⊆ P → (𝑥 ∈ ∪ 𝐴 → ∀𝑦(𝑦 <Q 𝑥 → 𝑦 ∈ ∪ 𝐴)))
47		eluni 4875	. . . . . 6 ⊢ (𝑥 ∈ ∪ 𝐴 ↔ ∃𝑧(𝑥 ∈ 𝑧 ∧ 𝑧 ∈ 𝐴))
48		prnmax 10975	. . . . . . . . . . . . 13 ⊢ ((𝑧 ∈ P ∧ 𝑥 ∈ 𝑧) → ∃𝑦 ∈ 𝑧 𝑥 <Q 𝑦)
49	48	ex 417	. . . . . . . . . . . 12 ⊢ (𝑧 ∈ P → (𝑥 ∈ 𝑧 → ∃𝑦 ∈ 𝑧 𝑥 <Q 𝑦))
50	10, 49	syl6 36	. . . . . . . . . . 11 ⊢ (𝐴 ⊆ P → (𝑧 ∈ 𝐴 → (𝑥 ∈ 𝑧 → ∃𝑦 ∈ 𝑧 𝑥 <Q 𝑦)))
51	50	com23 87	. . . . . . . . . 10 ⊢ (𝐴 ⊆ P → (𝑥 ∈ 𝑧 → (𝑧 ∈ 𝐴 → ∃𝑦 ∈ 𝑧 𝑥 <Q 𝑦)))
52	51	imp 411	. . . . . . . . 9 ⊢ ((𝐴 ⊆ P ∧ 𝑥 ∈ 𝑧) → (𝑧 ∈ 𝐴 → ∃𝑦 ∈ 𝑧 𝑥 <Q 𝑦))
53		ssrexv 4007	. . . . . . . . . 10 ⊢ (𝑧 ⊆ ∪ 𝐴 → (∃𝑦 ∈ 𝑧 𝑥 <Q 𝑦 → ∃𝑦 ∈ ∪ 𝐴𝑥 <Q 𝑦))
54	14, 53	syl 18	. . . . . . . . 9 ⊢ (𝑧 ∈ 𝐴 → (∃𝑦 ∈ 𝑧 𝑥 <Q 𝑦 → ∃𝑦 ∈ ∪ 𝐴𝑥 <Q 𝑦))
55	52, 54	sylcom 31	. . . . . . . 8 ⊢ ((𝐴 ⊆ P ∧ 𝑥 ∈ 𝑧) → (𝑧 ∈ 𝐴 → ∃𝑦 ∈ ∪ 𝐴𝑥 <Q 𝑦))
56	55	expimpd 458	. . . . . . 7 ⊢ (𝐴 ⊆ P → ((𝑥 ∈ 𝑧 ∧ 𝑧 ∈ 𝐴) → ∃𝑦 ∈ ∪ 𝐴𝑥 <Q 𝑦))
57	56	exlimdv 1963	. . . . . 6 ⊢ (𝐴 ⊆ P → (∃𝑧(𝑥 ∈ 𝑧 ∧ 𝑧 ∈ 𝐴) → ∃𝑦 ∈ ∪ 𝐴𝑥 <Q 𝑦))
58	47, 57	biimtrid 245	. . . . 5 ⊢ (𝐴 ⊆ P → (𝑥 ∈ ∪ 𝐴 → ∃𝑦 ∈ ∪ 𝐴𝑥 <Q 𝑦))
59	46, 58	jcad 521	. . . 4 ⊢ (𝐴 ⊆ P → (𝑥 ∈ ∪ 𝐴 → (∀𝑦(𝑦 <Q 𝑥 → 𝑦 ∈ ∪ 𝐴) ∧ ∃𝑦 ∈ ∪ 𝐴𝑥 <Q 𝑦)))
60	59	ralrimiv 3156	. . 3 ⊢ (𝐴 ⊆ P → ∀𝑥 ∈ ∪ 𝐴(∀𝑦(𝑦 <Q 𝑥 → 𝑦 ∈ ∪ 𝐴) ∧ ∃𝑦 ∈ ∪ 𝐴𝑥 <Q 𝑦))
61	8, 60	syl 18	. 2 ⊢ ((𝐴 ≠ ∅ ∧ ∃𝑥 ∈ P ∀𝑦 ∈ 𝐴 𝑦<P 𝑥) → ∀𝑥 ∈ ∪ 𝐴(∀𝑦(𝑦 <Q 𝑥 → 𝑦 ∈ ∪ 𝐴) ∧ ∃𝑦 ∈ ∪ 𝐴𝑥 <Q 𝑦))
62		elnp 10967	. 2 ⊢ (∪ 𝐴 ∈ P ↔ ((∅ ⊊ ∪ 𝐴 ∧ ∪ 𝐴 ⊊ Q) ∧ ∀𝑥 ∈ ∪ 𝐴(∀𝑦(𝑦 <Q 𝑥 → 𝑦 ∈ ∪ 𝐴) ∧ ∃𝑦 ∈ ∪ 𝐴𝑥 <Q 𝑦)))
63	35, 61, 62	sylanbrc 594	1 ⊢ ((𝐴 ≠ ∅ ∧ ∃𝑥 ∈ P ∀𝑦 ∈ 𝐴 𝑦<P 𝑥) → ∪ 𝐴 ∈ P)

Syntax hints:   → wi 4   ∧ wa 400  ∀wal 1568  ∃wex 1809   ∈ wcel 2143   ≠ wne 2958  ∀wral 3079  ∃wrex 3089   ⊆ wss 3905   ⊊ wpss 3906  ∅c0 4286  ∪ cuni 4872   class class class wbr 5109  Qcnq 10832   <_Q cltq 10838  Pcnp 10839  <_P cltp 10843

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-12 2213  ax-ext 2735  ax-sep 5257  ax-nul 5269  ax-pow 5336  ax-pr 5404  ax-un 7732  ax-inf2 9606

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-sb 2097  df-clab 2742  df-cleq 2755  df-clel 2838  df-ne 2959  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-pss 3925  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-br 5110  df-opab 5174  df-tr 5219  df-eprel 5561  df-po 5569  df-so 5570  df-fr 5614  df-we 5616  df-xp 5667  df-rel 5668  df-ord 6363  df-on 6364  df-lim 6365  df-suc 6366  df-om 7859  df-ni 10852  df-nq 10892  df-ltnq 10898  df-np 10961  df-ltp 10965

This theorem is referenced by:  supexpr  11034