Theorem dedekindle 11511

Description: The Dedekind cut theorem, with the hypothesis weakened to only require non-strict less than. (Contributed by Scott Fenton, 2-Jul-2013.)

Assertion

Ref	Expression
dedekindle	⊢ ((𝐴 ⊆ ℝ ∧ 𝐵 ⊆ ℝ ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝑥 ≤ 𝑦) → ∃𝑧 ∈ ℝ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝑥 ≤ 𝑧 ∧ 𝑧 ≤ 𝑦))

Distinct variable groups:   𝑥,𝐴,𝑦,𝑧   𝑥,𝐵,𝑦,𝑧

Proof of Theorem dedekindle

Dummy variable 𝑤 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		simpr1 1213	. . . 4 ⊢ (((𝐴 ∩ 𝐵) = ∅ ∧ (𝐴 ⊆ ℝ ∧ 𝐵 ⊆ ℝ ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝑥 ≤ 𝑦)) → 𝐴 ⊆ ℝ)
2		simpr2 1214	. . . 4 ⊢ (((𝐴 ∩ 𝐵) = ∅ ∧ (𝐴 ⊆ ℝ ∧ 𝐵 ⊆ ℝ ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝑥 ≤ 𝑦)) → 𝐵 ⊆ ℝ)
3		simp1 1154	. . . . . . . . . 10 ⊢ (((𝐴 ∩ 𝐵) = ∅ ∧ 𝐴 ⊆ ℝ ∧ 𝐵 ⊆ ℝ) → (𝐴 ∩ 𝐵) = ∅)
4		simpl 488	. . . . . . . . . 10 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → 𝑥 ∈ 𝐴)
5		disjel 4413	. . . . . . . . . 10 ⊢ (((𝐴 ∩ 𝐵) = ∅ ∧ 𝑥 ∈ 𝐴) → ¬ 𝑥 ∈ 𝐵)
6	3, 4, 5	syl2an 608	. . . . . . . . 9 ⊢ ((((𝐴 ∩ 𝐵) = ∅ ∧ 𝐴 ⊆ ℝ ∧ 𝐵 ⊆ ℝ) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) → ¬ 𝑥 ∈ 𝐵)
7		eleq1w 2847	. . . . . . . . . . . 12 ⊢ (𝑦 = 𝑥 → (𝑦 ∈ 𝐵 ↔ 𝑥 ∈ 𝐵))
8	7	biimpcd 252	. . . . . . . . . . 11 ⊢ (𝑦 ∈ 𝐵 → (𝑦 = 𝑥 → 𝑥 ∈ 𝐵))
9	8	necon3bd 2973	. . . . . . . . . 10 ⊢ (𝑦 ∈ 𝐵 → (¬ 𝑥 ∈ 𝐵 → 𝑦 ≠ 𝑥))
10	9	ad2antll 742	. . . . . . . . 9 ⊢ ((((𝐴 ∩ 𝐵) = ∅ ∧ 𝐴 ⊆ ℝ ∧ 𝐵 ⊆ ℝ) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) → (¬ 𝑥 ∈ 𝐵 → 𝑦 ≠ 𝑥))
11	6, 10	mpd 16	. . . . . . . 8 ⊢ ((((𝐴 ∩ 𝐵) = ∅ ∧ 𝐴 ⊆ ℝ ∧ 𝐵 ⊆ ℝ) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) → 𝑦 ≠ 𝑥)
12		simp2 1155	. . . . . . . . . . 11 ⊢ (((𝐴 ∩ 𝐵) = ∅ ∧ 𝐴 ⊆ ℝ ∧ 𝐵 ⊆ ℝ) → 𝐴 ⊆ ℝ)
13		ssel2 3908	. . . . . . . . . . 11 ⊢ ((𝐴 ⊆ ℝ ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ ℝ)
14	12, 4, 13	syl2an 608	. . . . . . . . . 10 ⊢ ((((𝐴 ∩ 𝐵) = ∅ ∧ 𝐴 ⊆ ℝ ∧ 𝐵 ⊆ ℝ) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) → 𝑥 ∈ ℝ)
15		simp3 1156	. . . . . . . . . . 11 ⊢ (((𝐴 ∩ 𝐵) = ∅ ∧ 𝐴 ⊆ ℝ ∧ 𝐵 ⊆ ℝ) → 𝐵 ⊆ ℝ)
16		simpr 490	. . . . . . . . . . 11 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → 𝑦 ∈ 𝐵)
17		ssel2 3908	. . . . . . . . . . 11 ⊢ ((𝐵 ⊆ ℝ ∧ 𝑦 ∈ 𝐵) → 𝑦 ∈ ℝ)
18	15, 16, 17	syl2an 608	. . . . . . . . . 10 ⊢ ((((𝐴 ∩ 𝐵) = ∅ ∧ 𝐴 ⊆ ℝ ∧ 𝐵 ⊆ ℝ) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) → 𝑦 ∈ ℝ)
19	14, 18	ltlend 11492	. . . . . . . . 9 ⊢ ((((𝐴 ∩ 𝐵) = ∅ ∧ 𝐴 ⊆ ℝ ∧ 𝐵 ⊆ ℝ) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) → (𝑥 < 𝑦 ↔ (𝑥 ≤ 𝑦 ∧ 𝑦 ≠ 𝑥)))
20	19	biimprd 251	. . . . . . . 8 ⊢ ((((𝐴 ∩ 𝐵) = ∅ ∧ 𝐴 ⊆ ℝ ∧ 𝐵 ⊆ ℝ) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) → ((𝑥 ≤ 𝑦 ∧ 𝑦 ≠ 𝑥) → 𝑥 < 𝑦))
21	11, 20	mpan2d 707	. . . . . . 7 ⊢ ((((𝐴 ∩ 𝐵) = ∅ ∧ 𝐴 ⊆ ℝ ∧ 𝐵 ⊆ ℝ) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) → (𝑥 ≤ 𝑦 → 𝑥 < 𝑦))
22	21	ralimdvva 3213	. . . . . 6 ⊢ (((𝐴 ∩ 𝐵) = ∅ ∧ 𝐴 ⊆ ℝ ∧ 𝐵 ⊆ ℝ) → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝑥 ≤ 𝑦 → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝑥 < 𝑦))
23	22	3exp 1137	. . . . 5 ⊢ ((𝐴 ∩ 𝐵) = ∅ → (𝐴 ⊆ ℝ → (𝐵 ⊆ ℝ → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝑥 ≤ 𝑦 → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝑥 < 𝑦))))
24	23	3imp2 1368	. . . 4 ⊢ (((𝐴 ∩ 𝐵) = ∅ ∧ (𝐴 ⊆ ℝ ∧ 𝐵 ⊆ ℝ ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝑥 ≤ 𝑦)) → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝑥 < 𝑦)
25		dedekind 11510	. . . 4 ⊢ ((𝐴 ⊆ ℝ ∧ 𝐵 ⊆ ℝ ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝑥 < 𝑦) → ∃𝑧 ∈ ℝ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝑥 ≤ 𝑧 ∧ 𝑧 ≤ 𝑦))
26	1, 2, 24, 25	syl3anc 1399	. . 3 ⊢ (((𝐴 ∩ 𝐵) = ∅ ∧ (𝐴 ⊆ ℝ ∧ 𝐵 ⊆ ℝ ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝑥 ≤ 𝑦)) → ∃𝑧 ∈ ℝ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝑥 ≤ 𝑧 ∧ 𝑧 ≤ 𝑦))
27	26	ex 418	. 2 ⊢ ((𝐴 ∩ 𝐵) = ∅ → ((𝐴 ⊆ ℝ ∧ 𝐵 ⊆ ℝ ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝑥 ≤ 𝑦) → ∃𝑧 ∈ ℝ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝑥 ≤ 𝑧 ∧ 𝑧 ≤ 𝑦)))
28		n0 4303	. . 3 ⊢ ((𝐴 ∩ 𝐵) ≠ ∅ ↔ ∃𝑤 𝑤 ∈ (𝐴 ∩ 𝐵))
29		simp1 1154	. . . . . . 7 ⊢ ((𝐴 ⊆ ℝ ∧ 𝐵 ⊆ ℝ ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝑥 ≤ 𝑦) → 𝐴 ⊆ ℝ)
30		elinel1 4101	. . . . . . 7 ⊢ (𝑤 ∈ (𝐴 ∩ 𝐵) → 𝑤 ∈ 𝐴)
31		ssel2 3908	. . . . . . 7 ⊢ ((𝐴 ⊆ ℝ ∧ 𝑤 ∈ 𝐴) → 𝑤 ∈ ℝ)
32	29, 30, 31	syl2an 608	. . . . . 6 ⊢ (((𝐴 ⊆ ℝ ∧ 𝐵 ⊆ ℝ ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝑥 ≤ 𝑦) ∧ 𝑤 ∈ (𝐴 ∩ 𝐵)) → 𝑤 ∈ ℝ)
33		nfv 1949	. . . . . . . . 9 ⊢ Ⅎ𝑥 𝐴 ⊆ ℝ
34		nfv 1949	. . . . . . . . 9 ⊢ Ⅎ𝑥 𝐵 ⊆ ℝ
35		nfra1 3290	. . . . . . . . 9 ⊢ Ⅎ𝑥∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝑥 ≤ 𝑦
36	33, 34, 35	nf3an 1936	. . . . . . . 8 ⊢ Ⅎ𝑥(𝐴 ⊆ ℝ ∧ 𝐵 ⊆ ℝ ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝑥 ≤ 𝑦)
37		nfv 1949	. . . . . . . 8 ⊢ Ⅎ𝑥 𝑤 ∈ (𝐴 ∩ 𝐵)
38	36, 37	nfan 1934	. . . . . . 7 ⊢ Ⅎ𝑥((𝐴 ⊆ ℝ ∧ 𝐵 ⊆ ℝ ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝑥 ≤ 𝑦) ∧ 𝑤 ∈ (𝐴 ∩ 𝐵))
39		nfv 1949	. . . . . . . . . . 11 ⊢ Ⅎ𝑦 𝐴 ⊆ ℝ
40		nfv 1949	. . . . . . . . . . 11 ⊢ Ⅎ𝑦 𝐵 ⊆ ℝ
41		nfra2w 3302	. . . . . . . . . . 11 ⊢ Ⅎ𝑦∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝑥 ≤ 𝑦
42	39, 40, 41	nf3an 1936	. . . . . . . . . 10 ⊢ Ⅎ𝑦(𝐴 ⊆ ℝ ∧ 𝐵 ⊆ ℝ ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝑥 ≤ 𝑦)
43		nfv 1949	. . . . . . . . . 10 ⊢ Ⅎ𝑦(𝑤 ∈ (𝐴 ∩ 𝐵) ∧ 𝑥 ∈ 𝐴)
44	42, 43	nfan 1934	. . . . . . . . 9 ⊢ Ⅎ𝑦((𝐴 ⊆ ℝ ∧ 𝐵 ⊆ ℝ ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝑥 ≤ 𝑦) ∧ (𝑤 ∈ (𝐴 ∩ 𝐵) ∧ 𝑥 ∈ 𝐴))
45		rsp 3254	. . . . . . . . . . . . . . . 16 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝑥 ≤ 𝑦 → (𝑥 ∈ 𝐴 → ∀𝑦 ∈ 𝐵 𝑥 ≤ 𝑦))
46		elinel2 4102	. . . . . . . . . . . . . . . . 17 ⊢ (𝑤 ∈ (𝐴 ∩ 𝐵) → 𝑤 ∈ 𝐵)
47		breq2 5110	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑦 = 𝑤 → (𝑥 ≤ 𝑦 ↔ 𝑥 ≤ 𝑤))
48	47	rspccv 3577	. . . . . . . . . . . . . . . . 17 ⊢ (∀𝑦 ∈ 𝐵 𝑥 ≤ 𝑦 → (𝑤 ∈ 𝐵 → 𝑥 ≤ 𝑤))
49	46, 48	syl5 35	. . . . . . . . . . . . . . . 16 ⊢ (∀𝑦 ∈ 𝐵 𝑥 ≤ 𝑦 → (𝑤 ∈ (𝐴 ∩ 𝐵) → 𝑥 ≤ 𝑤))
50	45, 49	syl6 36	. . . . . . . . . . . . . . 15 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝑥 ≤ 𝑦 → (𝑥 ∈ 𝐴 → (𝑤 ∈ (𝐴 ∩ 𝐵) → 𝑥 ≤ 𝑤)))
51	50	com23 87	. . . . . . . . . . . . . 14 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝑥 ≤ 𝑦 → (𝑤 ∈ (𝐴 ∩ 𝐵) → (𝑥 ∈ 𝐴 → 𝑥 ≤ 𝑤)))
52	51	imp32 424	. . . . . . . . . . . . 13 ⊢ ((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝑥 ≤ 𝑦 ∧ (𝑤 ∈ (𝐴 ∩ 𝐵) ∧ 𝑥 ∈ 𝐴)) → 𝑥 ≤ 𝑤)
53	52	3ad2antl3 1206	. . . . . . . . . . . 12 ⊢ (((𝐴 ⊆ ℝ ∧ 𝐵 ⊆ ℝ ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝑥 ≤ 𝑦) ∧ (𝑤 ∈ (𝐴 ∩ 𝐵) ∧ 𝑥 ∈ 𝐴)) → 𝑥 ≤ 𝑤)
54	53	adantr 486	. . . . . . . . . . 11 ⊢ ((((𝐴 ⊆ ℝ ∧ 𝐵 ⊆ ℝ ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝑥 ≤ 𝑦) ∧ (𝑤 ∈ (𝐴 ∩ 𝐵) ∧ 𝑥 ∈ 𝐴)) ∧ 𝑦 ∈ 𝐵) → 𝑥 ≤ 𝑤)
55		simp3 1156	. . . . . . . . . . . . 13 ⊢ ((𝐴 ⊆ ℝ ∧ 𝐵 ⊆ ℝ ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝑥 ≤ 𝑦) → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝑥 ≤ 𝑦)
56	30	adantr 486	. . . . . . . . . . . . 13 ⊢ ((𝑤 ∈ (𝐴 ∩ 𝐵) ∧ 𝑥 ∈ 𝐴) → 𝑤 ∈ 𝐴)
57		breq1 5109	. . . . . . . . . . . . . . 15 ⊢ (𝑥 = 𝑤 → (𝑥 ≤ 𝑦 ↔ 𝑤 ≤ 𝑦))
58	57	ralbidv 3189	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 𝑤 → (∀𝑦 ∈ 𝐵 𝑥 ≤ 𝑦 ↔ ∀𝑦 ∈ 𝐵 𝑤 ≤ 𝑦))
59	58	rspccva 3579	. . . . . . . . . . . . 13 ⊢ ((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝑥 ≤ 𝑦 ∧ 𝑤 ∈ 𝐴) → ∀𝑦 ∈ 𝐵 𝑤 ≤ 𝑦)
60	55, 56, 59	syl2an 608	. . . . . . . . . . . 12 ⊢ (((𝐴 ⊆ ℝ ∧ 𝐵 ⊆ ℝ ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝑥 ≤ 𝑦) ∧ (𝑤 ∈ (𝐴 ∩ 𝐵) ∧ 𝑥 ∈ 𝐴)) → ∀𝑦 ∈ 𝐵 𝑤 ≤ 𝑦)
61	60	r19.21bi 3258	. . . . . . . . . . 11 ⊢ ((((𝐴 ⊆ ℝ ∧ 𝐵 ⊆ ℝ ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝑥 ≤ 𝑦) ∧ (𝑤 ∈ (𝐴 ∩ 𝐵) ∧ 𝑥 ∈ 𝐴)) ∧ 𝑦 ∈ 𝐵) → 𝑤 ≤ 𝑦)
62	54, 61	jca 521	. . . . . . . . . 10 ⊢ ((((𝐴 ⊆ ℝ ∧ 𝐵 ⊆ ℝ ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝑥 ≤ 𝑦) ∧ (𝑤 ∈ (𝐴 ∩ 𝐵) ∧ 𝑥 ∈ 𝐴)) ∧ 𝑦 ∈ 𝐵) → (𝑥 ≤ 𝑤 ∧ 𝑤 ≤ 𝑦))
63	62	ex 418	. . . . . . . . 9 ⊢ (((𝐴 ⊆ ℝ ∧ 𝐵 ⊆ ℝ ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝑥 ≤ 𝑦) ∧ (𝑤 ∈ (𝐴 ∩ 𝐵) ∧ 𝑥 ∈ 𝐴)) → (𝑦 ∈ 𝐵 → (𝑥 ≤ 𝑤 ∧ 𝑤 ≤ 𝑦)))
64	44, 63	ralrimi 3264	. . . . . . . 8 ⊢ (((𝐴 ⊆ ℝ ∧ 𝐵 ⊆ ℝ ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝑥 ≤ 𝑦) ∧ (𝑤 ∈ (𝐴 ∩ 𝐵) ∧ 𝑥 ∈ 𝐴)) → ∀𝑦 ∈ 𝐵 (𝑥 ≤ 𝑤 ∧ 𝑤 ≤ 𝑦))
65	64	expr 462	. . . . . . 7 ⊢ (((𝐴 ⊆ ℝ ∧ 𝐵 ⊆ ℝ ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝑥 ≤ 𝑦) ∧ 𝑤 ∈ (𝐴 ∩ 𝐵)) → (𝑥 ∈ 𝐴 → ∀𝑦 ∈ 𝐵 (𝑥 ≤ 𝑤 ∧ 𝑤 ≤ 𝑦)))
66	38, 65	ralrimi 3264	. . . . . 6 ⊢ (((𝐴 ⊆ ℝ ∧ 𝐵 ⊆ ℝ ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝑥 ≤ 𝑦) ∧ 𝑤 ∈ (𝐴 ∩ 𝐵)) → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝑥 ≤ 𝑤 ∧ 𝑤 ≤ 𝑦))
67		breq2 5110	. . . . . . . . 9 ⊢ (𝑧 = 𝑤 → (𝑥 ≤ 𝑧 ↔ 𝑥 ≤ 𝑤))
68		breq1 5109	. . . . . . . . 9 ⊢ (𝑧 = 𝑤 → (𝑧 ≤ 𝑦 ↔ 𝑤 ≤ 𝑦))
69	67, 68	anbi12d 644	. . . . . . . 8 ⊢ (𝑧 = 𝑤 → ((𝑥 ≤ 𝑧 ∧ 𝑧 ≤ 𝑦) ↔ (𝑥 ≤ 𝑤 ∧ 𝑤 ≤ 𝑦)))
70	69	2ralbidv 3230	. . . . . . 7 ⊢ (𝑧 = 𝑤 → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝑥 ≤ 𝑧 ∧ 𝑧 ≤ 𝑦) ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝑥 ≤ 𝑤 ∧ 𝑤 ≤ 𝑦)))
71	70	rspcev 3580	. . . . . 6 ⊢ ((𝑤 ∈ ℝ ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝑥 ≤ 𝑤 ∧ 𝑤 ≤ 𝑦)) → ∃𝑧 ∈ ℝ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝑥 ≤ 𝑧 ∧ 𝑧 ≤ 𝑦))
72	32, 66, 71	syl2anc 596	. . . . 5 ⊢ (((𝐴 ⊆ ℝ ∧ 𝐵 ⊆ ℝ ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝑥 ≤ 𝑦) ∧ 𝑤 ∈ (𝐴 ∩ 𝐵)) → ∃𝑧 ∈ ℝ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝑥 ≤ 𝑧 ∧ 𝑧 ≤ 𝑦))
73	72	expcom 419	. . . 4 ⊢ (𝑤 ∈ (𝐴 ∩ 𝐵) → ((𝐴 ⊆ ℝ ∧ 𝐵 ⊆ ℝ ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝑥 ≤ 𝑦) → ∃𝑧 ∈ ℝ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝑥 ≤ 𝑧 ∧ 𝑧 ≤ 𝑦)))
74	73	exlimiv 1965	. . 3 ⊢ (∃𝑤 𝑤 ∈ (𝐴 ∩ 𝐵) → ((𝐴 ⊆ ℝ ∧ 𝐵 ⊆ ℝ ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝑥 ≤ 𝑦) → ∃𝑧 ∈ ℝ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝑥 ≤ 𝑧 ∧ 𝑧 ≤ 𝑦)))
75	28, 74	sylbi 220	. 2 ⊢ ((𝐴 ∩ 𝐵) ≠ ∅ → ((𝐴 ⊆ ℝ ∧ 𝐵 ⊆ ℝ ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝑥 ≤ 𝑦) → ∃𝑧 ∈ ℝ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝑥 ≤ 𝑧 ∧ 𝑧 ≤ 𝑦)))
76	27, 75	pm2.61ine 3042	1 ⊢ ((𝐴 ⊆ ℝ ∧ 𝐵 ⊆ ℝ ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝑥 ≤ 𝑦) → ∃𝑧 ∈ ℝ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝑥 ≤ 𝑧 ∧ 𝑧 ≤ 𝑦))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570  ∃wex 1812   ∈ wcel 2147   ≠ wne 2959  ∀wral 3080  ∃wrex 3090   ⊆ wss 3900   ∩ cin 4092  ∅c0 4281   class class class wbr 5106  ℝcr 11236   < clt 11380   ≤ cle 11381

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-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5253  ax-nul 5264  ax-pow 5332  ax-pr 5396  ax-un 7781  ax-resscn 11294  ax-1cn 11295  ax-icn 11296  ax-addcl 11297  ax-mulcl 11299  ax-mulrcl 11300  ax-i2m1 11305  ax-1ne0 11306  ax-rrecex 11309  ax-cnre 11310  ax-pre-lttri 11311  ax-pre-lttrn 11312  ax-pre-sup 11315

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-nel 3066  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-opab 5172  df-mpt 5191  df-id 5551  df-po 5564  df-so 5565  df-xp 5662  df-rel 5663  df-cnv 5664  df-co 5665  df-dm 5666  df-rn 5667  df-res 5668  df-ima 5669  df-iota 6518  df-fun 6566  df-fn 6567  df-f 6568  df-f1 6569  df-fo 6570  df-f1o 6571  df-fv 6572  df-ov 7452  df-er 8753  df-en 9010  df-dom 9011  df-sdom 9012  df-pnf 11382  df-mnf 11383  df-xr 11384  df-ltxr 11385  df-le 11386

This theorem is used by:  axcontlem10  29597