ballotfilem1c - Intuitionistic Logic Explorer

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

Theorem ballotfilem1c 13195

Description: If the first vote is for A, the vote on the first tie is for B. (Contributed by Thierry Arnoux, 4-Apr-2017.)

**Hypotheses**
Ref	Expression
ballotth.m	⊢ 𝑀 ∈ ℕ
ballotth.n	⊢ 𝑁 ∈ ℕ
ballotfilem.o	⊢ 𝑂 = {𝑐 ∈ (𝒫 (1...(𝑀 + 𝑁)) ∩ Fin) ∣ (♯‘𝑐) = 𝑀}
ballotfilem.p	⊢ 𝑃 = (𝑥 ∈ (𝒫 𝑂 ∩ Fin) ↦ ((♯‘𝑥) / (♯‘𝑂)))
ballotth.f	⊢ 𝐹 = (𝑐 ∈ 𝑂 ↦ (𝑖 ∈ ℤ ↦ ((♯‘((1...𝑖) ∩ 𝑐)) − (♯‘((1...𝑖) ∖ 𝑐)))))
ballotth.e	⊢ 𝐸 = {𝑐 ∈ 𝑂 ∣ ∀𝑖 ∈ (1...(𝑀 + 𝑁))0 < ((𝐹‘𝑐)‘𝑖)}
ballotth.mgtn	⊢ 𝑁 < 𝑀
ballotth.i	⊢ 𝐼 = (𝑐 ∈ (𝑂 ∖ 𝐸) ↦ inf({𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝑐)‘𝑘) = 0}, ℝ, < ))

**Assertion**
Ref	Expression
ballotfilem1c	⊢ ((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ 1 ∈ 𝐶) → ¬ (𝐼‘𝐶) ∈ 𝐶)

Distinct variable groups: 𝑀,𝑐 𝑁,𝑐 𝑂,𝑐 𝑖,𝑀 𝑖,𝑁 𝑖,𝑂 𝑘,𝑀 𝑘,𝑁 𝑘,𝑂 𝑖,𝑐,𝐹,𝑘 𝐶,𝑖,𝑘 𝑖,𝐸,𝑘 𝐶,𝑘 𝑘,𝐼 𝑘,𝑐,𝐸 𝑖,𝐼 Allowed substitution hints: 𝐶(𝑥,𝑐) 𝑃(𝑥,𝑖,𝑘,𝑐) 𝐸(𝑥) 𝐹(𝑥) 𝐼(𝑥,𝑐) 𝑀(𝑥) 𝑁(𝑥) 𝑂(𝑥)

