Theorem ballotfi 13284

Description: Bertrand's ballot problem : the probability that A is ahead throughout the counting. The proof formalized here is a proof "by reflection", as opposed to other known proofs "by induction" or "by permutation". This is Metamath 100 proof #30. (Contributed by Thierry Arnoux, 7-Dec-2016.) (Revised by Jim Kingdon, 17-Jun-2026.)

Hypotheses

Ref	Expression
ballotfi.m	⊢ 𝑀 ∈ ℕ
ballotfi.n	⊢ 𝑁 ∈ ℕ
ballotfi.o	⊢ 𝑂 = {𝑐 ∈ (𝒫 (1...(𝑀 + 𝑁)) ∩ Fin) ∣ (♯‘𝑐) = 𝑀}
ballotfi.p	⊢ 𝑃 = (𝑥 ∈ (𝒫 𝑂 ∩ Fin) ↦ ((♯‘𝑥) / (♯‘𝑂)))
ballotfi.f	⊢ 𝐹 = (𝑐 ∈ 𝑂 ↦ (𝑖 ∈ ℤ ↦ ((♯‘((1...𝑖) ∩ 𝑐)) − (♯‘((1...𝑖) ∖ 𝑐)))))
ballotfi.e	⊢ 𝐸 = {𝑐 ∈ 𝑂 ∣ ∀𝑖 ∈ (1...(𝑀 + 𝑁))0 < ((𝐹‘𝑐)‘𝑖)}
ballotfi.mgtn	⊢ 𝑁 < 𝑀

Assertion

Ref	Expression
ballotfi	⊢ (𝑃‘𝐸) = ((𝑀 − 𝑁) / (𝑀 + 𝑁))

Distinct variable groups:   𝐸,𝑐,𝑖,𝑥   𝐹,𝑐,𝑖,𝑥   𝑀,𝑐,𝑖,𝑥   𝑁,𝑐,𝑖,𝑥   𝑂,𝑐,𝑖,𝑥

Allowed substitution hints:   𝑃(𝑥, 𝑖, 𝑐)

Proof of Theorem ballotfi

