ballotlemic - Mathbox for Thierry Arnoux

	Mathbox for Thierry Arnoux		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > ballotlemic		Structured version Visualization version GIF version

Theorem ballotlemic 35018

Description: If the first vote is for B, the vote on the first tie is for A. (Contributed by Thierry Arnoux, 1-Dec-2016.)

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

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

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

**Proof of Theorem ballotlemic**
Step	Hyp	Ref	Expression
1		ballotth.m	. . 3 ⊢ 𝑀 ∈ ℕ
2		ballotth.n	. . 3 ⊢ 𝑁 ∈ ℕ
3		ballotth.o	. . 3 ⊢ 𝑂 = {𝑐 ∈ 𝒫 (1...(𝑀 + 𝑁)) ∣ (♯‘𝑐) = 𝑀}
4		ballotth.p	. . 3 ⊢ 𝑃 = (𝑥 ∈ 𝒫 𝑂 ↦ ((♯‘𝑥) / (♯‘𝑂)))
5		ballotth.f	. . 3 ⊢ 𝐹 = (𝑐 ∈ 𝑂 ↦ (𝑖 ∈ ℤ ↦ ((♯‘((1...𝑖) ∩ 𝑐)) − (♯‘((1...𝑖) ∖ 𝑐)))))
6		eldifi 4078	. . . 4 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → 𝐶 ∈ 𝑂)
7	6	ad2antrr 739	. . 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	ballotlemiex 35013	. . . . . . . . 9 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → ((𝐼‘𝐶) ∈ (1...(𝑀 + 𝑁)) ∧ ((𝐹‘𝐶)‘(𝐼‘𝐶)) = 0))
12	11	simpld 500	. . . . . . . 8 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → (𝐼‘𝐶) ∈ (1...(𝑀 + 𝑁)))
13		elfznn 13608	. . . . . . . 8 ⊢ ((𝐼‘𝐶) ∈ (1...(𝑀 + 𝑁)) → (𝐼‘𝐶) ∈ ℕ)
14	12, 13	syl 18	. . . . . . 7 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → (𝐼‘𝐶) ∈ ℕ)
15	14	adantr 486	. . . . . 6 ⊢ ((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ ¬ 1 ∈ 𝐶) → (𝐼‘𝐶) ∈ ℕ)
16	1, 2, 3, 4, 5, 8, 9, 10	ballotlemi1 35014	. . . . . 6 ⊢ ((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ ¬ 1 ∈ 𝐶) → (𝐼‘𝐶) ≠ 1)
17		eluz2b3 12971	. . . . . 6 ⊢ ((𝐼‘𝐶) ∈ (ℤ_≥‘2) ↔ ((𝐼‘𝐶) ∈ ℕ ∧ (𝐼‘𝐶) ≠ 1))
18	15, 16, 17	sylanbrc 595	. . . . 5 ⊢ ((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ ¬ 1 ∈ 𝐶) → (𝐼‘𝐶) ∈ (ℤ_≥‘2))
19		uz2m1nn 12972	. . . . 5 ⊢ ((𝐼‘𝐶) ∈ (ℤ_≥‘2) → ((𝐼‘𝐶) − 1) ∈ ℕ)
20	18, 19	syl 18	. . . 4 ⊢ ((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ ¬ 1 ∈ 𝐶) → ((𝐼‘𝐶) − 1) ∈ ℕ)
21	20	adantr 486	. . 3 ⊢ (((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ ¬ 1 ∈ 𝐶) ∧ ¬ (𝐼‘𝐶) ∈ 𝐶) → ((𝐼‘𝐶) − 1) ∈ ℕ)
22		elnnuz 12927	. . . . . . 7 ⊢ (((𝐼‘𝐶) − 1) ∈ ℕ ↔ ((𝐼‘𝐶) − 1) ∈ (ℤ_≥‘1))
23	22	biimpi 219	. . . . . 6 ⊢ (((𝐼‘𝐶) − 1) ∈ ℕ → ((𝐼‘𝐶) − 1) ∈ (ℤ_≥‘1))
24		eluzfz1 13585	. . . . . 6 ⊢ (((𝐼‘𝐶) − 1) ∈ (ℤ_≥‘1) → 1 ∈ (1...((𝐼‘𝐶) − 1)))
25	20, 23, 24	3syl 19	. . . . 5 ⊢ ((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ ¬ 1 ∈ 𝐶) → 1 ∈ (1...((𝐼‘𝐶) − 1)))
26	25	adantr 486	. . . 4 ⊢ (((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ ¬ 1 ∈ 𝐶) ∧ ¬ (𝐼‘𝐶) ∈ 𝐶) → 1 ∈ (1...((𝐼‘𝐶) − 1)))
27		1nn 12268	. . . . . . . . . . 11 ⊢ 1 ∈ ℕ
28	27	a1i 11	. . . . . . . . . 10 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → 1 ∈ ℕ)
29	1, 2, 3, 4, 5, 6, 28	ballotlemfp1 35003	. . . . . . . . 9 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → ((¬ 1 ∈ 𝐶 → ((𝐹‘𝐶)‘1) = (((𝐹‘𝐶)‘(1 − 1)) − 1)) ∧ (1 ∈ 𝐶 → ((𝐹‘𝐶)‘1) = (((𝐹‘𝐶)‘(1 − 1)) + 1))))
30	29	simpld 500	. . . . . . . 8 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → (¬ 1 ∈ 𝐶 → ((𝐹‘𝐶)‘1) = (((𝐹‘𝐶)‘(1 − 1)) − 1)))
31	30	imp 412	. . . . . . 7 ⊢ ((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ ¬ 1 ∈ 𝐶) → ((𝐹‘𝐶)‘1) = (((𝐹‘𝐶)‘(1 − 1)) − 1))
32		1m1e0 12337	. . . . . . . . . 10 ⊢ (1 − 1) = 0
33	32	fveq2i 6881	. . . . . . . . 9 ⊢ ((𝐹‘𝐶)‘(1 − 1)) = ((𝐹‘𝐶)‘0)
34	33	oveq1i 7423	. . . . . . . 8 ⊢ (((𝐹‘𝐶)‘(1 − 1)) − 1) = (((𝐹‘𝐶)‘0) − 1)
35	34	a1i 11	. . . . . . 7 ⊢ ((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ ¬ 1 ∈ 𝐶) → (((𝐹‘𝐶)‘(1 − 1)) − 1) = (((𝐹‘𝐶)‘0) − 1))
36	1, 2, 3, 4, 5	ballotlemfval0 35007	. . . . . . . . . 10 ⊢ (𝐶 ∈ 𝑂 → ((𝐹‘𝐶)‘0) = 0)
37	6, 36	syl 18	. . . . . . . . 9 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → ((𝐹‘𝐶)‘0) = 0)
38	37	adantr 486	. . . . . . . 8 ⊢ ((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ ¬ 1 ∈ 𝐶) → ((𝐹‘𝐶)‘0) = 0)
39	38	oveq1d 7428	. . . . . . 7 ⊢ ((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ ¬ 1 ∈ 𝐶) → (((𝐹‘𝐶)‘0) − 1) = (0 − 1))
40	31, 35, 39	3eqtrrd 2800	. . . . . 6 ⊢ ((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ ¬ 1 ∈ 𝐶) → (0 − 1) = ((𝐹‘𝐶)‘1))
41		0le1 11761	. . . . . . 7 ⊢ 0 ≤ 1
42		0re 11234	. . . . . . . 8 ⊢ 0 ∈ ℝ
43		1re 11232	. . . . . . . 8 ⊢ 1 ∈ ℝ
44		suble0 11752	. . . . . . . 8 ⊢ ((0 ∈ ℝ ∧ 1 ∈ ℝ) → ((0 − 1) ≤ 0 ↔ 0 ≤ 1))
45	42, 43, 44	mp2an 705	. . . . . . 7 ⊢ ((0 − 1) ≤ 0 ↔ 0 ≤ 1)
46	41, 45	mpbir 234	. . . . . 6 ⊢ (0 − 1) ≤ 0
47	40, 46	eqbrtrrdi 5145	. . . . 5 ⊢ ((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ ¬ 1 ∈ 𝐶) → ((𝐹‘𝐶)‘1) ≤ 0)
48	47	adantr 486	. . . 4 ⊢ (((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ ¬ 1 ∈ 𝐶) ∧ ¬ (𝐼‘𝐶) ∈ 𝐶) → ((𝐹‘𝐶)‘1) ≤ 0)
49		fveq2 6878	. . . . . 6 ⊢ (𝑖 = 1 → ((𝐹‘𝐶)‘𝑖) = ((𝐹‘𝐶)‘1))
50	49	breq1d 5113	. . . . 5 ⊢ (𝑖 = 1 → (((𝐹‘𝐶)‘𝑖) ≤ 0 ↔ ((𝐹‘𝐶)‘1) ≤ 0))
51	50	rspcev 3576	. . . 4 ⊢ ((1 ∈ (1...((𝐼‘𝐶) − 1)) ∧ ((𝐹‘𝐶)‘1) ≤ 0) → ∃𝑖 ∈ (1...((𝐼‘𝐶) − 1))((𝐹‘𝐶)‘𝑖) ≤ 0)
52	26, 48, 51	syl2anc 596	. . 3 ⊢ (((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ ¬ 1 ∈ 𝐶) ∧ ¬ (𝐼‘𝐶) ∈ 𝐶) → ∃𝑖 ∈ (1...((𝐼‘𝐶) − 1))((𝐹‘𝐶)‘𝑖) ≤ 0)
53		0lt1 11760	. . . . 5 ⊢ 0 < 1
54		1p0e1 12387	. . . . . 6 ⊢ (1 + 0) = 1
55	1, 2, 3, 4, 5, 6, 14	ballotlemfp1 35003	. . . . . . . . . 10 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → ((¬ (𝐼‘𝐶) ∈ 𝐶 → ((𝐹‘𝐶)‘(𝐼‘𝐶)) = (((𝐹‘𝐶)‘((𝐼‘𝐶) − 1)) − 1)) ∧ ((𝐼‘𝐶) ∈ 𝐶 → ((𝐹‘𝐶)‘(𝐼‘𝐶)) = (((𝐹‘𝐶)‘((𝐼‘𝐶) − 1)) + 1))))
56	55	simpld 500	. . . . . . . . 9 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → (¬ (𝐼‘𝐶) ∈ 𝐶 → ((𝐹‘𝐶)‘(𝐼‘𝐶)) = (((𝐹‘𝐶)‘((𝐼‘𝐶) − 1)) − 1)))
57	56	imp 412	. . . . . . . 8 ⊢ ((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ ¬ (𝐼‘𝐶) ∈ 𝐶) → ((𝐹‘𝐶)‘(𝐼‘𝐶)) = (((𝐹‘𝐶)‘((𝐼‘𝐶) − 1)) − 1))
58	11	simprd 501	. . . . . . . . 9 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → ((𝐹‘𝐶)‘(𝐼‘𝐶)) = 0)
59	58	adantr 486	. . . . . . . 8 ⊢ ((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ ¬ (𝐼‘𝐶) ∈ 𝐶) → ((𝐹‘𝐶)‘(𝐼‘𝐶)) = 0)
60	57, 59	eqtr3d 2797	. . . . . . 7 ⊢ ((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ ¬ (𝐼‘𝐶) ∈ 𝐶) → (((𝐹‘𝐶)‘((𝐼‘𝐶) − 1)) − 1) = 0)
61	6	adantr 486	. . . . . . . . . 10 ⊢ ((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ ¬ (𝐼‘𝐶) ∈ 𝐶) → 𝐶 ∈ 𝑂)
62	14	nnzd 12641	. . . . . . . . . . . 12 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → (𝐼‘𝐶) ∈ ℤ)
63	62	adantr 486	. . . . . . . . . . 11 ⊢ ((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ ¬ (𝐼‘𝐶) ∈ 𝐶) → (𝐼‘𝐶) ∈ ℤ)
64		1zzd 12649	. . . . . . . . . . 11 ⊢ ((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ ¬ (𝐼‘𝐶) ∈ 𝐶) → 1 ∈ ℤ)
65	63, 64	zsubcld 12730	. . . . . . . . . 10 ⊢ ((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ ¬ (𝐼‘𝐶) ∈ 𝐶) → ((𝐼‘𝐶) − 1) ∈ ℤ)
66	1, 2, 3, 4, 5, 61, 65	ballotlemfelz 35002	. . . . . . . . 9 ⊢ ((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ ¬ (𝐼‘𝐶) ∈ 𝐶) → ((𝐹‘𝐶)‘((𝐼‘𝐶) − 1)) ∈ ℤ)
67	66	zcnd 12726	. . . . . . . 8 ⊢ ((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ ¬ (𝐼‘𝐶) ∈ 𝐶) → ((𝐹‘𝐶)‘((𝐼‘𝐶) − 1)) ∈ ℂ)
68		1cnd 11226	. . . . . . . 8 ⊢ ((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ ¬ (𝐼‘𝐶) ∈ 𝐶) → 1 ∈ ℂ)
69		0cnd 11223	. . . . . . . 8 ⊢ ((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ ¬ (𝐼‘𝐶) ∈ 𝐶) → 0 ∈ ℂ)
70	67, 68, 69	subaddd 11611	. . . . . . 7 ⊢ ((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ ¬ (𝐼‘𝐶) ∈ 𝐶) → ((((𝐹‘𝐶)‘((𝐼‘𝐶) − 1)) − 1) = 0 ↔ (1 + 0) = ((𝐹‘𝐶)‘((𝐼‘𝐶) − 1))))
71	60, 70	mpbid 235	. . . . . 6 ⊢ ((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ ¬ (𝐼‘𝐶) ∈ 𝐶) → (1 + 0) = ((𝐹‘𝐶)‘((𝐼‘𝐶) − 1)))
72	54, 71	eqtr3id 2809	. . . . 5 ⊢ ((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ ¬ (𝐼‘𝐶) ∈ 𝐶) → 1 = ((𝐹‘𝐶)‘((𝐼‘𝐶) − 1)))
73	53, 72	breqtrid 5142	. . . 4 ⊢ ((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ ¬ (𝐼‘𝐶) ∈ 𝐶) → 0 < ((𝐹‘𝐶)‘((𝐼‘𝐶) − 1)))
74	73	adantlr 728	. . 3 ⊢ (((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ ¬ 1 ∈ 𝐶) ∧ ¬ (𝐼‘𝐶) ∈ 𝐶) → 0 < ((𝐹‘𝐶)‘((𝐼‘𝐶) − 1)))
75	1, 2, 3, 4, 5, 7, 21, 52, 74	ballotlemfc0 35004	. 2 ⊢ (((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ ¬ 1 ∈ 𝐶) ∧ ¬ (𝐼‘𝐶) ∈ 𝐶) → ∃𝑘 ∈ (1...((𝐼‘𝐶) − 1))((𝐹‘𝐶)‘𝑘) = 0)
76	1, 2, 3, 4, 5, 8, 9, 10	ballotlemimin 35017	. . 3 ⊢ (𝐶 ∈ (𝑂 ∖ 𝐸) → ¬ ∃𝑘 ∈ (1...((𝐼‘𝐶) − 1))((𝐹‘𝐶)‘𝑘) = 0)
77	76	ad2antrr 739	. 2 ⊢ (((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ ¬ 1 ∈ 𝐶) ∧ ¬ (𝐼‘𝐶) ∈ 𝐶) → ¬ ∃𝑘 ∈ (1...((𝐼‘𝐶) − 1))((𝐹‘𝐶)‘𝑘) = 0)
78	75, 77	condan 830	1 ⊢ ((𝐶 ∈ (𝑂 ∖ 𝐸) ∧ ¬ 1 ∈ 𝐶) → (𝐼‘𝐶) ∈ 𝐶)

