Theorem axpre-sup 11155

Description: A nonempty, bounded-above set of reals has a supremum. Axiom 22 of 22 for real and complex numbers, derived from ZF set theory. Note: The more general version with ordering on extended reals is axsup 11286. This construction-dependent theorem should not be referenced directly; instead, use ax-pre-sup 11179. (Contributed by NM, 19-May-1996.) (Revised by Mario Carneiro, 16-Jun-2013.) (New usage is discouraged.)

Assertion

Ref	Expression
axpre-sup	⊢ ((𝐴 ⊆ ℝ ∧ 𝐴 ≠ ∅ ∧ ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐴 𝑦 <ℝ 𝑥) → ∃𝑥 ∈ ℝ (∀𝑦 ∈ 𝐴 ¬ 𝑥 <ℝ 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 <ℝ 𝑥 → ∃𝑧 ∈ 𝐴 𝑦 <ℝ 𝑧)))

Distinct variable group:   𝑥,𝑦,𝑧,𝐴

Proof of Theorem axpre-sup

Dummy variables 𝑤 𝑣 𝑢 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		elreal2 11118	. . . . . . 7 ⊢ (𝑥 ∈ ℝ ↔ ((1st ‘𝑥) ∈ R ∧ 𝑥 = ⟨(1st ‘𝑥), 0R⟩))
2	1	simplbi 501	. . . . . 6 ⊢ (𝑥 ∈ ℝ → (1st ‘𝑥) ∈ R)
3	2	adantl 486	. . . . 5 ⊢ (((𝐴 ⊆ ℝ ∧ 𝐴 ≠ ∅) ∧ 𝑥 ∈ ℝ) → (1st ‘𝑥) ∈ R)
4		fo1st 8007	. . . . . . . . . . . 12 ⊢ 1st :V–onto→V
5		fof 6794	. . . . . . . . . . . 12 ⊢ (1st :V–onto→V → 1st :V⟶V)
6		ffn 6707	. . . . . . . . . . . 12 ⊢ (1st :V⟶V → 1st Fn V)
7	4, 5, 6	mp2b 10	. . . . . . . . . . 11 ⊢ 1st Fn V
8		ssv 3962	. . . . . . . . . . 11 ⊢ 𝐴 ⊆ V
9		fvelimab 6955	. . . . . . . . . . 11 ⊢ ((1st Fn V ∧ 𝐴 ⊆ V) → (𝑤 ∈ (1st “ 𝐴) ↔ ∃𝑦 ∈ 𝐴 (1st ‘𝑦) = 𝑤))
10	7, 8, 9	mp2an 704	. . . . . . . . . 10 ⊢ (𝑤 ∈ (1st “ 𝐴) ↔ ∃𝑦 ∈ 𝐴 (1st ‘𝑦) = 𝑤)
11		r19.29 3128	. . . . . . . . . . . 12 ⊢ ((∀𝑦 ∈ 𝐴 𝑦 <ℝ 𝑥 ∧ ∃𝑦 ∈ 𝐴 (1st ‘𝑦) = 𝑤) → ∃𝑦 ∈ 𝐴 (𝑦 <ℝ 𝑥 ∧ (1st ‘𝑦) = 𝑤))
12		ssel2 3933	. . . . . . . . . . . . . . . . 17 ⊢ ((𝐴 ⊆ ℝ ∧ 𝑦 ∈ 𝐴) → 𝑦 ∈ ℝ)
13		ltresr2 11127	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑦 ∈ ℝ ∧ 𝑥 ∈ ℝ) → (𝑦 <ℝ 𝑥 ↔ (1st ‘𝑦) <R (1st ‘𝑥)))
14		breq1 5113	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((1st ‘𝑦) = 𝑤 → ((1st ‘𝑦) <R (1st ‘𝑥) ↔ 𝑤 <R (1st ‘𝑥)))
15	13, 14	sylan9bb 518	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝑦 ∈ ℝ ∧ 𝑥 ∈ ℝ) ∧ (1st ‘𝑦) = 𝑤) → (𝑦 <ℝ 𝑥 ↔ 𝑤 <R (1st ‘𝑥)))
16	15	biimpd 232	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑦 ∈ ℝ ∧ 𝑥 ∈ ℝ) ∧ (1st ‘𝑦) = 𝑤) → (𝑦 <ℝ 𝑥 → 𝑤 <R (1st ‘𝑥)))
17	16	exp31 424	. . . . . . . . . . . . . . . . 17 ⊢ (𝑦 ∈ ℝ → (𝑥 ∈ ℝ → ((1st ‘𝑦) = 𝑤 → (𝑦 <ℝ 𝑥 → 𝑤 <R (1st ‘𝑥)))))
18	12, 17	syl 18	. . . . . . . . . . . . . . . 16 ⊢ ((𝐴 ⊆ ℝ ∧ 𝑦 ∈ 𝐴) → (𝑥 ∈ ℝ → ((1st ‘𝑦) = 𝑤 → (𝑦 <ℝ 𝑥 → 𝑤 <R (1st ‘𝑥)))))
19	18	imp4b 426	. . . . . . . . . . . . . . 15 ⊢ (((𝐴 ⊆ ℝ ∧ 𝑦 ∈ 𝐴) ∧ 𝑥 ∈ ℝ) → (((1st ‘𝑦) = 𝑤 ∧ 𝑦 <ℝ 𝑥) → 𝑤 <R (1st ‘𝑥)))
20	19	ancomsd 470	. . . . . . . . . . . . . 14 ⊢ (((𝐴 ⊆ ℝ ∧ 𝑦 ∈ 𝐴) ∧ 𝑥 ∈ ℝ) → ((𝑦 <ℝ 𝑥 ∧ (1st ‘𝑦) = 𝑤) → 𝑤 <R (1st ‘𝑥)))
21	20	an32s 664	. . . . . . . . . . . . 13 ⊢ (((𝐴 ⊆ ℝ ∧ 𝑥 ∈ ℝ) ∧ 𝑦 ∈ 𝐴) → ((𝑦 <ℝ 𝑥 ∧ (1st ‘𝑦) = 𝑤) → 𝑤 <R (1st ‘𝑥)))
22	21	rexlimdva 3166	. . . . . . . . . . . 12 ⊢ ((𝐴 ⊆ ℝ ∧ 𝑥 ∈ ℝ) → (∃𝑦 ∈ 𝐴 (𝑦 <ℝ 𝑥 ∧ (1st ‘𝑦) = 𝑤) → 𝑤 <R (1st ‘𝑥)))
23	11, 22	syl5 35	. . . . . . . . . . 11 ⊢ ((𝐴 ⊆ ℝ ∧ 𝑥 ∈ ℝ) → ((∀𝑦 ∈ 𝐴 𝑦 <ℝ 𝑥 ∧ ∃𝑦 ∈ 𝐴 (1st ‘𝑦) = 𝑤) → 𝑤 <R (1st ‘𝑥)))
24	23	expd 420	. . . . . . . . . 10 ⊢ ((𝐴 ⊆ ℝ ∧ 𝑥 ∈ ℝ) → (∀𝑦 ∈ 𝐴 𝑦 <ℝ 𝑥 → (∃𝑦 ∈ 𝐴 (1st ‘𝑦) = 𝑤 → 𝑤 <R (1st ‘𝑥))))
25	10, 24	syl7bi 258	. . . . . . . . 9 ⊢ ((𝐴 ⊆ ℝ ∧ 𝑥 ∈ ℝ) → (∀𝑦 ∈ 𝐴 𝑦 <ℝ 𝑥 → (𝑤 ∈ (1st “ 𝐴) → 𝑤 <R (1st ‘𝑥))))
26	25	impr 459	. . . . . . . 8 ⊢ ((𝐴 ⊆ ℝ ∧ (𝑥 ∈ ℝ ∧ ∀𝑦 ∈ 𝐴 𝑦 <ℝ 𝑥)) → (𝑤 ∈ (1st “ 𝐴) → 𝑤 <R (1st ‘𝑥)))
27	26	adantlr 727	. . . . . . 7 ⊢ (((𝐴 ⊆ ℝ ∧ 𝐴 ≠ ∅) ∧ (𝑥 ∈ ℝ ∧ ∀𝑦 ∈ 𝐴 𝑦 <ℝ 𝑥)) → (𝑤 ∈ (1st “ 𝐴) → 𝑤 <R (1st ‘𝑥)))
28	27	ralrimiv 3156	. . . . . 6 ⊢ (((𝐴 ⊆ ℝ ∧ 𝐴 ≠ ∅) ∧ (𝑥 ∈ ℝ ∧ ∀𝑦 ∈ 𝐴 𝑦 <ℝ 𝑥)) → ∀𝑤 ∈ (1st “ 𝐴)𝑤 <R (1st ‘𝑥))
29	28	expr 461	. . . . 5 ⊢ (((𝐴 ⊆ ℝ ∧ 𝐴 ≠ ∅) ∧ 𝑥 ∈ ℝ) → (∀𝑦 ∈ 𝐴 𝑦 <ℝ 𝑥 → ∀𝑤 ∈ (1st “ 𝐴)𝑤 <R (1st ‘𝑥)))
30		brralrspcev 5172	. . . . 5 ⊢ (((1st ‘𝑥) ∈ R ∧ ∀𝑤 ∈ (1st “ 𝐴)𝑤 <R (1st ‘𝑥)) → ∃𝑣 ∈ R ∀𝑤 ∈ (1st “ 𝐴)𝑤 <R 𝑣)
31	3, 29, 30	syl6an 696	. . . 4 ⊢ (((𝐴 ⊆ ℝ ∧ 𝐴 ≠ ∅) ∧ 𝑥 ∈ ℝ) → (∀𝑦 ∈ 𝐴 𝑦 <ℝ 𝑥 → ∃𝑣 ∈ R ∀𝑤 ∈ (1st “ 𝐴)𝑤 <R 𝑣))
32	31	rexlimdva 3166	. . 3 ⊢ ((𝐴 ⊆ ℝ ∧ 𝐴 ≠ ∅) → (∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐴 𝑦 <ℝ 𝑥 → ∃𝑣 ∈ R ∀𝑤 ∈ (1st “ 𝐴)𝑤 <R 𝑣))
33		n0 4308	. . . . . 6 ⊢ (𝐴 ≠ ∅ ↔ ∃𝑦 𝑦 ∈ 𝐴)
34		fnfvima 7233	. . . . . . . . 9 ⊢ ((1st Fn V ∧ 𝐴 ⊆ V ∧ 𝑦 ∈ 𝐴) → (1st ‘𝑦) ∈ (1st “ 𝐴))
35	7, 8, 34	mp3an12 1480	. . . . . . . 8 ⊢ (𝑦 ∈ 𝐴 → (1st ‘𝑦) ∈ (1st “ 𝐴))
36	35	ne0d 4296	. . . . . . 7 ⊢ (𝑦 ∈ 𝐴 → (1st “ 𝐴) ≠ ∅)
37	36	exlimiv 1960	. . . . . 6 ⊢ (∃𝑦 𝑦 ∈ 𝐴 → (1st “ 𝐴) ≠ ∅)
38	33, 37	sylbi 220	. . . . 5 ⊢ (𝐴 ≠ ∅ → (1st “ 𝐴) ≠ ∅)
39		supsr 11098	. . . . . 6 ⊢ (((1st “ 𝐴) ≠ ∅ ∧ ∃𝑣 ∈ R ∀𝑤 ∈ (1st “ 𝐴)𝑤 <R 𝑣) → ∃𝑣 ∈ R (∀𝑤 ∈ (1st “ 𝐴) ¬ 𝑣 <R 𝑤 ∧ ∀𝑤 ∈ R (𝑤 <R 𝑣 → ∃𝑢 ∈ (1st “ 𝐴)𝑤 <R 𝑢)))
40	39	ex 417	. . . . 5 ⊢ ((1st “ 𝐴) ≠ ∅ → (∃𝑣 ∈ R ∀𝑤 ∈ (1st “ 𝐴)𝑤 <R 𝑣 → ∃𝑣 ∈ R (∀𝑤 ∈ (1st “ 𝐴) ¬ 𝑣 <R 𝑤 ∧ ∀𝑤 ∈ R (𝑤 <R 𝑣 → ∃𝑢 ∈ (1st “ 𝐴)𝑤 <R 𝑢))))
41	38, 40	syl 18	. . . 4 ⊢ (𝐴 ≠ ∅ → (∃𝑣 ∈ R ∀𝑤 ∈ (1st “ 𝐴)𝑤 <R 𝑣 → ∃𝑣 ∈ R (∀𝑤 ∈ (1st “ 𝐴) ¬ 𝑣 <R 𝑤 ∧ ∀𝑤 ∈ R (𝑤 <R 𝑣 → ∃𝑢 ∈ (1st “ 𝐴)𝑤 <R 𝑢))))
42	41	adantl 486	. . 3 ⊢ ((𝐴 ⊆ ℝ ∧ 𝐴 ≠ ∅) → (∃𝑣 ∈ R ∀𝑤 ∈ (1st “ 𝐴)𝑤 <R 𝑣 → ∃𝑣 ∈ R (∀𝑤 ∈ (1st “ 𝐴) ¬ 𝑣 <R 𝑤 ∧ ∀𝑤 ∈ R (𝑤 <R 𝑣 → ∃𝑢 ∈ (1st “ 𝐴)𝑤 <R 𝑢))))
43		breq2 5114	. . . . . . . . . . . 12 ⊢ (𝑤 = (1st ‘𝑦) → (𝑣 <R 𝑤 ↔ 𝑣 <R (1st ‘𝑦)))
44	43	notbid 321	. . . . . . . . . . 11 ⊢ (𝑤 = (1st ‘𝑦) → (¬ 𝑣 <R 𝑤 ↔ ¬ 𝑣 <R (1st ‘𝑦)))
45	44	rspccv 3579	. . . . . . . . . 10 ⊢ (∀𝑤 ∈ (1st “ 𝐴) ¬ 𝑣 <R 𝑤 → ((1st ‘𝑦) ∈ (1st “ 𝐴) → ¬ 𝑣 <R (1st ‘𝑦)))
46	35, 45	syl5com 32	. . . . . . . . 9 ⊢ (𝑦 ∈ 𝐴 → (∀𝑤 ∈ (1st “ 𝐴) ¬ 𝑣 <R 𝑤 → ¬ 𝑣 <R (1st ‘𝑦)))
47	46	adantl 486	. . . . . . . 8 ⊢ ((𝐴 ⊆ ℝ ∧ 𝑦 ∈ 𝐴) → (∀𝑤 ∈ (1st “ 𝐴) ¬ 𝑣 <R 𝑤 → ¬ 𝑣 <R (1st ‘𝑦)))
48		elreal2 11118	. . . . . . . . . . . . 13 ⊢ (𝑦 ∈ ℝ ↔ ((1st ‘𝑦) ∈ R ∧ 𝑦 = ⟨(1st ‘𝑦), 0R⟩))
49	48	simprbi 502	. . . . . . . . . . . 12 ⊢ (𝑦 ∈ ℝ → 𝑦 = ⟨(1st ‘𝑦), 0R⟩)
50	49	breq2d 5122	. . . . . . . . . . 11 ⊢ (𝑦 ∈ ℝ → (⟨𝑣, 0R⟩ <ℝ 𝑦 ↔ ⟨𝑣, 0R⟩ <ℝ ⟨(1st ‘𝑦), 0R⟩))
51		ltresr 11126	. . . . . . . . . . 11 ⊢ (⟨𝑣, 0R⟩ <ℝ ⟨(1st ‘𝑦), 0R⟩ ↔ 𝑣 <R (1st ‘𝑦))
52	50, 51	bitrdi 290	. . . . . . . . . 10 ⊢ (𝑦 ∈ ℝ → (⟨𝑣, 0R⟩ <ℝ 𝑦 ↔ 𝑣 <R (1st ‘𝑦)))
53	12, 52	syl 18	. . . . . . . . 9 ⊢ ((𝐴 ⊆ ℝ ∧ 𝑦 ∈ 𝐴) → (⟨𝑣, 0R⟩ <ℝ 𝑦 ↔ 𝑣 <R (1st ‘𝑦)))
54	53	notbid 321	. . . . . . . 8 ⊢ ((𝐴 ⊆ ℝ ∧ 𝑦 ∈ 𝐴) → (¬ ⟨𝑣, 0R⟩ <ℝ 𝑦 ↔ ¬ 𝑣 <R (1st ‘𝑦)))
55	47, 54	sylibrd 262	. . . . . . 7 ⊢ ((𝐴 ⊆ ℝ ∧ 𝑦 ∈ 𝐴) → (∀𝑤 ∈ (1st “ 𝐴) ¬ 𝑣 <R 𝑤 → ¬ ⟨𝑣, 0R⟩ <ℝ 𝑦))
56	55	ralrimdva 3165	. . . . . 6 ⊢ (𝐴 ⊆ ℝ → (∀𝑤 ∈ (1st “ 𝐴) ¬ 𝑣 <R 𝑤 → ∀𝑦 ∈ 𝐴 ¬ ⟨𝑣, 0R⟩ <ℝ 𝑦))
57	56	ad2antrr 738	. . . . 5 ⊢ (((𝐴 ⊆ ℝ ∧ 𝐴 ≠ ∅) ∧ 𝑣 ∈ R) → (∀𝑤 ∈ (1st “ 𝐴) ¬ 𝑣 <R 𝑤 → ∀𝑦 ∈ 𝐴 ¬ ⟨𝑣, 0R⟩ <ℝ 𝑦))
58	49	breq1d 5120	. . . . . . . . . . . . . 14 ⊢ (𝑦 ∈ ℝ → (𝑦 <ℝ ⟨𝑣, 0R⟩ ↔ ⟨(1st ‘𝑦), 0R⟩ <ℝ ⟨𝑣, 0R⟩))
59		ltresr 11126	. . . . . . . . . . . . . 14 ⊢ (⟨(1st ‘𝑦), 0R⟩ <ℝ ⟨𝑣, 0R⟩ ↔ (1st ‘𝑦) <R 𝑣)
60	58, 59	bitrdi 290	. . . . . . . . . . . . 13 ⊢ (𝑦 ∈ ℝ → (𝑦 <ℝ ⟨𝑣, 0R⟩ ↔ (1st ‘𝑦) <R 𝑣))
61	48	simplbi 501	. . . . . . . . . . . . . . 15 ⊢ (𝑦 ∈ ℝ → (1st ‘𝑦) ∈ R)
62		breq1 5113	. . . . . . . . . . . . . . . . 17 ⊢ (𝑤 = (1st ‘𝑦) → (𝑤 <R 𝑣 ↔ (1st ‘𝑦) <R 𝑣))
63		breq1 5113	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑤 = (1st ‘𝑦) → (𝑤 <R 𝑢 ↔ (1st ‘𝑦) <R 𝑢))
64	63	rexbidv 3189	. . . . . . . . . . . . . . . . 17 ⊢ (𝑤 = (1st ‘𝑦) → (∃𝑢 ∈ (1st “ 𝐴)𝑤 <R 𝑢 ↔ ∃𝑢 ∈ (1st “ 𝐴)(1st ‘𝑦) <R 𝑢))
65	62, 64	imbi12d 347	. . . . . . . . . . . . . . . 16 ⊢ (𝑤 = (1st ‘𝑦) → ((𝑤 <R 𝑣 → ∃𝑢 ∈ (1st “ 𝐴)𝑤 <R 𝑢) ↔ ((1st ‘𝑦) <R 𝑣 → ∃𝑢 ∈ (1st “ 𝐴)(1st ‘𝑦) <R 𝑢)))
66	65	rspccv 3579	. . . . . . . . . . . . . . 15 ⊢ (∀𝑤 ∈ R (𝑤 <R 𝑣 → ∃𝑢 ∈ (1st “ 𝐴)𝑤 <R 𝑢) → ((1st ‘𝑦) ∈ R → ((1st ‘𝑦) <R 𝑣 → ∃𝑢 ∈ (1st “ 𝐴)(1st ‘𝑦) <R 𝑢)))
67	61, 66	syl5 35	. . . . . . . . . . . . . 14 ⊢ (∀𝑤 ∈ R (𝑤 <R 𝑣 → ∃𝑢 ∈ (1st “ 𝐴)𝑤 <R 𝑢) → (𝑦 ∈ ℝ → ((1st ‘𝑦) <R 𝑣 → ∃𝑢 ∈ (1st “ 𝐴)(1st ‘𝑦) <R 𝑢)))
68	67	com3l 90	. . . . . . . . . . . . 13 ⊢ (𝑦 ∈ ℝ → ((1st ‘𝑦) <R 𝑣 → (∀𝑤 ∈ R (𝑤 <R 𝑣 → ∃𝑢 ∈ (1st “ 𝐴)𝑤 <R 𝑢) → ∃𝑢 ∈ (1st “ 𝐴)(1st ‘𝑦) <R 𝑢)))
69	60, 68	sylbid 243	. . . . . . . . . . . 12 ⊢ (𝑦 ∈ ℝ → (𝑦 <ℝ ⟨𝑣, 0R⟩ → (∀𝑤 ∈ R (𝑤 <R 𝑣 → ∃𝑢 ∈ (1st “ 𝐴)𝑤 <R 𝑢) → ∃𝑢 ∈ (1st “ 𝐴)(1st ‘𝑦) <R 𝑢)))
70	69	adantr 485	. . . . . . . . . . 11 ⊢ ((𝑦 ∈ ℝ ∧ 𝐴 ⊆ ℝ) → (𝑦 <ℝ ⟨𝑣, 0R⟩ → (∀𝑤 ∈ R (𝑤 <R 𝑣 → ∃𝑢 ∈ (1st “ 𝐴)𝑤 <R 𝑢) → ∃𝑢 ∈ (1st “ 𝐴)(1st ‘𝑦) <R 𝑢)))
71		fvelimab 6955	. . . . . . . . . . . . . . . 16 ⊢ ((1st Fn V ∧ 𝐴 ⊆ V) → (𝑢 ∈ (1st “ 𝐴) ↔ ∃𝑧 ∈ 𝐴 (1st ‘𝑧) = 𝑢))
72	7, 8, 71	mp2an 704	. . . . . . . . . . . . . . 15 ⊢ (𝑢 ∈ (1st “ 𝐴) ↔ ∃𝑧 ∈ 𝐴 (1st ‘𝑧) = 𝑢)
73		ssel2 3933	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝐴 ⊆ ℝ ∧ 𝑧 ∈ 𝐴) → 𝑧 ∈ ℝ)
74		ltresr2 11127	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝑦 ∈ ℝ ∧ 𝑧 ∈ ℝ) → (𝑦 <ℝ 𝑧 ↔ (1st ‘𝑦) <R (1st ‘𝑧)))
75	73, 74	sylan2 604	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝑦 ∈ ℝ ∧ (𝐴 ⊆ ℝ ∧ 𝑧 ∈ 𝐴)) → (𝑦 <ℝ 𝑧 ↔ (1st ‘𝑦) <R (1st ‘𝑧)))
76		breq2 5114	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((1st ‘𝑧) = 𝑢 → ((1st ‘𝑦) <R (1st ‘𝑧) ↔ (1st ‘𝑦) <R 𝑢))
77	75, 76	sylan9bb 518	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝑦 ∈ ℝ ∧ (𝐴 ⊆ ℝ ∧ 𝑧 ∈ 𝐴)) ∧ (1st ‘𝑧) = 𝑢) → (𝑦 <ℝ 𝑧 ↔ (1st ‘𝑦) <R 𝑢))
78	77	exbiri 822	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑦 ∈ ℝ ∧ (𝐴 ⊆ ℝ ∧ 𝑧 ∈ 𝐴)) → ((1st ‘𝑧) = 𝑢 → ((1st ‘𝑦) <R 𝑢 → 𝑦 <ℝ 𝑧)))
79	78	expr 461	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑦 ∈ ℝ ∧ 𝐴 ⊆ ℝ) → (𝑧 ∈ 𝐴 → ((1st ‘𝑧) = 𝑢 → ((1st ‘𝑦) <R 𝑢 → 𝑦 <ℝ 𝑧))))
80	79	com4r 95	. . . . . . . . . . . . . . . . 17 ⊢ ((1st ‘𝑦) <R 𝑢 → ((𝑦 ∈ ℝ ∧ 𝐴 ⊆ ℝ) → (𝑧 ∈ 𝐴 → ((1st ‘𝑧) = 𝑢 → 𝑦 <ℝ 𝑧))))
81	80	imp 411	. . . . . . . . . . . . . . . 16 ⊢ (((1st ‘𝑦) <R 𝑢 ∧ (𝑦 ∈ ℝ ∧ 𝐴 ⊆ ℝ)) → (𝑧 ∈ 𝐴 → ((1st ‘𝑧) = 𝑢 → 𝑦 <ℝ 𝑧)))
82	81	reximdvai 3176	. . . . . . . . . . . . . . 15 ⊢ (((1st ‘𝑦) <R 𝑢 ∧ (𝑦 ∈ ℝ ∧ 𝐴 ⊆ ℝ)) → (∃𝑧 ∈ 𝐴 (1st ‘𝑧) = 𝑢 → ∃𝑧 ∈ 𝐴 𝑦 <ℝ 𝑧))
83	72, 82	biimtrid 245	. . . . . . . . . . . . . 14 ⊢ (((1st ‘𝑦) <R 𝑢 ∧ (𝑦 ∈ ℝ ∧ 𝐴 ⊆ ℝ)) → (𝑢 ∈ (1st “ 𝐴) → ∃𝑧 ∈ 𝐴 𝑦 <ℝ 𝑧))
84	83	expcom 418	. . . . . . . . . . . . 13 ⊢ ((𝑦 ∈ ℝ ∧ 𝐴 ⊆ ℝ) → ((1st ‘𝑦) <R 𝑢 → (𝑢 ∈ (1st “ 𝐴) → ∃𝑧 ∈ 𝐴 𝑦 <ℝ 𝑧)))
85	84	com23 87	. . . . . . . . . . . 12 ⊢ ((𝑦 ∈ ℝ ∧ 𝐴 ⊆ ℝ) → (𝑢 ∈ (1st “ 𝐴) → ((1st ‘𝑦) <R 𝑢 → ∃𝑧 ∈ 𝐴 𝑦 <ℝ 𝑧)))
86	85	rexlimdv 3164	. . . . . . . . . . 11 ⊢ ((𝑦 ∈ ℝ ∧ 𝐴 ⊆ ℝ) → (∃𝑢 ∈ (1st “ 𝐴)(1st ‘𝑦) <R 𝑢 → ∃𝑧 ∈ 𝐴 𝑦 <ℝ 𝑧))
87	70, 86	syl6d 76	. . . . . . . . . 10 ⊢ ((𝑦 ∈ ℝ ∧ 𝐴 ⊆ ℝ) → (𝑦 <ℝ ⟨𝑣, 0R⟩ → (∀𝑤 ∈ R (𝑤 <R 𝑣 → ∃𝑢 ∈ (1st “ 𝐴)𝑤 <R 𝑢) → ∃𝑧 ∈ 𝐴 𝑦 <ℝ 𝑧)))
88	87	com23 87	. . . . . . . . 9 ⊢ ((𝑦 ∈ ℝ ∧ 𝐴 ⊆ ℝ) → (∀𝑤 ∈ R (𝑤 <R 𝑣 → ∃𝑢 ∈ (1st “ 𝐴)𝑤 <R 𝑢) → (𝑦 <ℝ ⟨𝑣, 0R⟩ → ∃𝑧 ∈ 𝐴 𝑦 <ℝ 𝑧)))
89	88	ex 417	. . . . . . . 8 ⊢ (𝑦 ∈ ℝ → (𝐴 ⊆ ℝ → (∀𝑤 ∈ R (𝑤 <R 𝑣 → ∃𝑢 ∈ (1st “ 𝐴)𝑤 <R 𝑢) → (𝑦 <ℝ ⟨𝑣, 0R⟩ → ∃𝑧 ∈ 𝐴 𝑦 <ℝ 𝑧))))
90	89	com3l 90	. . . . . . 7 ⊢ (𝐴 ⊆ ℝ → (∀𝑤 ∈ R (𝑤 <R 𝑣 → ∃𝑢 ∈ (1st “ 𝐴)𝑤 <R 𝑢) → (𝑦 ∈ ℝ → (𝑦 <ℝ ⟨𝑣, 0R⟩ → ∃𝑧 ∈ 𝐴 𝑦 <ℝ 𝑧))))
91	90	ad2antrr 738	. . . . . 6 ⊢ (((𝐴 ⊆ ℝ ∧ 𝐴 ≠ ∅) ∧ 𝑣 ∈ R) → (∀𝑤 ∈ R (𝑤 <R 𝑣 → ∃𝑢 ∈ (1st “ 𝐴)𝑤 <R 𝑢) → (𝑦 ∈ ℝ → (𝑦 <ℝ ⟨𝑣, 0R⟩ → ∃𝑧 ∈ 𝐴 𝑦 <ℝ 𝑧))))
92	91	ralrimdv 3163	. . . . 5 ⊢ (((𝐴 ⊆ ℝ ∧ 𝐴 ≠ ∅) ∧ 𝑣 ∈ R) → (∀𝑤 ∈ R (𝑤 <R 𝑣 → ∃𝑢 ∈ (1st “ 𝐴)𝑤 <R 𝑢) → ∀𝑦 ∈ ℝ (𝑦 <ℝ ⟨𝑣, 0R⟩ → ∃𝑧 ∈ 𝐴 𝑦 <ℝ 𝑧)))
93		opelreal 11116	. . . . . . 7 ⊢ (⟨𝑣, 0R⟩ ∈ ℝ ↔ 𝑣 ∈ R)
94	93	bilanri 511	. . . . . 6 ⊢ (((𝐴 ⊆ ℝ ∧ 𝐴 ≠ ∅) ∧ 𝑣 ∈ R) → ⟨𝑣, 0R⟩ ∈ ℝ)
95		breq1 5113	. . . . . . . . . . 11 ⊢ (𝑥 = ⟨𝑣, 0R⟩ → (𝑥 <ℝ 𝑦 ↔ ⟨𝑣, 0R⟩ <ℝ 𝑦))
96	95	notbid 321	. . . . . . . . . 10 ⊢ (𝑥 = ⟨𝑣, 0R⟩ → (¬ 𝑥 <ℝ 𝑦 ↔ ¬ ⟨𝑣, 0R⟩ <ℝ 𝑦))
97	96	ralbidv 3188	. . . . . . . . 9 ⊢ (𝑥 = ⟨𝑣, 0R⟩ → (∀𝑦 ∈ 𝐴 ¬ 𝑥 <ℝ 𝑦 ↔ ∀𝑦 ∈ 𝐴 ¬ ⟨𝑣, 0R⟩ <ℝ 𝑦))
98		breq2 5114	. . . . . . . . . . 11 ⊢ (𝑥 = ⟨𝑣, 0R⟩ → (𝑦 <ℝ 𝑥 ↔ 𝑦 <ℝ ⟨𝑣, 0R⟩))
99	98	imbi1d 344	. . . . . . . . . 10 ⊢ (𝑥 = ⟨𝑣, 0R⟩ → ((𝑦 <ℝ 𝑥 → ∃𝑧 ∈ 𝐴 𝑦 <ℝ 𝑧) ↔ (𝑦 <ℝ ⟨𝑣, 0R⟩ → ∃𝑧 ∈ 𝐴 𝑦 <ℝ 𝑧)))
100	99	ralbidv 3188	. . . . . . . . 9 ⊢ (𝑥 = ⟨𝑣, 0R⟩ → (∀𝑦 ∈ ℝ (𝑦 <ℝ 𝑥 → ∃𝑧 ∈ 𝐴 𝑦 <ℝ 𝑧) ↔ ∀𝑦 ∈ ℝ (𝑦 <ℝ ⟨𝑣, 0R⟩ → ∃𝑧 ∈ 𝐴 𝑦 <ℝ 𝑧)))
101	97, 100	anbi12d 643	. . . . . . . 8 ⊢ (𝑥 = ⟨𝑣, 0R⟩ → ((∀𝑦 ∈ 𝐴 ¬ 𝑥 <ℝ 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 <ℝ 𝑥 → ∃𝑧 ∈ 𝐴 𝑦 <ℝ 𝑧)) ↔ (∀𝑦 ∈ 𝐴 ¬ ⟨𝑣, 0R⟩ <ℝ 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 <ℝ ⟨𝑣, 0R⟩ → ∃𝑧 ∈ 𝐴 𝑦 <ℝ 𝑧))))
102	101	rspcev 3582	. . . . . . 7 ⊢ ((⟨𝑣, 0R⟩ ∈ ℝ ∧ (∀𝑦 ∈ 𝐴 ¬ ⟨𝑣, 0R⟩ <ℝ 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 <ℝ ⟨𝑣, 0R⟩ → ∃𝑧 ∈ 𝐴 𝑦 <ℝ 𝑧))) → ∃𝑥 ∈ ℝ (∀𝑦 ∈ 𝐴 ¬ 𝑥 <ℝ 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 <ℝ 𝑥 → ∃𝑧 ∈ 𝐴 𝑦 <ℝ 𝑧)))
103	102	ex 417	. . . . . 6 ⊢ (⟨𝑣, 0R⟩ ∈ ℝ → ((∀𝑦 ∈ 𝐴 ¬ ⟨𝑣, 0R⟩ <ℝ 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 <ℝ ⟨𝑣, 0R⟩ → ∃𝑧 ∈ 𝐴 𝑦 <ℝ 𝑧)) → ∃𝑥 ∈ ℝ (∀𝑦 ∈ 𝐴 ¬ 𝑥 <ℝ 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 <ℝ 𝑥 → ∃𝑧 ∈ 𝐴 𝑦 <ℝ 𝑧))))
104	94, 103	syl 18	. . . . 5 ⊢ (((𝐴 ⊆ ℝ ∧ 𝐴 ≠ ∅) ∧ 𝑣 ∈ R) → ((∀𝑦 ∈ 𝐴 ¬ ⟨𝑣, 0R⟩ <ℝ 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 <ℝ ⟨𝑣, 0R⟩ → ∃𝑧 ∈ 𝐴 𝑦 <ℝ 𝑧)) → ∃𝑥 ∈ ℝ (∀𝑦 ∈ 𝐴 ¬ 𝑥 <ℝ 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 <ℝ 𝑥 → ∃𝑧 ∈ 𝐴 𝑦 <ℝ 𝑧))))
105	57, 92, 104	syl2and 619	. . . 4 ⊢ (((𝐴 ⊆ ℝ ∧ 𝐴 ≠ ∅) ∧ 𝑣 ∈ R) → ((∀𝑤 ∈ (1st “ 𝐴) ¬ 𝑣 <R 𝑤 ∧ ∀𝑤 ∈ R (𝑤 <R 𝑣 → ∃𝑢 ∈ (1st “ 𝐴)𝑤 <R 𝑢)) → ∃𝑥 ∈ ℝ (∀𝑦 ∈ 𝐴 ¬ 𝑥 <ℝ 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 <ℝ 𝑥 → ∃𝑧 ∈ 𝐴 𝑦 <ℝ 𝑧))))
106	105	rexlimdva 3166	. . 3 ⊢ ((𝐴 ⊆ ℝ ∧ 𝐴 ≠ ∅) → (∃𝑣 ∈ R (∀𝑤 ∈ (1st “ 𝐴) ¬ 𝑣 <R 𝑤 ∧ ∀𝑤 ∈ R (𝑤 <R 𝑣 → ∃𝑢 ∈ (1st “ 𝐴)𝑤 <R 𝑢)) → ∃𝑥 ∈ ℝ (∀𝑦 ∈ 𝐴 ¬ 𝑥 <ℝ 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 <ℝ 𝑥 → ∃𝑧 ∈ 𝐴 𝑦 <ℝ 𝑧))))
107	32, 42, 106	3syld 61	. 2 ⊢ ((𝐴 ⊆ ℝ ∧ 𝐴 ≠ ∅) → (∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐴 𝑦 <ℝ 𝑥 → ∃𝑥 ∈ ℝ (∀𝑦 ∈ 𝐴 ¬ 𝑥 <ℝ 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 <ℝ 𝑥 → ∃𝑧 ∈ 𝐴 𝑦 <ℝ 𝑧))))
108	107	3impia 1135	1 ⊢ ((𝐴 ⊆ ℝ ∧ 𝐴 ≠ ∅ ∧ ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝐴 𝑦 <ℝ 𝑥) → ∃𝑥 ∈ ℝ (∀𝑦 ∈ 𝐴 ¬ 𝑥 <ℝ 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 <ℝ 𝑥 → ∃𝑧 ∈ 𝐴 𝑦 <ℝ 𝑧)))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 400   ∧ w3a 1103   = wceq 1570  ∃wex 1809   ∈ wcel 2143   ≠ wne 2958  ∀wral 3079  ∃wrex 3089  Vcvv 3455   ⊆ wss 3906  ∅c0 4287  ⟨cop 4596   class class class wbr 5110   “ cima 5666   Fn wfn 6533  ⟶wf 6534  –onto→wfo 6536  ‘cfv 6538  1^st c1st 7985  Rcnr 10851  0_Rc0r 10852   <_R cltr 10857  ℝcr 11100   <_ℝ cltrr 11105

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-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-sep 5258  ax-nul 5270  ax-pow 5338  ax-pr 5406  ax-un 7734  ax-inf2 9611

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-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3746  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-pss 3926  df-nul 4288  df-if 4489  df-pw 4565  df-sn 4591  df-pr 4593  df-op 4597  df-uni 4874  df-int 4914  df-iun 4959  df-br 5111  df-opab 5175  df-mpt 5194  df-tr 5220  df-id 5558  df-eprel 5563  df-po 5571  df-so 5572  df-fr 5616  df-we 5618  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-pred 6304  df-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-ov 7415  df-oprab 7416  df-mpo 7417  df-om 7864  df-1st 7987  df-2nd 7988  df-frecs 8279  df-wrecs 8310  df-recs 8359  df-rdg 8398  df-1o 8454  df-oadd 8458  df-omul 8459  df-er 8695  df-ec 8697  df-qs 8701  df-ni 10858  df-pli 10859  df-mi 10860  df-lti 10861  df-plpq 10894  df-mpq 10895  df-ltpq 10896  df-enq 10897  df-nq 10898  df-erq 10899  df-plq 10900  df-mq 10901  df-1nq 10902  df-rq 10903  df-ltnq 10904  df-np 10967  df-1p 10968  df-plp 10969  df-mp 10970  df-ltp 10971  df-enr 11041  df-nr 11042  df-plr 11043  df-mr 11044  df-ltr 11045  df-0r 11046  df-1r 11047  df-m1r 11048  df-r 11111  df-lt 11114

This theorem is referenced by: (None)