**Proof of Theorem ballotfilem1c**
Step	Hyp	Ref	Expression
1		ballotth.m	. . 3 ⊢ 𝑀 ∈ ℕ
2		ballotth.n	. . 3 ⊢ 𝑁 ∈ ℕ
3		ballotfilem.o	. . 3 ⊢ 𝑂 = {𝑐 ∈ (𝒫 (1...(𝑀 + 𝑁)) ∩ Fin) ∣ (♯‘𝑐) = 𝑀}
4		ballotfilem.p	. . 3 ⊢ 𝑃 = (𝑥 ∈ (𝒫 𝑂 ∩ Fin) ↦ ((♯‘𝑥) / (♯‘𝑂)))
5		ballotth.f	. . 3 ⊢ 𝐹 = (𝑐 ∈ 𝑂 ↦ (𝑖 ∈ ℤ ↦ ((♯‘((1...𝑖) ∩ 𝑐)) − (♯‘((1...𝑖) ∖ 𝑐)))))
6		eldifi 3345	. . . 4 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → 𝐶 ∈ 𝑂)
7	6	ad2antrr 488	. . 3 ⊢ (((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ 1 ∈ 𝐶) ∧ (𝐼‘𝐶) ∈ 𝐶) → 𝐶 ∈ 𝑂)
8		ballotth.e	. . . . . . . . . 10 ⊢ 𝐸 = {𝑐 ∈ 𝑂 ∣ ∀𝑖 ∈ (1...(𝑀 + 𝑁))0 < ((𝐹‘𝑐)‘𝑖)}
9		ballotth.mgtn	. . . . . . . . . 10 ⊢ 𝑁 < 𝑀
10		ballotth.i	. . . . . . . . . 10 ⊢ 𝐼 = (𝑐 ∈ (𝑂 ∖ 𝐸) ↦ inf({𝑘 ∈ (1...(𝑀 + 𝑁)) ∣ ((𝐹‘𝑐)‘𝑘) = 0}, ℝ, < ))
11	1, 2, 3, 4, 5, 8, 9, 10	ballotfilemiex 13188	. . . . . . . . 9 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → ((𝐼‘𝐶) ∈ (1...(𝑀 + 𝑁)) ∧ ((𝐹‘𝐶)‘(𝐼‘𝐶)) = 0))
12	11	simpld 112	. . . . . . . 8 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → (𝐼‘𝐶) ∈ (1...(𝑀 + 𝑁)))
13		elfznn 10409	. . . . . . . 8 ⊢ ((𝐼‘𝐶) ∈ (1...(𝑀 + 𝑁)) → (𝐼‘𝐶) ∈ ℕ)
14	12, 13	syl 14	. . . . . . 7 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → (𝐼‘𝐶) ∈ ℕ)
15	14	adantr 276	. . . . . 6 ⊢ ((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ 1 ∈ 𝐶) → (𝐼‘𝐶) ∈ ℕ)
16	1, 2, 3, 4, 5, 8, 9, 10	ballotfilemii 13190	. . . . . 6 ⊢ ((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ 1 ∈ 𝐶) → (𝐼‘𝐶) ≠ 1)
17		eluz2b3 9954	. . . . . 6 ⊢ ((𝐼‘𝐶) ∈ (ℤ_≥‘2) ↔ ((𝐼‘𝐶) ∈ ℕ ∧ (𝐼‘𝐶) ≠ 1))
18	15, 16, 17	sylanbrc 417	. . . . 5 ⊢ ((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ 1 ∈ 𝐶) → (𝐼‘𝐶) ∈ (ℤ_≥‘2))
19		uz2m1nn 9955	. . . . 5 ⊢ ((𝐼‘𝐶) ∈ (ℤ_≥‘2) → ((𝐼‘𝐶) − 1) ∈ ℕ)
20	18, 19	syl 14	. . . 4 ⊢ ((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ 1 ∈ 𝐶) → ((𝐼‘𝐶) − 1) ∈ ℕ)
21	20	adantr 276	. . 3 ⊢ (((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ 1 ∈ 𝐶) ∧ (𝐼‘𝐶) ∈ 𝐶) → ((𝐼‘𝐶) − 1) ∈ ℕ)
22		fveq2 5675	. . . . 5 ⊢ (𝑖 = 1 → ((𝐹‘𝐶)‘𝑖) = ((𝐹‘𝐶)‘1))
23	22	breq2d 4126	. . . 4 ⊢ (𝑖 = 1 → (0 ≤ ((𝐹‘𝐶)‘𝑖) ↔ 0 ≤ ((𝐹‘𝐶)‘1)))
24		elnnuz 9909	. . . . . . 7 ⊢ (((𝐼‘𝐶) − 1) ∈ ℕ ↔ ((𝐼‘𝐶) − 1) ∈ (ℤ_≥‘1))
25	24	biimpi 120	. . . . . 6 ⊢ (((𝐼‘𝐶) − 1) ∈ ℕ → ((𝐼‘𝐶) − 1) ∈ (ℤ_≥‘1))
26		eluzfz1 10385	. . . . . 6 ⊢ (((𝐼‘𝐶) − 1) ∈ (ℤ_≥‘1) → 1 ∈ (1...((𝐼‘𝐶) − 1)))
27	20, 25, 26	3syl 17	. . . . 5 ⊢ ((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ 1 ∈ 𝐶) → 1 ∈ (1...((𝐼‘𝐶) − 1)))
28	27	adantr 276	. . . 4 ⊢ (((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ 1 ∈ 𝐶) ∧ (𝐼‘𝐶) ∈ 𝐶) → 1 ∈ (1...((𝐼‘𝐶) − 1)))
29		0le1 8772	. . . . . . 7 ⊢ 0 ≤ 1
30		1e0p1 9768	. . . . . . 7 ⊢ 1 = (0 + 1)
31	29, 30	breqtri 4139	. . . . . 6 ⊢ 0 ≤ (0 + 1)
32		1nn 9265	. . . . . . . . . . 11 ⊢ 1 ∈ ℕ
33	32	a1i 9	. . . . . . . . . 10 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → 1 ∈ ℕ)
34	1, 2, 3, 4, 5, 6, 33	ballotfilemfp1 13175	. . . . . . . . 9 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → ((¬ 1 ∈ 𝐶 → ((𝐹‘𝐶)‘1) = (((𝐹‘𝐶)‘(1 − 1)) − 1)) ∧ (1 ∈ 𝐶 → ((𝐹‘𝐶)‘1) = (((𝐹‘𝐶)‘(1 − 1)) + 1))))
35	34	simprd 114	. . . . . . . 8 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → (1 ∈ 𝐶 → ((𝐹‘𝐶)‘1) = (((𝐹‘𝐶)‘(1 − 1)) + 1)))
36	35	imp 124	. . . . . . 7 ⊢ ((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ 1 ∈ 𝐶) → ((𝐹‘𝐶)‘1) = (((𝐹‘𝐶)‘(1 − 1)) + 1))
37		1m1e0 9323	. . . . . . . . . 10 ⊢ (1 − 1) = 0
38	37	fveq2i 5678	. . . . . . . . 9 ⊢ ((𝐹‘𝐶)‘(1 − 1)) = ((𝐹‘𝐶)‘0)
39	38	oveq1i 6068	. . . . . . . 8 ⊢ (((𝐹‘𝐶)‘(1 − 1)) + 1) = (((𝐹‘𝐶)‘0) + 1)
40	39	a1i 9	. . . . . . 7 ⊢ ((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ 1 ∈ 𝐶) → (((𝐹‘𝐶)‘(1 − 1)) + 1) = (((𝐹‘𝐶)‘0) + 1))
41	1, 2, 3, 4, 5	ballotfilemfval0 13179	. . . . . . . . . 10 ⊢ (𝐶 ∈ 𝑂 → ((𝐹‘𝐶)‘0) = 0)
42	6, 41	syl 14	. . . . . . . . 9 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → ((𝐹‘𝐶)‘0) = 0)
43	42	adantr 276	. . . . . . . 8 ⊢ ((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ 1 ∈ 𝐶) → ((𝐹‘𝐶)‘0) = 0)
44	43	oveq1d 6073	. . . . . . 7 ⊢ ((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ 1 ∈ 𝐶) → (((𝐹‘𝐶)‘0) + 1) = (0 + 1))
45	36, 40, 44	3eqtrrd 2272	. . . . . 6 ⊢ ((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ 1 ∈ 𝐶) → (0 + 1) = ((𝐹‘𝐶)‘1))
46	31, 45	breqtrid 4151	. . . . 5 ⊢ ((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ 1 ∈ 𝐶) → 0 ≤ ((𝐹‘𝐶)‘1))
47	46	adantr 276	. . . 4 ⊢ (((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ 1 ∈ 𝐶) ∧ (𝐼‘𝐶) ∈ 𝐶) → 0 ≤ ((𝐹‘𝐶)‘1))
48	23, 28, 47	rspcedvdw 2930	. . 3 ⊢ (((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ 1 ∈ 𝐶) ∧ (𝐼‘𝐶) ∈ 𝐶) → ∃𝑖 ∈ (1...((𝐼‘𝐶) − 1))0 ≤ ((𝐹‘𝐶)‘𝑖))
49		df-neg 8463	. . . . . 6 ⊢ -1 = (0 − 1)
50	1, 2, 3, 4, 5, 6, 14	ballotfilemfp1 13175	. . . . . . . . . 10 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → ((¬ (𝐼‘𝐶) ∈ 𝐶 → ((𝐹‘𝐶)‘(𝐼‘𝐶)) = (((𝐹‘𝐶)‘((𝐼‘𝐶) − 1)) − 1)) ∧ ((𝐼‘𝐶) ∈ 𝐶 → ((𝐹‘𝐶)‘(𝐼‘𝐶)) = (((𝐹‘𝐶)‘((𝐼‘𝐶) − 1)) + 1))))
51	50	simprd 114	. . . . . . . . 9 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → ((𝐼‘𝐶) ∈ 𝐶 → ((𝐹‘𝐶)‘(𝐼‘𝐶)) = (((𝐹‘𝐶)‘((𝐼‘𝐶) − 1)) + 1)))
52	51	imp 124	. . . . . . . 8 ⊢ ((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ (𝐼‘𝐶) ∈ 𝐶) → ((𝐹‘𝐶)‘(𝐼‘𝐶)) = (((𝐹‘𝐶)‘((𝐼‘𝐶) − 1)) + 1))
53	11	simprd 114	. . . . . . . . 9 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → ((𝐹‘𝐶)‘(𝐼‘𝐶)) = 0)
54	53	adantr 276	. . . . . . . 8 ⊢ ((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ (𝐼‘𝐶) ∈ 𝐶) → ((𝐹‘𝐶)‘(𝐼‘𝐶)) = 0)
55	52, 54	eqtr3d 2269	. . . . . . 7 ⊢ ((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ (𝐼‘𝐶) ∈ 𝐶) → (((𝐹‘𝐶)‘((𝐼‘𝐶) − 1)) + 1) = 0)
56		0cnd 8283	. . . . . . . 8 ⊢ ((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ (𝐼‘𝐶) ∈ 𝐶) → 0 ∈ ℂ)
57		1cnd 8306	. . . . . . . 8 ⊢ ((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ (𝐼‘𝐶) ∈ 𝐶) → 1 ∈ ℂ)
58	6	adantr 276	. . . . . . . . . 10 ⊢ ((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ (𝐼‘𝐶) ∈ 𝐶) → 𝐶 ∈ 𝑂)
59	14	nnzd 9717	. . . . . . . . . . . 12 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → (𝐼‘𝐶) ∈ ℤ)
60	59	adantr 276	. . . . . . . . . . 11 ⊢ ((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ (𝐼‘𝐶) ∈ 𝐶) → (𝐼‘𝐶) ∈ ℤ)
61		1zzd 9621	. . . . . . . . . . 11 ⊢ ((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ (𝐼‘𝐶) ∈ 𝐶) → 1 ∈ ℤ)
62	60, 61	zsubcld 9723	. . . . . . . . . 10 ⊢ ((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ (𝐼‘𝐶) ∈ 𝐶) → ((𝐼‘𝐶) − 1) ∈ ℤ)
63	1, 2, 3, 4, 5, 58, 62	ballotfilemfelz 13174	. . . . . . . . 9 ⊢ ((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ (𝐼‘𝐶) ∈ 𝐶) → ((𝐹‘𝐶)‘((𝐼‘𝐶) − 1)) ∈ ℤ)
64	63	zcnd 9719	. . . . . . . 8 ⊢ ((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ (𝐼‘𝐶) ∈ 𝐶) → ((𝐹‘𝐶)‘((𝐼‘𝐶) − 1)) ∈ ℂ)
65	56, 57, 64	subadd2d 8619	. . . . . . 7 ⊢ ((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ (𝐼‘𝐶) ∈ 𝐶) → ((0 − 1) = ((𝐹‘𝐶)‘((𝐼‘𝐶) − 1)) ↔ (((𝐹‘𝐶)‘((𝐼‘𝐶) − 1)) + 1) = 0))
66	55, 65	mpbird 167	. . . . . 6 ⊢ ((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ (𝐼‘𝐶) ∈ 𝐶) → (0 − 1) = ((𝐹‘𝐶)‘((𝐼‘𝐶) − 1)))
67	49, 66	eqtrid 2279	. . . . 5 ⊢ ((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ (𝐼‘𝐶) ∈ 𝐶) → -1 = ((𝐹‘𝐶)‘((𝐼‘𝐶) − 1)))
68		neg1lt0 9362	. . . . 5 ⊢ -1 < 0
69	67, 68	eqbrtrrdi 4154	. . . 4 ⊢ ((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ (𝐼‘𝐶) ∈ 𝐶) → ((𝐹‘𝐶)‘((𝐼‘𝐶) − 1)) < 0)
70	69	adantlr 477	. . 3 ⊢ (((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ 1 ∈ 𝐶) ∧ (𝐼‘𝐶) ∈ 𝐶) → ((𝐹‘𝐶)‘((𝐼‘𝐶) − 1)) < 0)
71	1, 2, 3, 4, 5, 7, 21, 48, 70	ballotfilemfcc 13177	. 2 ⊢ (((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ 1 ∈ 𝐶) ∧ (𝐼‘𝐶) ∈ 𝐶) → ∃𝑘 ∈ (1...((𝐼‘𝐶) − 1))((𝐹‘𝐶)‘𝑘) = 0)
72	1, 2, 3, 4, 5, 8, 9, 10	ballotfilemimin 13193	. . 3 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → ¬ ∃𝑘 ∈ (1...((𝐼‘𝐶) − 1))((𝐹‘𝐶)‘𝑘) = 0)
73	72	ad2antrr 488	. 2 ⊢ (((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ 1 ∈ 𝐶) ∧ (𝐼‘𝐶) ∈ 𝐶) → ¬ ∃𝑘 ∈ (1...((𝐼‘𝐶) − 1))((𝐹‘𝐶)‘𝑘) = 0)
74	71, 73	pm2.65da 667	1 ⊢ ((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ 1 ∈ 𝐶) → ¬ (𝐼‘𝐶) ∈ 𝐶)

