dedekindicclemlu - Intuitionistic Logic Explorer

	Intuitionistic Logic Explorer		< Previous Next > Nearby theorems
Mirrors > Home > ILE Home > Th. List > dedekindicclemlu		GIF version

Theorem dedekindicclemlu 15298

Description: Lemma for dedekindicc 15301. There is a number which separates the lower and upper cuts. (Contributed by Jim Kingdon, 15-Feb-2024.)

**Hypotheses**
Ref	Expression
dedekindicc.a	⊢ (𝜑 → 𝐴 ∈ ℝ)
dedekindicc.b	⊢ (𝜑 → 𝐵 ∈ ℝ)
dedekindicc.lss	⊢ (𝜑 → 𝐿 ⊆ (𝐴[,]𝐵))
dedekindicc.uss	⊢ (𝜑 → 𝑈 ⊆ (𝐴[,]𝐵))
dedekindicc.lm	⊢ (𝜑 → ∃𝑞 ∈ (𝐴[,]𝐵)𝑞 ∈ 𝐿)
dedekindicc.um	⊢ (𝜑 → ∃𝑟 ∈ (𝐴[,]𝐵)𝑟 ∈ 𝑈)
dedekindicc.lr	⊢ (𝜑 → ∀𝑞 ∈ (𝐴[,]𝐵)(𝑞 ∈ 𝐿 ↔ ∃𝑟 ∈ 𝐿 𝑞 < 𝑟))
dedekindicc.ur	⊢ (𝜑 → ∀𝑟 ∈ (𝐴[,]𝐵)(𝑟 ∈ 𝑈 ↔ ∃𝑞 ∈ 𝑈 𝑞 < 𝑟))
dedekindicc.disj	⊢ (𝜑 → (𝐿 ∩ 𝑈) = ∅)
dedekindicc.loc	⊢ (𝜑 → ∀𝑞 ∈ (𝐴[,]𝐵)∀𝑟 ∈ (𝐴[,]𝐵)(𝑞 < 𝑟 → (𝑞 ∈ 𝐿 ∨ 𝑟 ∈ 𝑈)))
dedekindicc.ab	⊢ (𝜑 → 𝐴 < 𝐵)

**Assertion**
Ref	Expression
dedekindicclemlu	⊢ (𝜑 → ∃𝑥 ∈ (𝐴[,]𝐵)(∀𝑞 ∈ 𝐿 𝑞 < 𝑥 ∧ ∀𝑟 ∈ 𝑈 𝑥 < 𝑟))

Distinct variable groups: 𝐴,𝑞,𝑟,𝑥 𝐵,𝑞,𝑟,𝑥 𝐿,𝑞,𝑟,𝑥 𝑈,𝑞,𝑟 𝜑,𝑞,𝑟,𝑥 Allowed substitution hint: 𝑈(𝑥)