Dummy variables 𝑘 𝑞 𝑟 𝑠 𝑝 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ballotfi.m	. 2 ⊢ 𝑀 ∈ ℕ
2		ballotfi.n	. 2 ⊢ 𝑁 ∈ ℕ
3		ballotfi.o	. 2 ⊢ 𝑂 = {𝑐 ∈ (𝒫 (1...(𝑀 + 𝑁)) ∩ Fin) ∣ (♯‘𝑐) = 𝑀}
4		ballotfi.p	. 2 ⊢ 𝑃 = (𝑥 ∈ (𝒫 𝑂 ∩ Fin) ↦ ((♯‘𝑥) / (♯‘𝑂)))
5		ballotfi.f	. 2 ⊢ 𝐹 = (𝑐 ∈ 𝑂 ↦ (𝑖 ∈ ℤ ↦ ((♯‘((1...𝑖) ∩ 𝑐)) − (♯‘((1...𝑖) ∖ 𝑐)))))
6		ballotfi.e	. 2 ⊢ 𝐸 = {𝑐 ∈ 𝑂 ∣ ∀𝑖 ∈ (1...(𝑀 + 𝑁))0 < ((𝐹‘𝑐)‘𝑖)}
7		ballotfi.mgtn	. 2 ⊢ 𝑁 < 𝑀
8		fveq2 5695	. . . . . . . 8 ⊢ (𝑞 = 𝑐 → (𝐹‘𝑞) = (𝐹‘𝑐))
9	8	fveq1d 5697	. . . . . . 7 ⊢ (𝑞 = 𝑐 → ((𝐹‘𝑞)‘𝑝) = ((𝐹‘𝑐)‘𝑝))
10	9	eqeq1d 2247	. . . . . 6 ⊢ (𝑞 = 𝑐 → (((𝐹‘𝑞)‘𝑝) = 0 ↔ ((𝐹‘𝑐)‘𝑝) = 0))
11	10	rabbidv 2810	. . . . 5 ⊢ (𝑞 = 𝑐 → {𝑝 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝑞)‘𝑝) = 0} = {𝑝 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝑐)‘𝑝) = 0})
12	11	infeq1d 7352	. . . 4 ⊢ (𝑞 = 𝑐 → inf({𝑝 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝑞)‘𝑝) = 0}, ℝ, < ) = inf({𝑝 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝑐)‘𝑝) = 0}, ℝ, < ))
13	12	cbvmptv 4227	. . 3 ⊢ (𝑞 ∈ (𝑂 ∖ 𝐸) ↦ inf({𝑝 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝑞)‘𝑝) = 0}, ℝ, < )) = (𝑐 ∈ (𝑂 ∖ 𝐸) ↦ inf({𝑝 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝑐)‘𝑝) = 0}, ℝ, < ))
14		fveqeq2 5704	. . . . . 6 ⊢ (𝑝 = 𝑘 → (((𝐹‘𝑐)‘𝑝) = 0 ↔ ((𝐹‘𝑐)‘𝑘) = 0))
15	14	cbvrabv 2820	. . . . 5 ⊢ {𝑝 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝑐)‘𝑝) = 0} = {𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝑐)‘𝑘) = 0}
16	15	infeq1i 7353	. . . 4 ⊢ inf({𝑝 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝑐)‘𝑝) = 0}, ℝ, < ) = inf({𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝑐)‘𝑘) = 0}, ℝ, < )
17	16	mpteq2i 4218	. . 3 ⊢ (𝑐 ∈ (𝑂 ∖ 𝐸) ↦ inf({𝑝 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝑐)‘𝑝) = 0}, ℝ, < )) = (𝑐 ∈ (𝑂 ∖ 𝐸) ↦ inf({𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝑐)‘𝑘) = 0}, ℝ, < ))
18	13, 17	eqtri 2259	. 2 ⊢ (𝑞 ∈ (𝑂 ∖ 𝐸) ↦ inf({𝑝 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝑞)‘𝑝) = 0}, ℝ, < )) = (𝑐 ∈ (𝑂 ∖ 𝐸) ↦ inf({𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝑐)‘𝑘) = 0}, ℝ, < ))
19		fveq2 5695	. . . . . . 7 ⊢ (𝑟 = 𝑐 → ((𝑞 ∈ (𝑂 ∖ 𝐸) ↦ inf({𝑝 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝑞)‘𝑝) = 0}, ℝ, < ))‘𝑟) = ((𝑞 ∈ (𝑂 ∖ 𝐸) ↦ inf({𝑝 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝑞)‘𝑝) = 0}, ℝ, < ))‘𝑐))
20	19	breq2d 4142	. . . . . 6 ⊢ (𝑟 = 𝑐 → (𝑠 ≤ ((𝑞 ∈ (𝑂 ∖ 𝐸) ↦ inf({𝑝 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝑞)‘𝑝) = 0}, ℝ, < ))‘𝑟) ↔ 𝑠 ≤ ((𝑞 ∈ (𝑂 ∖ 𝐸) ↦ inf({𝑝 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝑞)‘𝑝) = 0}, ℝ, < ))‘𝑐)))
21	19	oveq1d 6100	. . . . . . 7 ⊢ (𝑟 = 𝑐 → (((𝑞 ∈ (𝑂 ∖ 𝐸) ↦ inf({𝑝 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝑞)‘𝑝) = 0}, ℝ, < ))‘𝑟) + 1) = (((𝑞 ∈ (𝑂 ∖ 𝐸) ↦ inf({𝑝 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝑞)‘𝑝) = 0}, ℝ, < ))‘𝑐) + 1))
22	21	oveq1d 6100	. . . . . 6 ⊢ (𝑟 = 𝑐 → ((((𝑞 ∈ (𝑂 ∖ 𝐸) ↦ inf({𝑝 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝑞)‘𝑝) = 0}, ℝ, < ))‘𝑟) + 1) − 𝑠) = ((((𝑞 ∈ (𝑂 ∖ 𝐸) ↦ inf({𝑝 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝑞)‘𝑝) = 0}, ℝ, < ))‘𝑐) + 1) − 𝑠))
23	20, 22	ifbieq1d 3663	. . . . 5 ⊢ (𝑟 = 𝑐 → if(𝑠 ≤ ((𝑞 ∈ (𝑂 ∖ 𝐸) ↦ inf({𝑝 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝑞)‘𝑝) = 0}, ℝ, < ))‘𝑟), ((((𝑞 ∈ (𝑂 ∖ 𝐸) ↦ inf({𝑝 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝑞)‘𝑝) = 0}, ℝ, < ))‘𝑟) + 1) − 𝑠), 𝑠) = if(𝑠 ≤ ((𝑞 ∈ (𝑂 ∖ 𝐸) ↦ inf({𝑝 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝑞)‘𝑝) = 0}, ℝ, < ))‘𝑐), ((((𝑞 ∈ (𝑂 ∖ 𝐸) ↦ inf({𝑝 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝑞)‘𝑝) = 0}, ℝ, < ))‘𝑐) + 1) − 𝑠), 𝑠))
24	23	mpteq2dv 4222	. . . 4 ⊢ (𝑟 = 𝑐 → (𝑠 ∈ (1...(𝑀 + 𝑁)) ↦ if(𝑠 ≤ ((𝑞 ∈ (𝑂 ∖ 𝐸) ↦ inf({𝑝 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝑞)‘𝑝) = 0}, ℝ, < ))‘𝑟), ((((𝑞 ∈ (𝑂 ∖ 𝐸) ↦ inf({𝑝 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝑞)‘𝑝) = 0}, ℝ, < ))‘𝑟) + 1) − 𝑠), 𝑠)) = (𝑠 ∈ (1...(𝑀 + 𝑁)) ↦ if(𝑠 ≤ ((𝑞 ∈ (𝑂 ∖ 𝐸) ↦ inf({𝑝 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝑞)‘𝑝) = 0}, ℝ, < ))‘𝑐), ((((𝑞 ∈ (𝑂 ∖ 𝐸) ↦ inf({𝑝 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝑞)‘𝑝) = 0}, ℝ, < ))‘𝑐) + 1) − 𝑠), 𝑠)))
25	24	cbvmptv 4227	. . 3 ⊢ (𝑟 ∈ (𝑂 ∖ 𝐸) ↦ (𝑠 ∈ (1...(𝑀 + 𝑁)) ↦ if(𝑠 ≤ ((𝑞 ∈ (𝑂 ∖ 𝐸) ↦ inf({𝑝 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝑞)‘𝑝) = 0}, ℝ, < ))‘𝑟), ((((𝑞 ∈ (𝑂 ∖ 𝐸) ↦ inf({𝑝 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝑞)‘𝑝) = 0}, ℝ, < ))‘𝑟) + 1) − 𝑠), 𝑠))) = (𝑐 ∈ (𝑂 ∖ 𝐸) ↦ (𝑠 ∈ (1...(𝑀 + 𝑁)) ↦ if(𝑠 ≤ ((𝑞 ∈ (𝑂 ∖ 𝐸) ↦ inf({𝑝 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝑞)‘𝑝) = 0}, ℝ, < ))‘𝑐), ((((𝑞 ∈ (𝑂 ∖ 𝐸) ↦ inf({𝑝 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝑞)‘𝑝) = 0}, ℝ, < ))‘𝑐) + 1) − 𝑠), 𝑠)))
26		breq1 4133	. . . . . 6 ⊢ (𝑠 = 𝑖 → (𝑠 ≤ ((𝑞 ∈ (𝑂 ∖ 𝐸) ↦ inf({𝑝 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝑞)‘𝑝) = 0}, ℝ, < ))‘𝑐) ↔ 𝑖 ≤ ((𝑞 ∈ (𝑂 ∖ 𝐸) ↦ inf({𝑝 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝑞)‘𝑝) = 0}, ℝ, < ))‘𝑐)))
27		oveq2 6093	. . . . . 6 ⊢ (𝑠 = 𝑖 → ((((𝑞 ∈ (𝑂 ∖ 𝐸) ↦ inf({𝑝 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝑞)‘𝑝) = 0}, ℝ, < ))‘𝑐) + 1) − 𝑠) = ((((𝑞 ∈ (𝑂 ∖ 𝐸) ↦ inf({𝑝 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝑞)‘𝑝) = 0}, ℝ, < ))‘𝑐) + 1) − 𝑖))
28		id 19	. . . . . 6 ⊢ (𝑠 = 𝑖 → 𝑠 = 𝑖)
29	26, 27, 28	ifbieq12d 3667	. . . . 5 ⊢ (𝑠 = 𝑖 → if(𝑠 ≤ ((𝑞 ∈ (𝑂 ∖ 𝐸) ↦ inf({𝑝 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝑞)‘𝑝) = 0}, ℝ, < ))‘𝑐), ((((𝑞 ∈ (𝑂 ∖ 𝐸) ↦ inf({𝑝 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝑞)‘𝑝) = 0}, ℝ, < ))‘𝑐) + 1) − 𝑠), 𝑠) = if(𝑖 ≤ ((𝑞 ∈ (𝑂 ∖ 𝐸) ↦ inf({𝑝 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝑞)‘𝑝) = 0}, ℝ, < ))‘𝑐), ((((𝑞 ∈ (𝑂 ∖ 𝐸) ↦ inf({𝑝 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝑞)‘𝑝) = 0}, ℝ, < ))‘𝑐) + 1) − 𝑖), 𝑖))
30	29	cbvmptv 4227	. . . 4 ⊢ (𝑠 ∈ (1...(𝑀 + 𝑁)) ↦ if(𝑠 ≤ ((𝑞 ∈ (𝑂 ∖ 𝐸) ↦ inf({𝑝 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝑞)‘𝑝) = 0}, ℝ, < ))‘𝑐), ((((𝑞 ∈ (𝑂 ∖ 𝐸) ↦ inf({𝑝 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝑞)‘𝑝) = 0}, ℝ, < ))‘𝑐) + 1) − 𝑠), 𝑠)) = (𝑖 ∈ (1...(𝑀 + 𝑁)) ↦ if(𝑖 ≤ ((𝑞 ∈ (𝑂 ∖ 𝐸) ↦ inf({𝑝 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝑞)‘𝑝) = 0}, ℝ, < ))‘𝑐), ((((𝑞 ∈ (𝑂 ∖ 𝐸) ↦ inf({𝑝 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝑞)‘𝑝) = 0}, ℝ, < ))‘𝑐) + 1) − 𝑖), 𝑖))
31	30	mpteq2i 4218	. . 3 ⊢ (𝑐 ∈ (𝑂 ∖ 𝐸) ↦ (𝑠 ∈ (1...(𝑀 + 𝑁)) ↦ if(𝑠 ≤ ((𝑞 ∈ (𝑂 ∖ 𝐸) ↦ inf({𝑝 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝑞)‘𝑝) = 0}, ℝ, < ))‘𝑐), ((((𝑞 ∈ (𝑂 ∖ 𝐸) ↦ inf({𝑝 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝑞)‘𝑝) = 0}, ℝ, < ))‘𝑐) + 1) − 𝑠), 𝑠))) = (𝑐 ∈ (𝑂 ∖ 𝐸) ↦ (𝑖 ∈ (1...(𝑀 + 𝑁)) ↦ if(𝑖 ≤ ((𝑞 ∈ (𝑂 ∖ 𝐸) ↦ inf({𝑝 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝑞)‘𝑝) = 0}, ℝ, < ))‘𝑐), ((((𝑞 ∈ (𝑂 ∖ 𝐸) ↦ inf({𝑝 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝑞)‘𝑝) = 0}, ℝ, < ))‘𝑐) + 1) − 𝑖), 𝑖)))
32	25, 31	eqtri 2259	. 2 ⊢ (𝑟 ∈ (𝑂 ∖ 𝐸) ↦ (𝑠 ∈ (1...(𝑀 + 𝑁)) ↦ if(𝑠 ≤ ((𝑞 ∈ (𝑂 ∖ 𝐸) ↦ inf({𝑝 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝑞)‘𝑝) = 0}, ℝ, < ))‘𝑟), ((((𝑞 ∈ (𝑂 ∖ 𝐸) ↦ inf({𝑝 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝑞)‘𝑝) = 0}, ℝ, < ))‘𝑟) + 1) − 𝑠), 𝑠))) = (𝑐 ∈ (𝑂 ∖ 𝐸) ↦ (𝑖 ∈ (1...(𝑀 + 𝑁)) ↦ if(𝑖 ≤ ((𝑞 ∈ (𝑂 ∖ 𝐸) ↦ inf({𝑝 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝑞)‘𝑝) = 0}, ℝ, < ))‘𝑐), ((((𝑞 ∈ (𝑂 ∖ 𝐸) ↦ inf({𝑝 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝑞)‘𝑝) = 0}, ℝ, < ))‘𝑐) + 1) − 𝑖), 𝑖)))
33		eqid 2238	. 2 ⊢ (𝑐 ∈ (𝑂 ∖ 𝐸) ↦ (((𝑟 ∈ (𝑂 ∖ 𝐸) ↦ (𝑠 ∈ (1...(𝑀 + 𝑁)) ↦ if(𝑠 ≤ ((𝑞 ∈ (𝑂 ∖ 𝐸) ↦ inf({𝑝 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝑞)‘𝑝) = 0}, ℝ, < ))‘𝑟), ((((𝑞 ∈ (𝑂 ∖ 𝐸) ↦ inf({𝑝 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝑞)‘𝑝) = 0}, ℝ, < ))‘𝑟) + 1) − 𝑠), 𝑠)))‘𝑐) “ 𝑐)) = (𝑐 ∈ (𝑂 ∖ 𝐸) ↦ (((𝑟 ∈ (𝑂 ∖ 𝐸) ↦ (𝑠 ∈ (1...(𝑀 + 𝑁)) ↦ if(𝑠 ≤ ((𝑞 ∈ (𝑂 ∖ 𝐸) ↦ inf({𝑝 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝑞)‘𝑝) = 0}, ℝ, < ))‘𝑟), ((((𝑞 ∈ (𝑂 ∖ 𝐸) ↦ inf({𝑝 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝑞)‘𝑝) = 0}, ℝ, < ))‘𝑟) + 1) − 𝑠), 𝑠)))‘𝑐) “ 𝑐))
34	1, 2, 3, 4, 5, 6, 7, 18, 32, 33	ballotfilemth 13283	1 ⊢ (𝑃‘𝐸) = ((𝑀 − 𝑁) / (𝑀 + 𝑁))