Colors of variables: wff set class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 = wceq 1398 ∈ wcel 2205 ≠ wne 2414 ∀wral 2522 ∃wrex 2523 {crab 2526 ∖ cdif 3211 ∩ cin 3213 𝒫 cpw 3674 class class class wbr 4114 ↦ cmpt 4176 ‘cfv 5357 (class class class)co 6058 Fincfn 6988 infcinf 7287 ℝcr 8142 0cc0 8143 1c1 8144 + caddc 8146 < clt 8324 ≤ cle 8325 − cmin 8460 -cneg 8461 / cdiv 8963 ℕcn 9254 2c2 9305 ℤcz 9594 ℤ_≥cuz 9871 ...cfz 10361 ♯chash 11163

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 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2207 ax-14 2208 ax-ext 2216 ax-coll 4230 ax-sep 4233 ax-nul 4241 ax-pow 4292 ax-pr 4327 ax-un 4559 ax-setind 4664 ax-iinf 4715 ax-cnex 8234 ax-resscn 8235 ax-1cn 8236 ax-1re 8237 ax-icn 8238 ax-addcl 8239 ax-addrcl 8240 ax-mulcl 8241 ax-mulrcl 8242 ax-addcom 8243 ax-mulcom 8244 ax-addass 8245 ax-mulass 8246 ax-distr 8247 ax-i2m1 8248 ax-0lt1 8249 ax-1rid 8250 ax-0id 8251 ax-rnegex 8252 ax-precex 8253 ax-cnre 8254 ax-pre-ltirr 8255 ax-pre-ltwlin 8256 ax-pre-lttrn 8257 ax-pre-apti 8258 ax-pre-ltadd 8259 ax-pre-mulgt0 8260 ax-pre-mulext 8261

This theorem depends on definitions: df-bi 117 df-dc 843 df-3or 1006 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1812 df-eu 2085 df-mo 2086 df-clab 2221 df-cleq 2227 df-clel 2230 df-nfc 2375 df-ne 2415 df-nel 2510 df-ral 2527 df-rex 2528 df-reu 2529 df-rmo 2530 df-rab 2531 df-v 2817 df-sbc 3046 df-csb 3142 df-dif 3216 df-un 3218 df-in 3220 df-ss 3227 df-nul 3513 df-if 3625 df-pw 3676 df-sn 3700 df-pr 3701 df-op 3703 df-uni 3920 df-int 3955 df-iun 3998 df-br 4115 df-opab 4177 df-mpt 4178 df-tr 4214 df-id 4419 df-po 4422 df-iso 4423 df-iord 4492 df-on 4494 df-ilim 4495 df-suc 4497 df-iom 4718 df-xp 4760 df-rel 4761 df-cnv 4762 df-co 4763 df-dm 4764 df-rn 4765 df-res 4766 df-ima 4767 df-iota 5317 df-fun 5359 df-fn 5360 df-f 5361 df-f1 5362 df-fo 5363 df-f1o 5364 df-fv 5365 df-isom 5366 df-riota 6011 df-ov 6061 df-oprab 6062 df-mpo 6063 df-1st 6347 df-2nd 6348 df-recs 6549 df-irdg 6614 df-frec 6635 df-1o 6660 df-oadd 6664 df-er 6780 df-en 6989 df-dom 6990 df-fin 6991 df-sup 7288 df-inf 7289 df-pnf 8326 df-mnf 8327 df-xr 8328 df-ltxr 8329 df-le 8330 df-sub 8462 df-neg 8463 df-reap 8866 df-ap 8873 df-div 8964 df-inn 9255 df-2 9313 df-n0 9514 df-z 9595 df-uz 9872 df-q 9970 df-rp 10005 df-fz 10362 df-fzo 10499 df-ihash 11164

This theorem is referenced by: ballotfilem7 13223

W3C validator