Colors of variables: wff setvar class

This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ≠ wne 2955 ∀wral 3076 ∃wrex 3086 {crab 3412 ∖ cdif 3896 ∩ cin 3898 𝒫 cpw 4557 class class class wbr 5103 ↦ cmpt 5186 ‘cfv 6533 (class class class)co 7413 infcinf 9411 ℝcr 11123 0cc0 11124 1c1 11125 + caddc 11127 < clt 11267 ≤ cle 11268 − cmin 11465 / cdiv 11895 ℕcn 12257 2c2 12319 ℤcz 12615 ℤ_≥cuz 12887 ...cfz 13561 ♯chash 14394

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 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-rep 5232 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7736 ax-cnex 11180 ax-resscn 11181 ax-1cn 11182 ax-icn 11183 ax-addcl 11184 ax-addrcl 11185 ax-mulcl 11186 ax-mulrcl 11187 ax-mulcom 11188 ax-addass 11189 ax-mulass 11190 ax-distr 11191 ax-i2m1 11192 ax-1ne0 11193 ax-1rid 11194 ax-rnegex 11195 ax-rrecex 11196 ax-cnre 11197 ax-pre-lttri 11198 ax-pre-lttrn 11199 ax-pre-ltadd 11200 ax-pre-mulgt0 11201

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 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-int 4908 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6299 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-riota 7370 df-ov 7416 df-oprab 7417 df-mpo 7418 df-om 7863 df-1st 7986 df-2nd 7987 df-frecs 8280 df-wrecs 8311 df-recs 8360 df-rdg 8399 df-1o 8455 df-oadd 8459 df-er 8696 df-en 8953 df-dom 8954 df-sdom 8955 df-fin 8956 df-sup 9412 df-inf 9413 df-dju 9906 df-card 9944 df-pnf 11269 df-mnf 11270 df-xr 11271 df-ltxr 11272 df-le 11273 df-sub 11467 df-neg 11468 df-nn 12258 df-2 12327 df-n0 12529 df-z 12616 df-uz 12888 df-fz 13562 df-hash 14395

This theorem is used by: ballotlem7 35047

W3C validator