This proof depends on syntax axioms:   = wceq 1402   ∈ wcel 2209  ∀wral 2528  {crab 2532   ∖ cdif 3217   ∩ cin 3219  ifcif 3638  𝒫 cpw 3688   class class class wbr 4130   ↦ cmpt 4192   “ cima 4777  ‘cfv 5377  (class class class)co 6085  Fincfn 7022  infcinf 7323  ℝcr 8178  0cc0 8179  1c1 8180   + caddc 8182   < clt 8360   ≤ cle 8361   − cmin 8497   / cdiv 9003  ℕcn 9305  ℤcz 9646  ...cfz 10413  ♯chash 11216

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-13 2211  ax-14 2212  ax-ext 2220  ax-coll 4246  ax-sep 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-iinf 4735  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-mulrcl 8278  ax-addcom 8279  ax-mulcom 8280  ax-addass 8281  ax-mulass 8282  ax-distr 8283  ax-i2m1 8284  ax-0lt1 8285  ax-1rid 8286  ax-0id 8287  ax-rnegex 8288  ax-precex 8289  ax-cnre 8290  ax-pre-ltirr 8291  ax-pre-ltwlin 8292  ax-pre-lttrn 8293  ax-pre-apti 8294  ax-pre-ltadd 8295  ax-pre-mulgt0 8296  ax-pre-mulext 8297

This proof depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rmo 2536  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-if 3639  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-tr 4230  df-id 4438  df-po 4441  df-iso 4442  df-iord 4511  df-on 4513  df-ilim 4514  df-suc 4516  df-iom 4738  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-isom 5386  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-recs 6576  df-irdg 6641  df-frec 6662  df-1o 6687  df-2o 6688  df-oadd 6691  df-er 6807  df-map 6924  df-en 7023  df-dom 7024  df-fin 7025  df-sup 7324  df-inf 7325  df-pnf 8362  df-mnf 8363  df-xr 8364  df-ltxr 8365  df-le 8366  df-sub 8499  df-neg 8500  df-reap 8904  df-ap 8911  df-div 9004  df-inn 9306  df-2 9364  df-n0 9566  df-z 9647  df-uz 9924  df-q 10022  df-rp 10057  df-fz 10414  df-fzo 10552  df-seqfrec 10887  df-fac 11166  df-bc 11188  df-ihash 11217

This theorem is used by: (None)