Proof of Theorem dedekindicclemlu Dummy variables 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		dedekindicc.a	. . 3 ⊢ (𝜑 → 𝐴 ∈ ℝ)
2		dedekindicc.b	. . 3 ⊢ (𝜑 → 𝐵 ∈ ℝ)
3		dedekindicc.lss	. . 3 ⊢ (𝜑 → 𝐿 ⊆ (𝐴[,]𝐵))
4		dedekindicc.uss	. . 3 ⊢ (𝜑 → 𝑈 ⊆ (𝐴[,]𝐵))
5		dedekindicc.lm	. . 3 ⊢ (𝜑 → ∃𝑞 ∈ (𝐴[,]𝐵)𝑞 ∈ 𝐿)
6		dedekindicc.um	. . 3 ⊢ (𝜑 → ∃𝑟 ∈ (𝐴[,]𝐵)𝑟 ∈ 𝑈)
7		dedekindicc.lr	. . 3 ⊢ (𝜑 → ∀𝑞 ∈ (𝐴[,]𝐵)(𝑞 ∈ 𝐿 ↔ ∃𝑟 ∈ 𝐿 𝑞 < 𝑟))
8		dedekindicc.ur	. . 3 ⊢ (𝜑 → ∀𝑟 ∈ (𝐴[,]𝐵)(𝑟 ∈ 𝑈 ↔ ∃𝑞 ∈ 𝑈 𝑞 < 𝑟))
9		dedekindicc.disj	. . 3 ⊢ (𝜑 → (𝐿 ∩ 𝑈) = ∅)
10		dedekindicc.loc	. . 3 ⊢ (𝜑 → ∀𝑞 ∈ (𝐴[,]𝐵)∀𝑟 ∈ (𝐴[,]𝐵)(𝑞 < 𝑟 → (𝑞 ∈ 𝐿 ∨ 𝑟 ∈ 𝑈)))
11		dedekindicc.ab	. . 3 ⊢ (𝜑 → 𝐴 < 𝐵)
12	1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11	dedekindicclemlub 15297	. 2 ⊢ (𝜑 → ∃𝑥 ∈ (𝐴[,]𝐵)(∀𝑦 ∈ 𝐿 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ (𝐴[,]𝐵)(𝑦 < 𝑥 → ∃𝑧 ∈ 𝐿 𝑦 < 𝑧)))
13		simpr 110	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ (∀𝑦 ∈ 𝐿 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ (𝐴[,]𝐵)(𝑦 < 𝑥 → ∃𝑧 ∈ 𝐿 𝑦 < 𝑧))) ∧ 𝑞 ∈ 𝐿) → 𝑞 ∈ 𝐿)
14	3	ad3antrrr 492	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ (∀𝑦 ∈ 𝐿 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ (𝐴[,]𝐵)(𝑦 < 𝑥 → ∃𝑧 ∈ 𝐿 𝑦 < 𝑧))) ∧ 𝑞 ∈ 𝐿) → 𝐿 ⊆ (𝐴[,]𝐵))
15	14, 13	sseldd 3225	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ (∀𝑦 ∈ 𝐿 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ (𝐴[,]𝐵)(𝑦 < 𝑥 → ∃𝑧 ∈ 𝐿 𝑦 < 𝑧))) ∧ 𝑞 ∈ 𝐿) → 𝑞 ∈ (𝐴[,]𝐵))
16		rsp 2577	. . . . . . . . . . 11 ⊢ (∀𝑞 ∈ (𝐴[,]𝐵)(𝑞 ∈ 𝐿 ↔ ∃𝑟 ∈ 𝐿 𝑞 < 𝑟) → (𝑞 ∈ (𝐴[,]𝐵) → (𝑞 ∈ 𝐿 ↔ ∃𝑟 ∈ 𝐿 𝑞 < 𝑟)))
17	7, 16	syl 14	. . . . . . . . . 10 ⊢ (𝜑 → (𝑞 ∈ (𝐴[,]𝐵) → (𝑞 ∈ 𝐿 ↔ ∃𝑟 ∈ 𝐿 𝑞 < 𝑟)))
18	17	ad3antrrr 492	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ (∀𝑦 ∈ 𝐿 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ (𝐴[,]𝐵)(𝑦 < 𝑥 → ∃𝑧 ∈ 𝐿 𝑦 < 𝑧))) ∧ 𝑞 ∈ 𝐿) → (𝑞 ∈ (𝐴[,]𝐵) → (𝑞 ∈ 𝐿 ↔ ∃𝑟 ∈ 𝐿 𝑞 < 𝑟)))
19	15, 18	mpd 13	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ (∀𝑦 ∈ 𝐿 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ (𝐴[,]𝐵)(𝑦 < 𝑥 → ∃𝑧 ∈ 𝐿 𝑦 < 𝑧))) ∧ 𝑞 ∈ 𝐿) → (𝑞 ∈ 𝐿 ↔ ∃𝑟 ∈ 𝐿 𝑞 < 𝑟))
20	13, 19	mpbid 147	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ (∀𝑦 ∈ 𝐿 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ (𝐴[,]𝐵)(𝑦 < 𝑥 → ∃𝑧 ∈ 𝐿 𝑦 < 𝑧))) ∧ 𝑞 ∈ 𝐿) → ∃𝑟 ∈ 𝐿 𝑞 < 𝑟)
21		iccssre 10147	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴[,]𝐵) ⊆ ℝ)
22	1, 2, 21	syl2anc 411	. . . . . . . . . 10 ⊢ (𝜑 → (𝐴[,]𝐵) ⊆ ℝ)
23	22	ad4antr 494	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ (∀𝑦 ∈ 𝐿 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ (𝐴[,]𝐵)(𝑦 < 𝑥 → ∃𝑧 ∈ 𝐿 𝑦 < 𝑧))) ∧ 𝑞 ∈ 𝐿) ∧ (𝑟 ∈ 𝐿 ∧ 𝑞 < 𝑟)) → (𝐴[,]𝐵) ⊆ ℝ)
24	15	adantr 276	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ (∀𝑦 ∈ 𝐿 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ (𝐴[,]𝐵)(𝑦 < 𝑥 → ∃𝑧 ∈ 𝐿 𝑦 < 𝑧))) ∧ 𝑞 ∈ 𝐿) ∧ (𝑟 ∈ 𝐿 ∧ 𝑞 < 𝑟)) → 𝑞 ∈ (𝐴[,]𝐵))
25	23, 24	sseldd 3225	. . . . . . . 8 ⊢ (((((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ (∀𝑦 ∈ 𝐿 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ (𝐴[,]𝐵)(𝑦 < 𝑥 → ∃𝑧 ∈ 𝐿 𝑦 < 𝑧))) ∧ 𝑞 ∈ 𝐿) ∧ (𝑟 ∈ 𝐿 ∧ 𝑞 < 𝑟)) → 𝑞 ∈ ℝ)
26	3	ad4antr 494	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ (∀𝑦 ∈ 𝐿 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ (𝐴[,]𝐵)(𝑦 < 𝑥 → ∃𝑧 ∈ 𝐿 𝑦 < 𝑧))) ∧ 𝑞 ∈ 𝐿) ∧ (𝑟 ∈ 𝐿 ∧ 𝑞 < 𝑟)) → 𝐿 ⊆ (𝐴[,]𝐵))
27		simprl 529	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ (∀𝑦 ∈ 𝐿 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ (𝐴[,]𝐵)(𝑦 < 𝑥 → ∃𝑧 ∈ 𝐿 𝑦 < 𝑧))) ∧ 𝑞 ∈ 𝐿) ∧ (𝑟 ∈ 𝐿 ∧ 𝑞 < 𝑟)) → 𝑟 ∈ 𝐿)
28	26, 27	sseldd 3225	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ (∀𝑦 ∈ 𝐿 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ (𝐴[,]𝐵)(𝑦 < 𝑥 → ∃𝑧 ∈ 𝐿 𝑦 < 𝑧))) ∧ 𝑞 ∈ 𝐿) ∧ (𝑟 ∈ 𝐿 ∧ 𝑞 < 𝑟)) → 𝑟 ∈ (𝐴[,]𝐵))
29	23, 28	sseldd 3225	. . . . . . . 8 ⊢ (((((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ (∀𝑦 ∈ 𝐿 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ (𝐴[,]𝐵)(𝑦 < 𝑥 → ∃𝑧 ∈ 𝐿 𝑦 < 𝑧))) ∧ 𝑞 ∈ 𝐿) ∧ (𝑟 ∈ 𝐿 ∧ 𝑞 < 𝑟)) → 𝑟 ∈ ℝ)
30		simp-4r 542	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ (∀𝑦 ∈ 𝐿 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ (𝐴[,]𝐵)(𝑦 < 𝑥 → ∃𝑧 ∈ 𝐿 𝑦 < 𝑧))) ∧ 𝑞 ∈ 𝐿) ∧ (𝑟 ∈ 𝐿 ∧ 𝑞 < 𝑟)) → 𝑥 ∈ (𝐴[,]𝐵))
31	23, 30	sseldd 3225	. . . . . . . 8 ⊢ (((((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ (∀𝑦 ∈ 𝐿 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ (𝐴[,]𝐵)(𝑦 < 𝑥 → ∃𝑧 ∈ 𝐿 𝑦 < 𝑧))) ∧ 𝑞 ∈ 𝐿) ∧ (𝑟 ∈ 𝐿 ∧ 𝑞 < 𝑟)) → 𝑥 ∈ ℝ)
32		simprr 531	. . . . . . . 8 ⊢ (((((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ (∀𝑦 ∈ 𝐿 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ (𝐴[,]𝐵)(𝑦 < 𝑥 → ∃𝑧 ∈ 𝐿 𝑦 < 𝑧))) ∧ 𝑞 ∈ 𝐿) ∧ (𝑟 ∈ 𝐿 ∧ 𝑞 < 𝑟)) → 𝑞 < 𝑟)
33		breq2 4086	. . . . . . . . . . 11 ⊢ (𝑦 = 𝑟 → (𝑥 < 𝑦 ↔ 𝑥 < 𝑟))
34	33	notbid 671	. . . . . . . . . 10 ⊢ (𝑦 = 𝑟 → (¬ 𝑥 < 𝑦 ↔ ¬ 𝑥 < 𝑟))
35		simprl 529	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ (∀𝑦 ∈ 𝐿 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ (𝐴[,]𝐵)(𝑦 < 𝑥 → ∃𝑧 ∈ 𝐿 𝑦 < 𝑧))) → ∀𝑦 ∈ 𝐿 ¬ 𝑥 < 𝑦)
36	35	ad2antrr 488	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ (∀𝑦 ∈ 𝐿 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ (𝐴[,]𝐵)(𝑦 < 𝑥 → ∃𝑧 ∈ 𝐿 𝑦 < 𝑧))) ∧ 𝑞 ∈ 𝐿) ∧ (𝑟 ∈ 𝐿 ∧ 𝑞 < 𝑟)) → ∀𝑦 ∈ 𝐿 ¬ 𝑥 < 𝑦)
37	34, 36, 27	rspcdva 2912	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ (∀𝑦 ∈ 𝐿 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ (𝐴[,]𝐵)(𝑦 < 𝑥 → ∃𝑧 ∈ 𝐿 𝑦 < 𝑧))) ∧ 𝑞 ∈ 𝐿) ∧ (𝑟 ∈ 𝐿 ∧ 𝑞 < 𝑟)) → ¬ 𝑥 < 𝑟)
38	29, 31, 37	nltled 8263	. . . . . . . 8 ⊢ (((((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ (∀𝑦 ∈ 𝐿 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ (𝐴[,]𝐵)(𝑦 < 𝑥 → ∃𝑧 ∈ 𝐿 𝑦 < 𝑧))) ∧ 𝑞 ∈ 𝐿) ∧ (𝑟 ∈ 𝐿 ∧ 𝑞 < 𝑟)) → 𝑟 ≤ 𝑥)
39	25, 29, 31, 32, 38	ltletrd 8566	. . . . . . 7 ⊢ (((((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ (∀𝑦 ∈ 𝐿 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ (𝐴[,]𝐵)(𝑦 < 𝑥 → ∃𝑧 ∈ 𝐿 𝑦 < 𝑧))) ∧ 𝑞 ∈ 𝐿) ∧ (𝑟 ∈ 𝐿 ∧ 𝑞 < 𝑟)) → 𝑞 < 𝑥)
40	20, 39	rexlimddv 2653	. . . . . 6 ⊢ ((((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ (∀𝑦 ∈ 𝐿 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ (𝐴[,]𝐵)(𝑦 < 𝑥 → ∃𝑧 ∈ 𝐿 𝑦 < 𝑧))) ∧ 𝑞 ∈ 𝐿) → 𝑞 < 𝑥)
41	40	ralrimiva 2603	. . . . 5 ⊢ (((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ (∀𝑦 ∈ 𝐿 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ (𝐴[,]𝐵)(𝑦 < 𝑥 → ∃𝑧 ∈ 𝐿 𝑦 < 𝑧))) → ∀𝑞 ∈ 𝐿 𝑞 < 𝑥)
42		simpr 110	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ (∀𝑦 ∈ 𝐿 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ (𝐴[,]𝐵)(𝑦 < 𝑥 → ∃𝑧 ∈ 𝐿 𝑦 < 𝑧))) ∧ 𝑟 ∈ 𝑈) → 𝑟 ∈ 𝑈)
43		simplll 533	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ (∀𝑦 ∈ 𝐿 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ (𝐴[,]𝐵)(𝑦 < 𝑥 → ∃𝑧 ∈ 𝐿 𝑦 < 𝑧))) ∧ 𝑟 ∈ 𝑈) → 𝜑)
44	4	ad3antrrr 492	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ (∀𝑦 ∈ 𝐿 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ (𝐴[,]𝐵)(𝑦 < 𝑥 → ∃𝑧 ∈ 𝐿 𝑦 < 𝑧))) ∧ 𝑟 ∈ 𝑈) → 𝑈 ⊆ (𝐴[,]𝐵))
45	44, 42	sseldd 3225	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ (∀𝑦 ∈ 𝐿 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ (𝐴[,]𝐵)(𝑦 < 𝑥 → ∃𝑧 ∈ 𝐿 𝑦 < 𝑧))) ∧ 𝑟 ∈ 𝑈) → 𝑟 ∈ (𝐴[,]𝐵))
46		rsp 2577	. . . . . . . . . 10 ⊢ (∀𝑟 ∈ (𝐴[,]𝐵)(𝑟 ∈ 𝑈 ↔ ∃𝑞 ∈ 𝑈 𝑞 < 𝑟) → (𝑟 ∈ (𝐴[,]𝐵) → (𝑟 ∈ 𝑈 ↔ ∃𝑞 ∈ 𝑈 𝑞 < 𝑟)))
47	8, 46	syl 14	. . . . . . . . 9 ⊢ (𝜑 → (𝑟 ∈ (𝐴[,]𝐵) → (𝑟 ∈ 𝑈 ↔ ∃𝑞 ∈ 𝑈 𝑞 < 𝑟)))
48	43, 45, 47	sylc 62	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ (∀𝑦 ∈ 𝐿 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ (𝐴[,]𝐵)(𝑦 < 𝑥 → ∃𝑧 ∈ 𝐿 𝑦 < 𝑧))) ∧ 𝑟 ∈ 𝑈) → (𝑟 ∈ 𝑈 ↔ ∃𝑞 ∈ 𝑈 𝑞 < 𝑟))
49	42, 48	mpbid 147	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ (∀𝑦 ∈ 𝐿 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ (𝐴[,]𝐵)(𝑦 < 𝑥 → ∃𝑧 ∈ 𝐿 𝑦 < 𝑧))) ∧ 𝑟 ∈ 𝑈) → ∃𝑞 ∈ 𝑈 𝑞 < 𝑟)
50	22	ad4antr 494	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ (∀𝑦 ∈ 𝐿 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ (𝐴[,]𝐵)(𝑦 < 𝑥 → ∃𝑧 ∈ 𝐿 𝑦 < 𝑧))) ∧ 𝑟 ∈ 𝑈) ∧ (𝑞 ∈ 𝑈 ∧ 𝑞 < 𝑟)) → (𝐴[,]𝐵) ⊆ ℝ)
51		simp-4r 542	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ (∀𝑦 ∈ 𝐿 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ (𝐴[,]𝐵)(𝑦 < 𝑥 → ∃𝑧 ∈ 𝐿 𝑦 < 𝑧))) ∧ 𝑟 ∈ 𝑈) ∧ (𝑞 ∈ 𝑈 ∧ 𝑞 < 𝑟)) → 𝑥 ∈ (𝐴[,]𝐵))
52	50, 51	sseldd 3225	. . . . . . . 8 ⊢ (((((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ (∀𝑦 ∈ 𝐿 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ (𝐴[,]𝐵)(𝑦 < 𝑥 → ∃𝑧 ∈ 𝐿 𝑦 < 𝑧))) ∧ 𝑟 ∈ 𝑈) ∧ (𝑞 ∈ 𝑈 ∧ 𝑞 < 𝑟)) → 𝑥 ∈ ℝ)
53	4	ad4antr 494	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ (∀𝑦 ∈ 𝐿 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ (𝐴[,]𝐵)(𝑦 < 𝑥 → ∃𝑧 ∈ 𝐿 𝑦 < 𝑧))) ∧ 𝑟 ∈ 𝑈) ∧ (𝑞 ∈ 𝑈 ∧ 𝑞 < 𝑟)) → 𝑈 ⊆ (𝐴[,]𝐵))
54		simprl 529	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ (∀𝑦 ∈ 𝐿 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ (𝐴[,]𝐵)(𝑦 < 𝑥 → ∃𝑧 ∈ 𝐿 𝑦 < 𝑧))) ∧ 𝑟 ∈ 𝑈) ∧ (𝑞 ∈ 𝑈 ∧ 𝑞 < 𝑟)) → 𝑞 ∈ 𝑈)
55	53, 54	sseldd 3225	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ (∀𝑦 ∈ 𝐿 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ (𝐴[,]𝐵)(𝑦 < 𝑥 → ∃𝑧 ∈ 𝐿 𝑦 < 𝑧))) ∧ 𝑟 ∈ 𝑈) ∧ (𝑞 ∈ 𝑈 ∧ 𝑞 < 𝑟)) → 𝑞 ∈ (𝐴[,]𝐵))
56	50, 55	sseldd 3225	. . . . . . . 8 ⊢ (((((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ (∀𝑦 ∈ 𝐿 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ (𝐴[,]𝐵)(𝑦 < 𝑥 → ∃𝑧 ∈ 𝐿 𝑦 < 𝑧))) ∧ 𝑟 ∈ 𝑈) ∧ (𝑞 ∈ 𝑈 ∧ 𝑞 < 𝑟)) → 𝑞 ∈ ℝ)
57	45	adantr 276	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ (∀𝑦 ∈ 𝐿 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ (𝐴[,]𝐵)(𝑦 < 𝑥 → ∃𝑧 ∈ 𝐿 𝑦 < 𝑧))) ∧ 𝑟 ∈ 𝑈) ∧ (𝑞 ∈ 𝑈 ∧ 𝑞 < 𝑟)) → 𝑟 ∈ (𝐴[,]𝐵))
58	50, 57	sseldd 3225	. . . . . . . 8 ⊢ (((((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ (∀𝑦 ∈ 𝐿 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ (𝐴[,]𝐵)(𝑦 < 𝑥 → ∃𝑧 ∈ 𝐿 𝑦 < 𝑧))) ∧ 𝑟 ∈ 𝑈) ∧ (𝑞 ∈ 𝑈 ∧ 𝑞 < 𝑟)) → 𝑟 ∈ ℝ)
59	54	adantr 276	. . . . . . . . . 10 ⊢ ((((((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ (∀𝑦 ∈ 𝐿 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ (𝐴[,]𝐵)(𝑦 < 𝑥 → ∃𝑧 ∈ 𝐿 𝑦 < 𝑧))) ∧ 𝑟 ∈ 𝑈) ∧ (𝑞 ∈ 𝑈 ∧ 𝑞 < 𝑟)) ∧ 𝑞 < 𝑥) → 𝑞 ∈ 𝑈)
60	43	ad2antrr 488	. . . . . . . . . . 11 ⊢ ((((((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ (∀𝑦 ∈ 𝐿 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ (𝐴[,]𝐵)(𝑦 < 𝑥 → ∃𝑧 ∈ 𝐿 𝑦 < 𝑧))) ∧ 𝑟 ∈ 𝑈) ∧ (𝑞 ∈ 𝑈 ∧ 𝑞 < 𝑟)) ∧ 𝑞 < 𝑥) → 𝜑)
61		simpr 110	. . . . . . . . . . . . . 14 ⊢ ((((((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ (∀𝑦 ∈ 𝐿 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ (𝐴[,]𝐵)(𝑦 < 𝑥 → ∃𝑧 ∈ 𝐿 𝑦 < 𝑧))) ∧ 𝑟 ∈ 𝑈) ∧ (𝑞 ∈ 𝑈 ∧ 𝑞 < 𝑟)) ∧ 𝑞 < 𝑥) → 𝑞 < 𝑥)
62		breq1 4085	. . . . . . . . . . . . . . . 16 ⊢ (𝑦 = 𝑞 → (𝑦 < 𝑥 ↔ 𝑞 < 𝑥))
63		breq1 4085	. . . . . . . . . . . . . . . . 17 ⊢ (𝑦 = 𝑞 → (𝑦 < 𝑧 ↔ 𝑞 < 𝑧))
64	63	rexbidv 2531	. . . . . . . . . . . . . . . 16 ⊢ (𝑦 = 𝑞 → (∃𝑧 ∈ 𝐿 𝑦 < 𝑧 ↔ ∃𝑧 ∈ 𝐿 𝑞 < 𝑧))
65	62, 64	imbi12d 234	. . . . . . . . . . . . . . 15 ⊢ (𝑦 = 𝑞 → ((𝑦 < 𝑥 → ∃𝑧 ∈ 𝐿 𝑦 < 𝑧) ↔ (𝑞 < 𝑥 → ∃𝑧 ∈ 𝐿 𝑞 < 𝑧)))
66		simprr 531	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ (∀𝑦 ∈ 𝐿 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ (𝐴[,]𝐵)(𝑦 < 𝑥 → ∃𝑧 ∈ 𝐿 𝑦 < 𝑧))) → ∀𝑦 ∈ (𝐴[,]𝐵)(𝑦 < 𝑥 → ∃𝑧 ∈ 𝐿 𝑦 < 𝑧))
67	66	ad3antrrr 492	. . . . . . . . . . . . . . 15 ⊢ ((((((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ (∀𝑦 ∈ 𝐿 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ (𝐴[,]𝐵)(𝑦 < 𝑥 → ∃𝑧 ∈ 𝐿 𝑦 < 𝑧))) ∧ 𝑟 ∈ 𝑈) ∧ (𝑞 ∈ 𝑈 ∧ 𝑞 < 𝑟)) ∧ 𝑞 < 𝑥) → ∀𝑦 ∈ (𝐴[,]𝐵)(𝑦 < 𝑥 → ∃𝑧 ∈ 𝐿 𝑦 < 𝑧))
68	55	adantr 276	. . . . . . . . . . . . . . 15 ⊢ ((((((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ (∀𝑦 ∈ 𝐿 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ (𝐴[,]𝐵)(𝑦 < 𝑥 → ∃𝑧 ∈ 𝐿 𝑦 < 𝑧))) ∧ 𝑟 ∈ 𝑈) ∧ (𝑞 ∈ 𝑈 ∧ 𝑞 < 𝑟)) ∧ 𝑞 < 𝑥) → 𝑞 ∈ (𝐴[,]𝐵))
69	65, 67, 68	rspcdva 2912	. . . . . . . . . . . . . 14 ⊢ ((((((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ (∀𝑦 ∈ 𝐿 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ (𝐴[,]𝐵)(𝑦 < 𝑥 → ∃𝑧 ∈ 𝐿 𝑦 < 𝑧))) ∧ 𝑟 ∈ 𝑈) ∧ (𝑞 ∈ 𝑈 ∧ 𝑞 < 𝑟)) ∧ 𝑞 < 𝑥) → (𝑞 < 𝑥 → ∃𝑧 ∈ 𝐿 𝑞 < 𝑧))
70	61, 69	mpd 13	. . . . . . . . . . . . 13 ⊢ ((((((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ (∀𝑦 ∈ 𝐿 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ (𝐴[,]𝐵)(𝑦 < 𝑥 → ∃𝑧 ∈ 𝐿 𝑦 < 𝑧))) ∧ 𝑟 ∈ 𝑈) ∧ (𝑞 ∈ 𝑈 ∧ 𝑞 < 𝑟)) ∧ 𝑞 < 𝑥) → ∃𝑧 ∈ 𝐿 𝑞 < 𝑧)
71		breq2 4086	. . . . . . . . . . . . . 14 ⊢ (𝑧 = 𝑟 → (𝑞 < 𝑧 ↔ 𝑞 < 𝑟))
72	71	cbvrexv 2766	. . . . . . . . . . . . 13 ⊢ (∃𝑧 ∈ 𝐿 𝑞 < 𝑧 ↔ ∃𝑟 ∈ 𝐿 𝑞 < 𝑟)
73	70, 72	sylib 122	. . . . . . . . . . . 12 ⊢ ((((((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ (∀𝑦 ∈ 𝐿 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ (𝐴[,]𝐵)(𝑦 < 𝑥 → ∃𝑧 ∈ 𝐿 𝑦 < 𝑧))) ∧ 𝑟 ∈ 𝑈) ∧ (𝑞 ∈ 𝑈 ∧ 𝑞 < 𝑟)) ∧ 𝑞 < 𝑥) → ∃𝑟 ∈ 𝐿 𝑞 < 𝑟)
74	60, 68, 17	sylc 62	. . . . . . . . . . . 12 ⊢ ((((((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ (∀𝑦 ∈ 𝐿 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ (𝐴[,]𝐵)(𝑦 < 𝑥 → ∃𝑧 ∈ 𝐿 𝑦 < 𝑧))) ∧ 𝑟 ∈ 𝑈) ∧ (𝑞 ∈ 𝑈 ∧ 𝑞 < 𝑟)) ∧ 𝑞 < 𝑥) → (𝑞 ∈ 𝐿 ↔ ∃𝑟 ∈ 𝐿 𝑞 < 𝑟))
75	73, 74	mpbird 167	. . . . . . . . . . 11 ⊢ ((((((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ (∀𝑦 ∈ 𝐿 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ (𝐴[,]𝐵)(𝑦 < 𝑥 → ∃𝑧 ∈ 𝐿 𝑦 < 𝑧))) ∧ 𝑟 ∈ 𝑈) ∧ (𝑞 ∈ 𝑈 ∧ 𝑞 < 𝑟)) ∧ 𝑞 < 𝑥) → 𝑞 ∈ 𝐿)
76		disj 3540	. . . . . . . . . . . . 13 ⊢ ((𝐿 ∩ 𝑈) = ∅ ↔ ∀𝑞 ∈ 𝐿 ¬ 𝑞 ∈ 𝑈)
77	9, 76	sylib 122	. . . . . . . . . . . 12 ⊢ (𝜑 → ∀𝑞 ∈ 𝐿 ¬ 𝑞 ∈ 𝑈)
78	77	r19.21bi 2618	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑞 ∈ 𝐿) → ¬ 𝑞 ∈ 𝑈)
79	60, 75, 78	syl2anc 411	. . . . . . . . . 10 ⊢ ((((((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ (∀𝑦 ∈ 𝐿 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ (𝐴[,]𝐵)(𝑦 < 𝑥 → ∃𝑧 ∈ 𝐿 𝑦 < 𝑧))) ∧ 𝑟 ∈ 𝑈) ∧ (𝑞 ∈ 𝑈 ∧ 𝑞 < 𝑟)) ∧ 𝑞 < 𝑥) → ¬ 𝑞 ∈ 𝑈)
80	59, 79	pm2.65da 665	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ (∀𝑦 ∈ 𝐿 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ (𝐴[,]𝐵)(𝑦 < 𝑥 → ∃𝑧 ∈ 𝐿 𝑦 < 𝑧))) ∧ 𝑟 ∈ 𝑈) ∧ (𝑞 ∈ 𝑈 ∧ 𝑞 < 𝑟)) → ¬ 𝑞 < 𝑥)
81	52, 56, 80	nltled 8263	. . . . . . . 8 ⊢ (((((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ (∀𝑦 ∈ 𝐿 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ (𝐴[,]𝐵)(𝑦 < 𝑥 → ∃𝑧 ∈ 𝐿 𝑦 < 𝑧))) ∧ 𝑟 ∈ 𝑈) ∧ (𝑞 ∈ 𝑈 ∧ 𝑞 < 𝑟)) → 𝑥 ≤ 𝑞)
82		simprr 531	. . . . . . . 8 ⊢ (((((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ (∀𝑦 ∈ 𝐿 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ (𝐴[,]𝐵)(𝑦 < 𝑥 → ∃𝑧 ∈ 𝐿 𝑦 < 𝑧))) ∧ 𝑟 ∈ 𝑈) ∧ (𝑞 ∈ 𝑈 ∧ 𝑞 < 𝑟)) → 𝑞 < 𝑟)
83	52, 56, 58, 81, 82	lelttrd 8267	. . . . . . 7 ⊢ (((((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ (∀𝑦 ∈ 𝐿 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ (𝐴[,]𝐵)(𝑦 < 𝑥 → ∃𝑧 ∈ 𝐿 𝑦 < 𝑧))) ∧ 𝑟 ∈ 𝑈) ∧ (𝑞 ∈ 𝑈 ∧ 𝑞 < 𝑟)) → 𝑥 < 𝑟)
84	49, 83	rexlimddv 2653	. . . . . 6 ⊢ ((((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ (∀𝑦 ∈ 𝐿 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ (𝐴[,]𝐵)(𝑦 < 𝑥 → ∃𝑧 ∈ 𝐿 𝑦 < 𝑧))) ∧ 𝑟 ∈ 𝑈) → 𝑥 < 𝑟)
85	84	ralrimiva 2603	. . . . 5 ⊢ (((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ (∀𝑦 ∈ 𝐿 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ (𝐴[,]𝐵)(𝑦 < 𝑥 → ∃𝑧 ∈ 𝐿 𝑦 < 𝑧))) → ∀𝑟 ∈ 𝑈 𝑥 < 𝑟)
86	41, 85	jca 306	. . . 4 ⊢ (((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ (∀𝑦 ∈ 𝐿 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ (𝐴[,]𝐵)(𝑦 < 𝑥 → ∃𝑧 ∈ 𝐿 𝑦 < 𝑧))) → (∀𝑞 ∈ 𝐿 𝑞 < 𝑥 ∧ ∀𝑟 ∈ 𝑈 𝑥 < 𝑟))
87	86	ex 115	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) → ((∀𝑦 ∈ 𝐿 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ (𝐴[,]𝐵)(𝑦 < 𝑥 → ∃𝑧 ∈ 𝐿 𝑦 < 𝑧)) → (∀𝑞 ∈ 𝐿 𝑞 < 𝑥 ∧ ∀𝑟 ∈ 𝑈 𝑥 < 𝑟)))
88	87	reximdva 2632	. 2 ⊢ (𝜑 → (∃𝑥 ∈ (𝐴[,]𝐵)(∀𝑦 ∈ 𝐿 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ (𝐴[,]𝐵)(𝑦 < 𝑥 → ∃𝑧 ∈ 𝐿 𝑦 < 𝑧)) → ∃𝑥 ∈ (𝐴[,]𝐵)(∀𝑞 ∈ 𝐿 𝑞 < 𝑥 ∧ ∀𝑟 ∈ 𝑈 𝑥 < 𝑟)))
89	12, 88	mpd 13	1 ⊢ (𝜑 → ∃𝑥 ∈ (𝐴[,]𝐵)(∀𝑞 ∈ 𝐿 𝑞 < 𝑥 ∧ ∀𝑟 ∈ 𝑈 𝑥 < 𝑟))

Colors of variables: wff set class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ↔ wb 105 ∨ wo 713 = wceq 1395 ∈ wcel 2200 ∀wral 2508 ∃wrex 2509 ∩ cin 3196 ⊆ wss 3197 ∅c0 3491 class class class wbr 4082 (class class class)co 6000 ℝcr 7994 < clt 8177 [,]cicc 10083

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-coll 4198 ax-sep 4201 ax-nul 4209 ax-pow 4257 ax-pr 4292 ax-un 4523 ax-setind 4628 ax-iinf 4679 ax-cnex 8086 ax-resscn 8087 ax-1cn 8088 ax-1re 8089 ax-icn 8090 ax-addcl 8091 ax-addrcl 8092 ax-mulcl 8093 ax-mulrcl 8094 ax-addcom 8095 ax-mulcom 8096 ax-addass 8097 ax-mulass 8098 ax-distr 8099 ax-i2m1 8100 ax-0lt1 8101 ax-1rid 8102 ax-0id 8103 ax-rnegex 8104 ax-precex 8105 ax-cnre 8106 ax-pre-ltirr 8107 ax-pre-ltwlin 8108 ax-pre-lttrn 8109 ax-pre-apti 8110 ax-pre-ltadd 8111 ax-pre-mulgt0 8112 ax-pre-mulext 8113 ax-arch 8114 ax-caucvg 8115 ax-pre-suploc 8116

This theorem depends on definitions: df-bi 117 df-dc 840 df-3or 1003 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-nel 2496 df-ral 2513 df-rex 2514 df-reu 2515 df-rmo 2516 df-rab 2517 df-v 2801 df-sbc 3029 df-csb 3125 df-dif 3199 df-un 3201 df-in 3203 df-ss 3210 df-nul 3492 df-if 3603 df-pw 3651 df-sn 3672 df-pr 3673 df-op 3675 df-uni 3888 df-int 3923 df-iun 3966 df-br 4083 df-opab 4145 df-mpt 4146 df-tr 4182 df-id 4383 df-po 4386 df-iso 4387 df-iord 4456 df-on 4458 df-ilim 4459 df-suc 4461 df-iom 4682 df-xp 4724 df-rel 4725 df-cnv 4726 df-co 4727 df-dm 4728 df-rn 4729 df-res 4730 df-ima 4731 df-iota 5277 df-fun 5319 df-fn 5320 df-f 5321 df-f1 5322 df-fo 5323 df-f1o 5324 df-fv 5325 df-isom 5326 df-riota 5953 df-ov 6003 df-oprab 6004 df-mpo 6005 df-1st 6284 df-2nd 6285 df-recs 6449 df-frec 6535 df-sup 7147 df-inf 7148 df-pnf 8179 df-mnf 8180 df-xr 8181 df-ltxr 8182 df-le 8183 df-sub 8315 df-neg 8316 df-reap 8718 df-ap 8725 df-div 8816 df-inn 9107 df-2 9165 df-3 9166 df-4 9167 df-n0 9366 df-z 9443 df-uz 9719 df-rp 9846 df-icc 10087 df-seqfrec 10665 df-exp 10756 df-cj 11348 df-re 11349 df-im 11350 df-rsqrt 11504 df-abs 11505

This theorem is referenced by: dedekindicclemicc 15300

W3C validator