Theorem dyadmax 25547

Description: Any nonempty set of dyadic rational intervals has a maximal element. (Contributed by Mario Carneiro, 26-Mar-2015.)

Hypothesis

Ref	Expression
dyadmbl.1	⊢ 𝐹 = (𝑥 ∈ ℤ, 𝑦 ∈ ℕ0 ↦ ⟨(𝑥 / (2↑𝑦)), ((𝑥 + 1) / (2↑𝑦))⟩)

Assertion

Ref	Expression
dyadmax	⊢ ((𝐴 ⊆ ran 𝐹 ∧ 𝐴 ≠ ∅) → ∃𝑧 ∈ 𝐴 ∀𝑤 ∈ 𝐴 (([,]‘𝑧) ⊆ ([,]‘𝑤) → 𝑧 = 𝑤))

Distinct variable groups:   𝑥,𝑦   𝑧,𝑤,𝑥,𝑦,𝐴   𝑤,𝐹,𝑥,𝑦,𝑧

Proof of Theorem dyadmax

Dummy variables 𝑐 𝑑 𝑎 𝑏 𝑛 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ltweuz 13966	. . . . 5 ⊢ < We (ℤ≥‘0)
2	1	a1i 11	. . . 4 ⊢ ((𝐴 ⊆ ran 𝐹 ∧ 𝐴 ≠ ∅) → < We (ℤ≥‘0))
3		nn0ex 12516	. . . . . 6 ⊢ ℕ0 ∈ V
4	3	rabex 5338	. . . . 5 ⊢ {𝑛 ∈ ℕ0 ∣ ∃𝑧 ∈ 𝐴 ∃𝑎 ∈ ℤ 𝑧 = (𝑎𝐹𝑛)} ∈ V
5	4	a1i 11	. . . 4 ⊢ ((𝐴 ⊆ ran 𝐹 ∧ 𝐴 ≠ ∅) → {𝑛 ∈ ℕ0 ∣ ∃𝑧 ∈ 𝐴 ∃𝑎 ∈ ℤ 𝑧 = (𝑎𝐹𝑛)} ∈ V)
6		ssrab2 4077	. . . . . 6 ⊢ {𝑛 ∈ ℕ0 ∣ ∃𝑧 ∈ 𝐴 ∃𝑎 ∈ ℤ 𝑧 = (𝑎𝐹𝑛)} ⊆ ℕ0
7		nn0uz 12902	. . . . . 6 ⊢ ℕ0 = (ℤ≥‘0)
8	6, 7	sseqtri 4018	. . . . 5 ⊢ {𝑛 ∈ ℕ0 ∣ ∃𝑧 ∈ 𝐴 ∃𝑎 ∈ ℤ 𝑧 = (𝑎𝐹𝑛)} ⊆ (ℤ≥‘0)
9	8	a1i 11	. . . 4 ⊢ ((𝐴 ⊆ ran 𝐹 ∧ 𝐴 ≠ ∅) → {𝑛 ∈ ℕ0 ∣ ∃𝑧 ∈ 𝐴 ∃𝑎 ∈ ℤ 𝑧 = (𝑎𝐹𝑛)} ⊆ (ℤ≥‘0))
10		id 22	. . . . . . 7 ⊢ (𝐴 ≠ ∅ → 𝐴 ≠ ∅)
11		dyadmbl.1	. . . . . . . . . . . 12 ⊢ 𝐹 = (𝑥 ∈ ℤ, 𝑦 ∈ ℕ0 ↦ ⟨(𝑥 / (2↑𝑦)), ((𝑥 + 1) / (2↑𝑦))⟩)
12	11	dyadf 25540	. . . . . . . . . . 11 ⊢ 𝐹:(ℤ × ℕ0)⟶( ≤ ∩ (ℝ × ℝ))
13		ffn 6727	. . . . . . . . . . 11 ⊢ (𝐹:(ℤ × ℕ0)⟶( ≤ ∩ (ℝ × ℝ)) → 𝐹 Fn (ℤ × ℕ0))
14		ovelrn 7603	. . . . . . . . . . 11 ⊢ (𝐹 Fn (ℤ × ℕ0) → (𝑧 ∈ ran 𝐹 ↔ ∃𝑎 ∈ ℤ ∃𝑛 ∈ ℕ0 𝑧 = (𝑎𝐹𝑛)))
15	12, 13, 14	mp2b 10	. . . . . . . . . 10 ⊢ (𝑧 ∈ ran 𝐹 ↔ ∃𝑎 ∈ ℤ ∃𝑛 ∈ ℕ0 𝑧 = (𝑎𝐹𝑛))
16		rexcom 3285	. . . . . . . . . 10 ⊢ (∃𝑎 ∈ ℤ ∃𝑛 ∈ ℕ0 𝑧 = (𝑎𝐹𝑛) ↔ ∃𝑛 ∈ ℕ0 ∃𝑎 ∈ ℤ 𝑧 = (𝑎𝐹𝑛))
17	15, 16	sylbb 218	. . . . . . . . 9 ⊢ (𝑧 ∈ ran 𝐹 → ∃𝑛 ∈ ℕ0 ∃𝑎 ∈ ℤ 𝑧 = (𝑎𝐹𝑛))
18	17	rgen 3060	. . . . . . . 8 ⊢ ∀𝑧 ∈ ran 𝐹∃𝑛 ∈ ℕ0 ∃𝑎 ∈ ℤ 𝑧 = (𝑎𝐹𝑛)
19		ssralv 4050	. . . . . . . 8 ⊢ (𝐴 ⊆ ran 𝐹 → (∀𝑧 ∈ ran 𝐹∃𝑛 ∈ ℕ0 ∃𝑎 ∈ ℤ 𝑧 = (𝑎𝐹𝑛) → ∀𝑧 ∈ 𝐴 ∃𝑛 ∈ ℕ0 ∃𝑎 ∈ ℤ 𝑧 = (𝑎𝐹𝑛)))
20	18, 19	mpi 20	. . . . . . 7 ⊢ (𝐴 ⊆ ran 𝐹 → ∀𝑧 ∈ 𝐴 ∃𝑛 ∈ ℕ0 ∃𝑎 ∈ ℤ 𝑧 = (𝑎𝐹𝑛))
21		r19.2z 4498	. . . . . . 7 ⊢ ((𝐴 ≠ ∅ ∧ ∀𝑧 ∈ 𝐴 ∃𝑛 ∈ ℕ0 ∃𝑎 ∈ ℤ 𝑧 = (𝑎𝐹𝑛)) → ∃𝑧 ∈ 𝐴 ∃𝑛 ∈ ℕ0 ∃𝑎 ∈ ℤ 𝑧 = (𝑎𝐹𝑛))
22	10, 20, 21	syl2anr 595	. . . . . 6 ⊢ ((𝐴 ⊆ ran 𝐹 ∧ 𝐴 ≠ ∅) → ∃𝑧 ∈ 𝐴 ∃𝑛 ∈ ℕ0 ∃𝑎 ∈ ℤ 𝑧 = (𝑎𝐹𝑛))
23		rexcom 3285	. . . . . 6 ⊢ (∃𝑧 ∈ 𝐴 ∃𝑛 ∈ ℕ0 ∃𝑎 ∈ ℤ 𝑧 = (𝑎𝐹𝑛) ↔ ∃𝑛 ∈ ℕ0 ∃𝑧 ∈ 𝐴 ∃𝑎 ∈ ℤ 𝑧 = (𝑎𝐹𝑛))
24	22, 23	sylib 217	. . . . 5 ⊢ ((𝐴 ⊆ ran 𝐹 ∧ 𝐴 ≠ ∅) → ∃𝑛 ∈ ℕ0 ∃𝑧 ∈ 𝐴 ∃𝑎 ∈ ℤ 𝑧 = (𝑎𝐹𝑛))
25		rabn0 4389	. . . . 5 ⊢ ({𝑛 ∈ ℕ0 ∣ ∃𝑧 ∈ 𝐴 ∃𝑎 ∈ ℤ 𝑧 = (𝑎𝐹𝑛)} ≠ ∅ ↔ ∃𝑛 ∈ ℕ0 ∃𝑧 ∈ 𝐴 ∃𝑎 ∈ ℤ 𝑧 = (𝑎𝐹𝑛))
26	24, 25	sylibr 233	. . . 4 ⊢ ((𝐴 ⊆ ran 𝐹 ∧ 𝐴 ≠ ∅) → {𝑛 ∈ ℕ0 ∣ ∃𝑧 ∈ 𝐴 ∃𝑎 ∈ ℤ 𝑧 = (𝑎𝐹𝑛)} ≠ ∅)
27		wereu 5678	. . . 4 ⊢ (( < We (ℤ≥‘0) ∧ ({𝑛 ∈ ℕ0 ∣ ∃𝑧 ∈ 𝐴 ∃𝑎 ∈ ℤ 𝑧 = (𝑎𝐹𝑛)} ∈ V ∧ {𝑛 ∈ ℕ0 ∣ ∃𝑧 ∈ 𝐴 ∃𝑎 ∈ ℤ 𝑧 = (𝑎𝐹𝑛)} ⊆ (ℤ≥‘0) ∧ {𝑛 ∈ ℕ0 ∣ ∃𝑧 ∈ 𝐴 ∃𝑎 ∈ ℤ 𝑧 = (𝑎𝐹𝑛)} ≠ ∅)) → ∃!𝑐 ∈ {𝑛 ∈ ℕ0 ∣ ∃𝑧 ∈ 𝐴 ∃𝑎 ∈ ℤ 𝑧 = (𝑎𝐹𝑛)}∀𝑑 ∈ {𝑛 ∈ ℕ0 ∣ ∃𝑧 ∈ 𝐴 ∃𝑎 ∈ ℤ 𝑧 = (𝑎𝐹𝑛)} ¬ 𝑑 < 𝑐)
28	2, 5, 9, 26, 27	syl13anc 1369	. . 3 ⊢ ((𝐴 ⊆ ran 𝐹 ∧ 𝐴 ≠ ∅) → ∃!𝑐 ∈ {𝑛 ∈ ℕ0 ∣ ∃𝑧 ∈ 𝐴 ∃𝑎 ∈ ℤ 𝑧 = (𝑎𝐹𝑛)}∀𝑑 ∈ {𝑛 ∈ ℕ0 ∣ ∃𝑧 ∈ 𝐴 ∃𝑎 ∈ ℤ 𝑧 = (𝑎𝐹𝑛)} ¬ 𝑑 < 𝑐)
29		reurex 3378	. . 3 ⊢ (∃!𝑐 ∈ {𝑛 ∈ ℕ0 ∣ ∃𝑧 ∈ 𝐴 ∃𝑎 ∈ ℤ 𝑧 = (𝑎𝐹𝑛)}∀𝑑 ∈ {𝑛 ∈ ℕ0 ∣ ∃𝑧 ∈ 𝐴 ∃𝑎 ∈ ℤ 𝑧 = (𝑎𝐹𝑛)} ¬ 𝑑 < 𝑐 → ∃𝑐 ∈ {𝑛 ∈ ℕ0 ∣ ∃𝑧 ∈ 𝐴 ∃𝑎 ∈ ℤ 𝑧 = (𝑎𝐹𝑛)}∀𝑑 ∈ {𝑛 ∈ ℕ0 ∣ ∃𝑧 ∈ 𝐴 ∃𝑎 ∈ ℤ 𝑧 = (𝑎𝐹𝑛)} ¬ 𝑑 < 𝑐)
30	28, 29	syl 17	. 2 ⊢ ((𝐴 ⊆ ran 𝐹 ∧ 𝐴 ≠ ∅) → ∃𝑐 ∈ {𝑛 ∈ ℕ0 ∣ ∃𝑧 ∈ 𝐴 ∃𝑎 ∈ ℤ 𝑧 = (𝑎𝐹𝑛)}∀𝑑 ∈ {𝑛 ∈ ℕ0 ∣ ∃𝑧 ∈ 𝐴 ∃𝑎 ∈ ℤ 𝑧 = (𝑎𝐹𝑛)} ¬ 𝑑 < 𝑐)
31		oveq2 7434	. . . . . . 7 ⊢ (𝑛 = 𝑐 → (𝑎𝐹𝑛) = (𝑎𝐹𝑐))
32	31	eqeq2d 2739	. . . . . 6 ⊢ (𝑛 = 𝑐 → (𝑧 = (𝑎𝐹𝑛) ↔ 𝑧 = (𝑎𝐹𝑐)))
33	32	2rexbidv 3217	. . . . 5 ⊢ (𝑛 = 𝑐 → (∃𝑧 ∈ 𝐴 ∃𝑎 ∈ ℤ 𝑧 = (𝑎𝐹𝑛) ↔ ∃𝑧 ∈ 𝐴 ∃𝑎 ∈ ℤ 𝑧 = (𝑎𝐹𝑐)))
34	33	elrab 3684	. . . 4 ⊢ (𝑐 ∈ {𝑛 ∈ ℕ0 ∣ ∃𝑧 ∈ 𝐴 ∃𝑎 ∈ ℤ 𝑧 = (𝑎𝐹𝑛)} ↔ (𝑐 ∈ ℕ0 ∧ ∃𝑧 ∈ 𝐴 ∃𝑎 ∈ ℤ 𝑧 = (𝑎𝐹𝑐)))
35		eqeq1 2732	. . . . . . . . . 10 ⊢ (𝑧 = 𝑤 → (𝑧 = (𝑎𝐹𝑛) ↔ 𝑤 = (𝑎𝐹𝑛)))
36		oveq1 7433	. . . . . . . . . . 11 ⊢ (𝑎 = 𝑏 → (𝑎𝐹𝑛) = (𝑏𝐹𝑛))
37	36	eqeq2d 2739	. . . . . . . . . 10 ⊢ (𝑎 = 𝑏 → (𝑤 = (𝑎𝐹𝑛) ↔ 𝑤 = (𝑏𝐹𝑛)))
38	35, 37	cbvrex2vw 3237	. . . . . . . . 9 ⊢ (∃𝑧 ∈ 𝐴 ∃𝑎 ∈ ℤ 𝑧 = (𝑎𝐹𝑛) ↔ ∃𝑤 ∈ 𝐴 ∃𝑏 ∈ ℤ 𝑤 = (𝑏𝐹𝑛))
39		oveq2 7434	. . . . . . . . . . 11 ⊢ (𝑛 = 𝑑 → (𝑏𝐹𝑛) = (𝑏𝐹𝑑))
40	39	eqeq2d 2739	. . . . . . . . . 10 ⊢ (𝑛 = 𝑑 → (𝑤 = (𝑏𝐹𝑛) ↔ 𝑤 = (𝑏𝐹𝑑)))
41	40	2rexbidv 3217	. . . . . . . . 9 ⊢ (𝑛 = 𝑑 → (∃𝑤 ∈ 𝐴 ∃𝑏 ∈ ℤ 𝑤 = (𝑏𝐹𝑛) ↔ ∃𝑤 ∈ 𝐴 ∃𝑏 ∈ ℤ 𝑤 = (𝑏𝐹𝑑)))
42	38, 41	bitrid 282	. . . . . . . 8 ⊢ (𝑛 = 𝑑 → (∃𝑧 ∈ 𝐴 ∃𝑎 ∈ ℤ 𝑧 = (𝑎𝐹𝑛) ↔ ∃𝑤 ∈ 𝐴 ∃𝑏 ∈ ℤ 𝑤 = (𝑏𝐹𝑑)))
43	42	ralrab 3690	. . . . . . 7 ⊢ (∀𝑑 ∈ {𝑛 ∈ ℕ0 ∣ ∃𝑧 ∈ 𝐴 ∃𝑎 ∈ ℤ 𝑧 = (𝑎𝐹𝑛)} ¬ 𝑑 < 𝑐 ↔ ∀𝑑 ∈ ℕ0 (∃𝑤 ∈ 𝐴 ∃𝑏 ∈ ℤ 𝑤 = (𝑏𝐹𝑑) → ¬ 𝑑 < 𝑐))
44		r19.23v 3180	. . . . . . . . . . . . . . . . 17 ⊢ (∀𝑤 ∈ 𝐴 (∃𝑏 ∈ ℤ 𝑤 = (𝑏𝐹𝑑) → ¬ 𝑑 < 𝑐) ↔ (∃𝑤 ∈ 𝐴 ∃𝑏 ∈ ℤ 𝑤 = (𝑏𝐹𝑑) → ¬ 𝑑 < 𝑐))
45	44	ralbii 3090	. . . . . . . . . . . . . . . 16 ⊢ (∀𝑑 ∈ ℕ0 ∀𝑤 ∈ 𝐴 (∃𝑏 ∈ ℤ 𝑤 = (𝑏𝐹𝑑) → ¬ 𝑑 < 𝑐) ↔ ∀𝑑 ∈ ℕ0 (∃𝑤 ∈ 𝐴 ∃𝑏 ∈ ℤ 𝑤 = (𝑏𝐹𝑑) → ¬ 𝑑 < 𝑐))
46		ralcom 3284	. . . . . . . . . . . . . . . 16 ⊢ (∀𝑑 ∈ ℕ0 ∀𝑤 ∈ 𝐴 (∃𝑏 ∈ ℤ 𝑤 = (𝑏𝐹𝑑) → ¬ 𝑑 < 𝑐) ↔ ∀𝑤 ∈ 𝐴 ∀𝑑 ∈ ℕ0 (∃𝑏 ∈ ℤ 𝑤 = (𝑏𝐹𝑑) → ¬ 𝑑 < 𝑐))
47	45, 46	bitr3i 276	. . . . . . . . . . . . . . 15 ⊢ (∀𝑑 ∈ ℕ0 (∃𝑤 ∈ 𝐴 ∃𝑏 ∈ ℤ 𝑤 = (𝑏𝐹𝑑) → ¬ 𝑑 < 𝑐) ↔ ∀𝑤 ∈ 𝐴 ∀𝑑 ∈ ℕ0 (∃𝑏 ∈ ℤ 𝑤 = (𝑏𝐹𝑑) → ¬ 𝑑 < 𝑐))
48		simplll 773	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((((𝐴 ⊆ ran 𝐹 ∧ 𝐴 ≠ ∅) ∧ 𝑐 ∈ ℕ0) ∧ (𝑧 ∈ 𝐴 ∧ 𝑎 ∈ ℤ)) → 𝐴 ⊆ ran 𝐹)
49	48	sselda 3982	. . . . . . . . . . . . . . . . . . 19 ⊢ (((((𝐴 ⊆ ran 𝐹 ∧ 𝐴 ≠ ∅) ∧ 𝑐 ∈ ℕ0) ∧ (𝑧 ∈ 𝐴 ∧ 𝑎 ∈ ℤ)) ∧ 𝑤 ∈ 𝐴) → 𝑤 ∈ ran 𝐹)
50		ovelrn 7603	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝐹 Fn (ℤ × ℕ0) → (𝑤 ∈ ran 𝐹 ↔ ∃𝑏 ∈ ℤ ∃𝑑 ∈ ℕ0 𝑤 = (𝑏𝐹𝑑)))
51	12, 13, 50	mp2b 10	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑤 ∈ ran 𝐹 ↔ ∃𝑏 ∈ ℤ ∃𝑑 ∈ ℕ0 𝑤 = (𝑏𝐹𝑑))
52	49, 51	sylib 217	. . . . . . . . . . . . . . . . . 18 ⊢ (((((𝐴 ⊆ ran 𝐹 ∧ 𝐴 ≠ ∅) ∧ 𝑐 ∈ ℕ0) ∧ (𝑧 ∈ 𝐴 ∧ 𝑎 ∈ ℤ)) ∧ 𝑤 ∈ 𝐴) → ∃𝑏 ∈ ℤ ∃𝑑 ∈ ℕ0 𝑤 = (𝑏𝐹𝑑))
53		rexcom 3285	. . . . . . . . . . . . . . . . . . 19 ⊢ (∃𝑏 ∈ ℤ ∃𝑑 ∈ ℕ0 𝑤 = (𝑏𝐹𝑑) ↔ ∃𝑑 ∈ ℕ0 ∃𝑏 ∈ ℤ 𝑤 = (𝑏𝐹𝑑))
54		r19.29 3111	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((∀𝑑 ∈ ℕ0 (∃𝑏 ∈ ℤ 𝑤 = (𝑏𝐹𝑑) → ¬ 𝑑 < 𝑐) ∧ ∃𝑑 ∈ ℕ0 ∃𝑏 ∈ ℤ 𝑤 = (𝑏𝐹𝑑)) → ∃𝑑 ∈ ℕ0 ((∃𝑏 ∈ ℤ 𝑤 = (𝑏𝐹𝑑) → ¬ 𝑑 < 𝑐) ∧ ∃𝑏 ∈ ℤ 𝑤 = (𝑏𝐹𝑑)))
55	54	expcom 412	. . . . . . . . . . . . . . . . . . 19 ⊢ (∃𝑑 ∈ ℕ0 ∃𝑏 ∈ ℤ 𝑤 = (𝑏𝐹𝑑) → (∀𝑑 ∈ ℕ0 (∃𝑏 ∈ ℤ 𝑤 = (𝑏𝐹𝑑) → ¬ 𝑑 < 𝑐) → ∃𝑑 ∈ ℕ0 ((∃𝑏 ∈ ℤ 𝑤 = (𝑏𝐹𝑑) → ¬ 𝑑 < 𝑐) ∧ ∃𝑏 ∈ ℤ 𝑤 = (𝑏𝐹𝑑))))
56	53, 55	sylbi 216	. . . . . . . . . . . . . . . . . 18 ⊢ (∃𝑏 ∈ ℤ ∃𝑑 ∈ ℕ0 𝑤 = (𝑏𝐹𝑑) → (∀𝑑 ∈ ℕ0 (∃𝑏 ∈ ℤ 𝑤 = (𝑏𝐹𝑑) → ¬ 𝑑 < 𝑐) → ∃𝑑 ∈ ℕ0 ((∃𝑏 ∈ ℤ 𝑤 = (𝑏𝐹𝑑) → ¬ 𝑑 < 𝑐) ∧ ∃𝑏 ∈ ℤ 𝑤 = (𝑏𝐹𝑑))))
57	52, 56	syl 17	. . . . . . . . . . . . . . . . 17 ⊢ (((((𝐴 ⊆ ran 𝐹 ∧ 𝐴 ≠ ∅) ∧ 𝑐 ∈ ℕ0) ∧ (𝑧 ∈ 𝐴 ∧ 𝑎 ∈ ℤ)) ∧ 𝑤 ∈ 𝐴) → (∀𝑑 ∈ ℕ0 (∃𝑏 ∈ ℤ 𝑤 = (𝑏𝐹𝑑) → ¬ 𝑑 < 𝑐) → ∃𝑑 ∈ ℕ0 ((∃𝑏 ∈ ℤ 𝑤 = (𝑏𝐹𝑑) → ¬ 𝑑 < 𝑐) ∧ ∃𝑏 ∈ ℤ 𝑤 = (𝑏𝐹𝑑))))
58		simplrr 776	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (((((𝐴 ⊆ ran 𝐹 ∧ 𝐴 ≠ ∅) ∧ 𝑐 ∈ ℕ0) ∧ (𝑧 ∈ 𝐴 ∧ 𝑎 ∈ ℤ)) ∧ 𝑤 ∈ 𝐴) → 𝑎 ∈ ℤ)
59	58	ad2antrr 724	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (((((((𝐴 ⊆ ran 𝐹 ∧ 𝐴 ≠ ∅) ∧ 𝑐 ∈ ℕ0) ∧ (𝑧 ∈ 𝐴 ∧ 𝑎 ∈ ℤ)) ∧ 𝑤 ∈ 𝐴) ∧ (𝑑 ∈ ℕ0 ∧ 𝑏 ∈ ℤ)) ∧ (¬ 𝑑 < 𝑐 ∧ ([,]‘(𝑎𝐹𝑐)) ⊆ ([,]‘(𝑏𝐹𝑑)))) → 𝑎 ∈ ℤ)
60		simplrr 776	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (((((((𝐴 ⊆ ran 𝐹 ∧ 𝐴 ≠ ∅) ∧ 𝑐 ∈ ℕ0) ∧ (𝑧 ∈ 𝐴 ∧ 𝑎 ∈ ℤ)) ∧ 𝑤 ∈ 𝐴) ∧ (𝑑 ∈ ℕ0 ∧ 𝑏 ∈ ℤ)) ∧ (¬ 𝑑 < 𝑐 ∧ ([,]‘(𝑎𝐹𝑐)) ⊆ ([,]‘(𝑏𝐹𝑑)))) → 𝑏 ∈ ℤ)
61		simp-5r 784	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (((((((𝐴 ⊆ ran 𝐹 ∧ 𝐴 ≠ ∅) ∧ 𝑐 ∈ ℕ0) ∧ (𝑧 ∈ 𝐴 ∧ 𝑎 ∈ ℤ)) ∧ 𝑤 ∈ 𝐴) ∧ (𝑑 ∈ ℕ0 ∧ 𝑏 ∈ ℤ)) ∧ (¬ 𝑑 < 𝑐 ∧ ([,]‘(𝑎𝐹𝑐)) ⊆ ([,]‘(𝑏𝐹𝑑)))) → 𝑐 ∈ ℕ0)
62		simplrl 775	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (((((((𝐴 ⊆ ran 𝐹 ∧ 𝐴 ≠ ∅) ∧ 𝑐 ∈ ℕ0) ∧ (𝑧 ∈ 𝐴 ∧ 𝑎 ∈ ℤ)) ∧ 𝑤 ∈ 𝐴) ∧ (𝑑 ∈ ℕ0 ∧ 𝑏 ∈ ℤ)) ∧ (¬ 𝑑 < 𝑐 ∧ ([,]‘(𝑎𝐹𝑐)) ⊆ ([,]‘(𝑏𝐹𝑑)))) → 𝑑 ∈ ℕ0)
63		simprl 769	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (((((((𝐴 ⊆ ran 𝐹 ∧ 𝐴 ≠ ∅) ∧ 𝑐 ∈ ℕ0) ∧ (𝑧 ∈ 𝐴 ∧ 𝑎 ∈ ℤ)) ∧ 𝑤 ∈ 𝐴) ∧ (𝑑 ∈ ℕ0 ∧ 𝑏 ∈ ℤ)) ∧ (¬ 𝑑 < 𝑐 ∧ ([,]‘(𝑎𝐹𝑐)) ⊆ ([,]‘(𝑏𝐹𝑑)))) → ¬ 𝑑 < 𝑐)
64		simprr 771	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (((((((𝐴 ⊆ ran 𝐹 ∧ 𝐴 ≠ ∅) ∧ 𝑐 ∈ ℕ0) ∧ (𝑧 ∈ 𝐴 ∧ 𝑎 ∈ ℤ)) ∧ 𝑤 ∈ 𝐴) ∧ (𝑑 ∈ ℕ0 ∧ 𝑏 ∈ ℤ)) ∧ (¬ 𝑑 < 𝑐 ∧ ([,]‘(𝑎𝐹𝑐)) ⊆ ([,]‘(𝑏𝐹𝑑)))) → ([,]‘(𝑎𝐹𝑐)) ⊆ ([,]‘(𝑏𝐹𝑑)))
65	11, 59, 60, 61, 62, 63, 64	dyadmaxlem 25546	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (((((((𝐴 ⊆ ran 𝐹 ∧ 𝐴 ≠ ∅) ∧ 𝑐 ∈ ℕ0) ∧ (𝑧 ∈ 𝐴 ∧ 𝑎 ∈ ℤ)) ∧ 𝑤 ∈ 𝐴) ∧ (𝑑 ∈ ℕ0 ∧ 𝑏 ∈ ℤ)) ∧ (¬ 𝑑 < 𝑐 ∧ ([,]‘(𝑎𝐹𝑐)) ⊆ ([,]‘(𝑏𝐹𝑑)))) → (𝑎 = 𝑏 ∧ 𝑐 = 𝑑))
66		oveq12 7435	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ ((𝑎 = 𝑏 ∧ 𝑐 = 𝑑) → (𝑎𝐹𝑐) = (𝑏𝐹𝑑))
67	65, 66	syl 17	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (((((((𝐴 ⊆ ran 𝐹 ∧ 𝐴 ≠ ∅) ∧ 𝑐 ∈ ℕ0) ∧ (𝑧 ∈ 𝐴 ∧ 𝑎 ∈ ℤ)) ∧ 𝑤 ∈ 𝐴) ∧ (𝑑 ∈ ℕ0 ∧ 𝑏 ∈ ℤ)) ∧ (¬ 𝑑 < 𝑐 ∧ ([,]‘(𝑎𝐹𝑐)) ⊆ ([,]‘(𝑏𝐹𝑑)))) → (𝑎𝐹𝑐) = (𝑏𝐹𝑑))
68	67	exp32 419	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((((((𝐴 ⊆ ran 𝐹 ∧ 𝐴 ≠ ∅) ∧ 𝑐 ∈ ℕ0) ∧ (𝑧 ∈ 𝐴 ∧ 𝑎 ∈ ℤ)) ∧ 𝑤 ∈ 𝐴) ∧ (𝑑 ∈ ℕ0 ∧ 𝑏 ∈ ℤ)) → (¬ 𝑑 < 𝑐 → (([,]‘(𝑎𝐹𝑐)) ⊆ ([,]‘(𝑏𝐹𝑑)) → (𝑎𝐹𝑐) = (𝑏𝐹𝑑))))
69		fveq2 6902	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (𝑤 = (𝑏𝐹𝑑) → ([,]‘𝑤) = ([,]‘(𝑏𝐹𝑑)))
70	69	sseq2d 4014	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (𝑤 = (𝑏𝐹𝑑) → (([,]‘(𝑎𝐹𝑐)) ⊆ ([,]‘𝑤) ↔ ([,]‘(𝑎𝐹𝑐)) ⊆ ([,]‘(𝑏𝐹𝑑))))
71		eqeq2 2740	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (𝑤 = (𝑏𝐹𝑑) → ((𝑎𝐹𝑐) = 𝑤 ↔ (𝑎𝐹𝑐) = (𝑏𝐹𝑑)))
72	70, 71	imbi12d 343	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝑤 = (𝑏𝐹𝑑) → ((([,]‘(𝑎𝐹𝑐)) ⊆ ([,]‘𝑤) → (𝑎𝐹𝑐) = 𝑤) ↔ (([,]‘(𝑎𝐹𝑐)) ⊆ ([,]‘(𝑏𝐹𝑑)) → (𝑎𝐹𝑐) = (𝑏𝐹𝑑))))
73	72	imbi2d 339	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝑤 = (𝑏𝐹𝑑) → ((¬ 𝑑 < 𝑐 → (([,]‘(𝑎𝐹𝑐)) ⊆ ([,]‘𝑤) → (𝑎𝐹𝑐) = 𝑤)) ↔ (¬ 𝑑 < 𝑐 → (([,]‘(𝑎𝐹𝑐)) ⊆ ([,]‘(𝑏𝐹𝑑)) → (𝑎𝐹𝑐) = (𝑏𝐹𝑑)))))
74	68, 73	syl5ibrcom 246	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((((((𝐴 ⊆ ran 𝐹 ∧ 𝐴 ≠ ∅) ∧ 𝑐 ∈ ℕ0) ∧ (𝑧 ∈ 𝐴 ∧ 𝑎 ∈ ℤ)) ∧ 𝑤 ∈ 𝐴) ∧ (𝑑 ∈ ℕ0 ∧ 𝑏 ∈ ℤ)) → (𝑤 = (𝑏𝐹𝑑) → (¬ 𝑑 < 𝑐 → (([,]‘(𝑎𝐹𝑐)) ⊆ ([,]‘𝑤) → (𝑎𝐹𝑐) = 𝑤))))
75	74	anassrs 466	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((((((𝐴 ⊆ ran 𝐹 ∧ 𝐴 ≠ ∅) ∧ 𝑐 ∈ ℕ0) ∧ (𝑧 ∈ 𝐴 ∧ 𝑎 ∈ ℤ)) ∧ 𝑤 ∈ 𝐴) ∧ 𝑑 ∈ ℕ0) ∧ 𝑏 ∈ ℤ) → (𝑤 = (𝑏𝐹𝑑) → (¬ 𝑑 < 𝑐 → (([,]‘(𝑎𝐹𝑐)) ⊆ ([,]‘𝑤) → (𝑎𝐹𝑐) = 𝑤))))
76	75	rexlimdva 3152	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((((((𝐴 ⊆ ran 𝐹 ∧ 𝐴 ≠ ∅) ∧ 𝑐 ∈ ℕ0) ∧ (𝑧 ∈ 𝐴 ∧ 𝑎 ∈ ℤ)) ∧ 𝑤 ∈ 𝐴) ∧ 𝑑 ∈ ℕ0) → (∃𝑏 ∈ ℤ 𝑤 = (𝑏𝐹𝑑) → (¬ 𝑑 < 𝑐 → (([,]‘(𝑎𝐹𝑐)) ⊆ ([,]‘𝑤) → (𝑎𝐹𝑐) = 𝑤))))
77	76	a2d 29	. . . . . . . . . . . . . . . . . . 19 ⊢ ((((((𝐴 ⊆ ran 𝐹 ∧ 𝐴 ≠ ∅) ∧ 𝑐 ∈ ℕ0) ∧ (𝑧 ∈ 𝐴 ∧ 𝑎 ∈ ℤ)) ∧ 𝑤 ∈ 𝐴) ∧ 𝑑 ∈ ℕ0) → ((∃𝑏 ∈ ℤ 𝑤 = (𝑏𝐹𝑑) → ¬ 𝑑 < 𝑐) → (∃𝑏 ∈ ℤ 𝑤 = (𝑏𝐹𝑑) → (([,]‘(𝑎𝐹𝑐)) ⊆ ([,]‘𝑤) → (𝑎𝐹𝑐) = 𝑤))))
78	77	impd 409	. . . . . . . . . . . . . . . . . 18 ⊢ ((((((𝐴 ⊆ ran 𝐹 ∧ 𝐴 ≠ ∅) ∧ 𝑐 ∈ ℕ0) ∧ (𝑧 ∈ 𝐴 ∧ 𝑎 ∈ ℤ)) ∧ 𝑤 ∈ 𝐴) ∧ 𝑑 ∈ ℕ0) → (((∃𝑏 ∈ ℤ 𝑤 = (𝑏𝐹𝑑) → ¬ 𝑑 < 𝑐) ∧ ∃𝑏 ∈ ℤ 𝑤 = (𝑏𝐹𝑑)) → (([,]‘(𝑎𝐹𝑐)) ⊆ ([,]‘𝑤) → (𝑎𝐹𝑐) = 𝑤)))
79	78	rexlimdva 3152	. . . . . . . . . . . . . . . . 17 ⊢ (((((𝐴 ⊆ ran 𝐹 ∧ 𝐴 ≠ ∅) ∧ 𝑐 ∈ ℕ0) ∧ (𝑧 ∈ 𝐴 ∧ 𝑎 ∈ ℤ)) ∧ 𝑤 ∈ 𝐴) → (∃𝑑 ∈ ℕ0 ((∃𝑏 ∈ ℤ 𝑤 = (𝑏𝐹𝑑) → ¬ 𝑑 < 𝑐) ∧ ∃𝑏 ∈ ℤ 𝑤 = (𝑏𝐹𝑑)) → (([,]‘(𝑎𝐹𝑐)) ⊆ ([,]‘𝑤) → (𝑎𝐹𝑐) = 𝑤)))
80	57, 79	syld 47	. . . . . . . . . . . . . . . 16 ⊢ (((((𝐴 ⊆ ran 𝐹 ∧ 𝐴 ≠ ∅) ∧ 𝑐 ∈ ℕ0) ∧ (𝑧 ∈ 𝐴 ∧ 𝑎 ∈ ℤ)) ∧ 𝑤 ∈ 𝐴) → (∀𝑑 ∈ ℕ0 (∃𝑏 ∈ ℤ 𝑤 = (𝑏𝐹𝑑) → ¬ 𝑑 < 𝑐) → (([,]‘(𝑎𝐹𝑐)) ⊆ ([,]‘𝑤) → (𝑎𝐹𝑐) = 𝑤)))
81	80	ralimdva 3164	. . . . . . . . . . . . . . 15 ⊢ ((((𝐴 ⊆ ran 𝐹 ∧ 𝐴 ≠ ∅) ∧ 𝑐 ∈ ℕ0) ∧ (𝑧 ∈ 𝐴 ∧ 𝑎 ∈ ℤ)) → (∀𝑤 ∈ 𝐴 ∀𝑑 ∈ ℕ0 (∃𝑏 ∈ ℤ 𝑤 = (𝑏𝐹𝑑) → ¬ 𝑑 < 𝑐) → ∀𝑤 ∈ 𝐴 (([,]‘(𝑎𝐹𝑐)) ⊆ ([,]‘𝑤) → (𝑎𝐹𝑐) = 𝑤)))
82	47, 81	biimtrid 241	. . . . . . . . . . . . . 14 ⊢ ((((𝐴 ⊆ ran 𝐹 ∧ 𝐴 ≠ ∅) ∧ 𝑐 ∈ ℕ0) ∧ (𝑧 ∈ 𝐴 ∧ 𝑎 ∈ ℤ)) → (∀𝑑 ∈ ℕ0 (∃𝑤 ∈ 𝐴 ∃𝑏 ∈ ℤ 𝑤 = (𝑏𝐹𝑑) → ¬ 𝑑 < 𝑐) → ∀𝑤 ∈ 𝐴 (([,]‘(𝑎𝐹𝑐)) ⊆ ([,]‘𝑤) → (𝑎𝐹𝑐) = 𝑤)))
83	82	imp 405	. . . . . . . . . . . . 13 ⊢ (((((𝐴 ⊆ ran 𝐹 ∧ 𝐴 ≠ ∅) ∧ 𝑐 ∈ ℕ0) ∧ (𝑧 ∈ 𝐴 ∧ 𝑎 ∈ ℤ)) ∧ ∀𝑑 ∈ ℕ0 (∃𝑤 ∈ 𝐴 ∃𝑏 ∈ ℤ 𝑤 = (𝑏𝐹𝑑) → ¬ 𝑑 < 𝑐)) → ∀𝑤 ∈ 𝐴 (([,]‘(𝑎𝐹𝑐)) ⊆ ([,]‘𝑤) → (𝑎𝐹𝑐) = 𝑤))
84	83	an32s 650	. . . . . . . . . . . 12 ⊢ (((((𝐴 ⊆ ran 𝐹 ∧ 𝐴 ≠ ∅) ∧ 𝑐 ∈ ℕ0) ∧ ∀𝑑 ∈ ℕ0 (∃𝑤 ∈ 𝐴 ∃𝑏 ∈ ℤ 𝑤 = (𝑏𝐹𝑑) → ¬ 𝑑 < 𝑐)) ∧ (𝑧 ∈ 𝐴 ∧ 𝑎 ∈ ℤ)) → ∀𝑤 ∈ 𝐴 (([,]‘(𝑎𝐹𝑐)) ⊆ ([,]‘𝑤) → (𝑎𝐹𝑐) = 𝑤))
85		fveq2 6902	. . . . . . . . . . . . . . 15 ⊢ (𝑧 = (𝑎𝐹𝑐) → ([,]‘𝑧) = ([,]‘(𝑎𝐹𝑐)))
86	85	sseq1d 4013	. . . . . . . . . . . . . 14 ⊢ (𝑧 = (𝑎𝐹𝑐) → (([,]‘𝑧) ⊆ ([,]‘𝑤) ↔ ([,]‘(𝑎𝐹𝑐)) ⊆ ([,]‘𝑤)))
87		eqeq1 2732	. . . . . . . . . . . . . 14 ⊢ (𝑧 = (𝑎𝐹𝑐) → (𝑧 = 𝑤 ↔ (𝑎𝐹𝑐) = 𝑤))
88	86, 87	imbi12d 343	. . . . . . . . . . . . 13 ⊢ (𝑧 = (𝑎𝐹𝑐) → ((([,]‘𝑧) ⊆ ([,]‘𝑤) → 𝑧 = 𝑤) ↔ (([,]‘(𝑎𝐹𝑐)) ⊆ ([,]‘𝑤) → (𝑎𝐹𝑐) = 𝑤)))
89	88	ralbidv 3175	. . . . . . . . . . . 12 ⊢ (𝑧 = (𝑎𝐹𝑐) → (∀𝑤 ∈ 𝐴 (([,]‘𝑧) ⊆ ([,]‘𝑤) → 𝑧 = 𝑤) ↔ ∀𝑤 ∈ 𝐴 (([,]‘(𝑎𝐹𝑐)) ⊆ ([,]‘𝑤) → (𝑎𝐹𝑐) = 𝑤)))
90	84, 89	syl5ibrcom 246	. . . . . . . . . . 11 ⊢ (((((𝐴 ⊆ ran 𝐹 ∧ 𝐴 ≠ ∅) ∧ 𝑐 ∈ ℕ0) ∧ ∀𝑑 ∈ ℕ0 (∃𝑤 ∈ 𝐴 ∃𝑏 ∈ ℤ 𝑤 = (𝑏𝐹𝑑) → ¬ 𝑑 < 𝑐)) ∧ (𝑧 ∈ 𝐴 ∧ 𝑎 ∈ ℤ)) → (𝑧 = (𝑎𝐹𝑐) → ∀𝑤 ∈ 𝐴 (([,]‘𝑧) ⊆ ([,]‘𝑤) → 𝑧 = 𝑤)))
91	90	anassrs 466	. . . . . . . . . 10 ⊢ ((((((𝐴 ⊆ ran 𝐹 ∧ 𝐴 ≠ ∅) ∧ 𝑐 ∈ ℕ0) ∧ ∀𝑑 ∈ ℕ0 (∃𝑤 ∈ 𝐴 ∃𝑏 ∈ ℤ 𝑤 = (𝑏𝐹𝑑) → ¬ 𝑑 < 𝑐)) ∧ 𝑧 ∈ 𝐴) ∧ 𝑎 ∈ ℤ) → (𝑧 = (𝑎𝐹𝑐) → ∀𝑤 ∈ 𝐴 (([,]‘𝑧) ⊆ ([,]‘𝑤) → 𝑧 = 𝑤)))
92	91	rexlimdva 3152	. . . . . . . . 9 ⊢ (((((𝐴 ⊆ ran 𝐹 ∧ 𝐴 ≠ ∅) ∧ 𝑐 ∈ ℕ0) ∧ ∀𝑑 ∈ ℕ0 (∃𝑤 ∈ 𝐴 ∃𝑏 ∈ ℤ 𝑤 = (𝑏𝐹𝑑) → ¬ 𝑑 < 𝑐)) ∧ 𝑧 ∈ 𝐴) → (∃𝑎 ∈ ℤ 𝑧 = (𝑎𝐹𝑐) → ∀𝑤 ∈ 𝐴 (([,]‘𝑧) ⊆ ([,]‘𝑤) → 𝑧 = 𝑤)))
93	92	reximdva 3165	. . . . . . . 8 ⊢ ((((𝐴 ⊆ ran 𝐹 ∧ 𝐴 ≠ ∅) ∧ 𝑐 ∈ ℕ0) ∧ ∀𝑑 ∈ ℕ0 (∃𝑤 ∈ 𝐴 ∃𝑏 ∈ ℤ 𝑤 = (𝑏𝐹𝑑) → ¬ 𝑑 < 𝑐)) → (∃𝑧 ∈ 𝐴 ∃𝑎 ∈ ℤ 𝑧 = (𝑎𝐹𝑐) → ∃𝑧 ∈ 𝐴 ∀𝑤 ∈ 𝐴 (([,]‘𝑧) ⊆ ([,]‘𝑤) → 𝑧 = 𝑤)))
94	93	ex 411	. . . . . . 7 ⊢ (((𝐴 ⊆ ran 𝐹 ∧ 𝐴 ≠ ∅) ∧ 𝑐 ∈ ℕ0) → (∀𝑑 ∈ ℕ0 (∃𝑤 ∈ 𝐴 ∃𝑏 ∈ ℤ 𝑤 = (𝑏𝐹𝑑) → ¬ 𝑑 < 𝑐) → (∃𝑧 ∈ 𝐴 ∃𝑎 ∈ ℤ 𝑧 = (𝑎𝐹𝑐) → ∃𝑧 ∈ 𝐴 ∀𝑤 ∈ 𝐴 (([,]‘𝑧) ⊆ ([,]‘𝑤) → 𝑧 = 𝑤))))
95	43, 94	biimtrid 241	. . . . . 6 ⊢ (((𝐴 ⊆ ran 𝐹 ∧ 𝐴 ≠ ∅) ∧ 𝑐 ∈ ℕ0) → (∀𝑑 ∈ {𝑛 ∈ ℕ0 ∣ ∃𝑧 ∈ 𝐴 ∃𝑎 ∈ ℤ 𝑧 = (𝑎𝐹𝑛)} ¬ 𝑑 < 𝑐 → (∃𝑧 ∈ 𝐴 ∃𝑎 ∈ ℤ 𝑧 = (𝑎𝐹𝑐) → ∃𝑧 ∈ 𝐴 ∀𝑤 ∈ 𝐴 (([,]‘𝑧) ⊆ ([,]‘𝑤) → 𝑧 = 𝑤))))
96	95	com23 86	. . . . 5 ⊢ (((𝐴 ⊆ ran 𝐹 ∧ 𝐴 ≠ ∅) ∧ 𝑐 ∈ ℕ0) → (∃𝑧 ∈ 𝐴 ∃𝑎 ∈ ℤ 𝑧 = (𝑎𝐹𝑐) → (∀𝑑 ∈ {𝑛 ∈ ℕ0 ∣ ∃𝑧 ∈ 𝐴 ∃𝑎 ∈ ℤ 𝑧 = (𝑎𝐹𝑛)} ¬ 𝑑 < 𝑐 → ∃𝑧 ∈ 𝐴 ∀𝑤 ∈ 𝐴 (([,]‘𝑧) ⊆ ([,]‘𝑤) → 𝑧 = 𝑤))))
97	96	expimpd 452	. . . 4 ⊢ ((𝐴 ⊆ ran 𝐹 ∧ 𝐴 ≠ ∅) → ((𝑐 ∈ ℕ0 ∧ ∃𝑧 ∈ 𝐴 ∃𝑎 ∈ ℤ 𝑧 = (𝑎𝐹𝑐)) → (∀𝑑 ∈ {𝑛 ∈ ℕ0 ∣ ∃𝑧 ∈ 𝐴 ∃𝑎 ∈ ℤ 𝑧 = (𝑎𝐹𝑛)} ¬ 𝑑 < 𝑐 → ∃𝑧 ∈ 𝐴 ∀𝑤 ∈ 𝐴 (([,]‘𝑧) ⊆ ([,]‘𝑤) → 𝑧 = 𝑤))))
98	34, 97	biimtrid 241	. . 3 ⊢ ((𝐴 ⊆ ran 𝐹 ∧ 𝐴 ≠ ∅) → (𝑐 ∈ {𝑛 ∈ ℕ0 ∣ ∃𝑧 ∈ 𝐴 ∃𝑎 ∈ ℤ 𝑧 = (𝑎𝐹𝑛)} → (∀𝑑 ∈ {𝑛 ∈ ℕ0 ∣ ∃𝑧 ∈ 𝐴 ∃𝑎 ∈ ℤ 𝑧 = (𝑎𝐹𝑛)} ¬ 𝑑 < 𝑐 → ∃𝑧 ∈ 𝐴 ∀𝑤 ∈ 𝐴 (([,]‘𝑧) ⊆ ([,]‘𝑤) → 𝑧 = 𝑤))))
99	98	rexlimdv 3150	. 2 ⊢ ((𝐴 ⊆ ran 𝐹 ∧ 𝐴 ≠ ∅) → (∃𝑐 ∈ {𝑛 ∈ ℕ0 ∣ ∃𝑧 ∈ 𝐴 ∃𝑎 ∈ ℤ 𝑧 = (𝑎𝐹𝑛)}∀𝑑 ∈ {𝑛 ∈ ℕ0 ∣ ∃𝑧 ∈ 𝐴 ∃𝑎 ∈ ℤ 𝑧 = (𝑎𝐹𝑛)} ¬ 𝑑 < 𝑐 → ∃𝑧 ∈ 𝐴 ∀𝑤 ∈ 𝐴 (([,]‘𝑧) ⊆ ([,]‘𝑤) → 𝑧 = 𝑤)))
100	30, 99	mpd 15	1 ⊢ ((𝐴 ⊆ ran 𝐹 ∧ 𝐴 ≠ ∅) → ∃𝑧 ∈ 𝐴 ∀𝑤 ∈ 𝐴 (([,]‘𝑧) ⊆ ([,]‘𝑤) → 𝑧 = 𝑤))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 205   ∧ wa 394   = wceq 1533   ∈ wcel 2098   ≠ wne 2937  ∀wral 3058  ∃wrex 3067  ∃!wreu 3372  {crab 3430  Vcvv 3473   ∩ cin 3948   ⊆ wss 3949  ∅c0 4326  ⟨cop 4638   class class class wbr 5152   We wwe 5636   × cxp 5680  ran crn 5683   Fn wfn 6548  ⟶wf 6549  ‘cfv 6553  (class class class)co 7426   ∈ cmpo 7428  ℝcr 11145  0cc0 11146  1c1 11147   + caddc 11149   < clt 11286   ≤ cle 11287   / cdiv 11909  2c2 12305  ℕ₀cn0 12510  ℤcz 12596  ℤ_≥cuz 12860  [,]cicc 13367  ↑cexp 14066

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-10 2129  ax-11 2146  ax-12 2166  ax-ext 2699  ax-rep 5289  ax-sep 5303  ax-nul 5310  ax-pow 5369  ax-pr 5433  ax-un 7746  ax-inf2 9672  ax-cnex 11202  ax-resscn 11203  ax-1cn 11204  ax-icn 11205  ax-addcl 11206  ax-addrcl 11207  ax-mulcl 11208  ax-mulrcl 11209  ax-mulcom 11210  ax-addass 11211  ax-mulass 11212  ax-distr 11213  ax-i2m1 11214  ax-1ne0 11215  ax-1rid 11216  ax-rnegex 11217  ax-rrecex 11218  ax-cnre 11219  ax-pre-lttri 11220  ax-pre-lttrn 11221  ax-pre-ltadd 11222  ax-pre-mulgt0 11223  ax-pre-sup 11224

This theorem depends on definitions:  df-bi 206  df-an 395  df-or 846  df-3or 1085  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-nf 1778  df-sb 2060  df-mo 2529  df-eu 2558  df-clab 2706  df-cleq 2720  df-clel 2806  df-nfc 2881  df-ne 2938  df-nel 3044  df-ral 3059  df-rex 3068  df-rmo 3374  df-reu 3375  df-rab 3431  df-v 3475  df-sbc 3779  df-csb 3895  df-dif 3952  df-un 3954  df-in 3956  df-ss 3966  df-pss 3968  df-nul 4327  df-if 4533  df-pw 4608  df-sn 4633  df-pr 4635  df-op 4639  df-uni 4913  df-int 4954  df-iun 5002  df-br 5153  df-opab 5215  df-mpt 5236  df-tr 5270  df-id 5580  df-eprel 5586  df-po 5594  df-so 5595  df-fr 5637  df-se 5638  df-we 5639  df-xp 5688  df-rel 5689  df-cnv 5690  df-co 5691  df-dm 5692  df-rn 5693  df-res 5694  df-ima 5695  df-pred 6310  df-ord 6377  df-on 6378  df-lim 6379  df-suc 6380  df-iota 6505  df-fun 6555  df-fn 6556  df-f 6557  df-f1 6558  df-fo 6559  df-f1o 6560  df-fv 6561  df-isom 6562  df-riota 7382  df-ov 7429  df-oprab 7430  df-mpo 7431  df-om 7877  df-1st 7999  df-2nd 8000  df-frecs 8293  df-wrecs 8324  df-recs 8398  df-rdg 8437  df-1o 8493  df-er 8731  df-map 8853  df-en 8971  df-dom 8972  df-sdom 8973  df-fin 8974  df-fi 9442  df-sup 9473  df-inf 9474  df-oi 9541  df-card 9970  df-pnf 11288  df-mnf 11289  df-xr 11290  df-ltxr 11291  df-le 11292  df-sub 11484  df-neg 11485  df-div 11910  df-nn 12251  df-2 12313  df-3 12314  df-n0 12511  df-z 12597  df-uz 12861  df-q 12971  df-rp 13015  df-xneg 13132  df-xadd 13133  df-xmul 13134  df-ioo 13368  df-ico 13370  df-icc 13371  df-fz 13525  df-fzo 13668  df-seq 14007  df-exp 14067  df-hash 14330  df-cj 15086  df-re 15087  df-im 15088  df-sqrt 15222  df-abs 15223  df-clim 15472  df-sum 15673  df-rest 17411  df-topgen 17432  df-psmet 21278  df-xmet 21279  df-met 21280  df-bl 21281  df-mopn 21282  df-top 22816  df-topon 22833  df-bases 22869  df-cmp 23311  df-ovol 25413

This theorem is referenced by:  dyadmbllem  25548