4fvwrd4 - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > 4fvwrd4		Structured version Visualization version GIF version

Theorem 4fvwrd4 13661

Description: The first four function values of a word of length at least 4. (Contributed by Alexander van der Vekens, 18-Nov-2017.)

**Assertion**
Ref	Expression
4fvwrd4	⊢ ((𝐿 ∈ (ℤ_≥‘3) ∧ 𝑃:(0...𝐿)⟶𝑉) → ∃𝑎 ∈ 𝑉 ∃𝑏 ∈ 𝑉 ∃𝑐 ∈ 𝑉 ∃𝑑 ∈ 𝑉 (((𝑃‘0) = 𝑎 ∧ (𝑃‘1) = 𝑏) ∧ ((𝑃‘2) = 𝑐 ∧ (𝑃‘3) = 𝑑)))

Distinct variable groups: 𝑃,𝑎,𝑏,𝑐,𝑑 𝑉,𝑎,𝑏,𝑐,𝑑 Allowed substitution hints: 𝐿(𝑎,𝑏,𝑐,𝑑)

**Proof of Theorem 4fvwrd4**
Step	Hyp	Ref	Expression
1		simpr 483	. . . . . 6 ⊢ ((𝐿 ∈ (ℤ_≥‘3) ∧ 𝑃:(0...𝐿)⟶𝑉) → 𝑃:(0...𝐿)⟶𝑉)
2		0nn0 12525	. . . . . . . . 9 ⊢ 0 ∈ ℕ₀
3		elnn0uz 12905	. . . . . . . . 9 ⊢ (0 ∈ ℕ₀ ↔ 0 ∈ (ℤ_≥‘0))
4	2, 3	mpbi 229	. . . . . . . 8 ⊢ 0 ∈ (ℤ_≥‘0)
5		3nn0 12528	. . . . . . . . . . 11 ⊢ 3 ∈ ℕ₀
6		elnn0uz 12905	. . . . . . . . . . 11 ⊢ (3 ∈ ℕ₀ ↔ 3 ∈ (ℤ_≥‘0))
7	5, 6	mpbi 229	. . . . . . . . . 10 ⊢ 3 ∈ (ℤ_≥‘0)
8		uzss 12883	. . . . . . . . . 10 ⊢ (3 ∈ (ℤ_≥‘0) → (ℤ_≥‘3) ⊆ (ℤ_≥‘0))
9	7, 8	ax-mp 5	. . . . . . . . 9 ⊢ (ℤ_≥‘3) ⊆ (ℤ_≥‘0)
10	9	sseli 3978	. . . . . . . 8 ⊢ (𝐿 ∈ (ℤ_≥‘3) → 𝐿 ∈ (ℤ_≥‘0))
11		eluzfz 13536	. . . . . . . 8 ⊢ ((0 ∈ (ℤ_≥‘0) ∧ 𝐿 ∈ (ℤ_≥‘0)) → 0 ∈ (0...𝐿))
12	4, 10, 11	sylancr 585	. . . . . . 7 ⊢ (𝐿 ∈ (ℤ_≥‘3) → 0 ∈ (0...𝐿))
13	12	adantr 479	. . . . . 6 ⊢ ((𝐿 ∈ (ℤ_≥‘3) ∧ 𝑃:(0...𝐿)⟶𝑉) → 0 ∈ (0...𝐿))
14	1, 13	ffvelcdmd 7100	. . . . 5 ⊢ ((𝐿 ∈ (ℤ_≥‘3) ∧ 𝑃:(0...𝐿)⟶𝑉) → (𝑃‘0) ∈ 𝑉)
15		clel5 3655	. . . . 5 ⊢ ((𝑃‘0) ∈ 𝑉 ↔ ∃𝑎 ∈ 𝑉 (𝑃‘0) = 𝑎)
16	14, 15	sylib 217	. . . 4 ⊢ ((𝐿 ∈ (ℤ_≥‘3) ∧ 𝑃:(0...𝐿)⟶𝑉) → ∃𝑎 ∈ 𝑉 (𝑃‘0) = 𝑎)
17		1eluzge0 12914	. . . . . . . 8 ⊢ 1 ∈ (ℤ_≥‘0)
18		1z 12630	. . . . . . . . . . 11 ⊢ 1 ∈ ℤ
19		3z 12633	. . . . . . . . . . 11 ⊢ 3 ∈ ℤ
20		1le3 12462	. . . . . . . . . . 11 ⊢ 1 ≤ 3
21		eluz2 12866	. . . . . . . . . . 11 ⊢ (3 ∈ (ℤ_≥‘1) ↔ (1 ∈ ℤ ∧ 3 ∈ ℤ ∧ 1 ≤ 3))
22	18, 19, 20, 21	mpbir3an 1338	. . . . . . . . . 10 ⊢ 3 ∈ (ℤ_≥‘1)
23		uzss 12883	. . . . . . . . . 10 ⊢ (3 ∈ (ℤ_≥‘1) → (ℤ_≥‘3) ⊆ (ℤ_≥‘1))
24	22, 23	ax-mp 5	. . . . . . . . 9 ⊢ (ℤ_≥‘3) ⊆ (ℤ_≥‘1)
25	24	sseli 3978	. . . . . . . 8 ⊢ (𝐿 ∈ (ℤ_≥‘3) → 𝐿 ∈ (ℤ_≥‘1))
26		eluzfz 13536	. . . . . . . 8 ⊢ ((1 ∈ (ℤ_≥‘0) ∧ 𝐿 ∈ (ℤ_≥‘1)) → 1 ∈ (0...𝐿))
27	17, 25, 26	sylancr 585	. . . . . . 7 ⊢ (𝐿 ∈ (ℤ_≥‘3) → 1 ∈ (0...𝐿))
28	27	adantr 479	. . . . . 6 ⊢ ((𝐿 ∈ (ℤ_≥‘3) ∧ 𝑃:(0...𝐿)⟶𝑉) → 1 ∈ (0...𝐿))
29	1, 28	ffvelcdmd 7100	. . . . 5 ⊢ ((𝐿 ∈ (ℤ_≥‘3) ∧ 𝑃:(0...𝐿)⟶𝑉) → (𝑃‘1) ∈ 𝑉)
30		clel5 3655	. . . . 5 ⊢ ((𝑃‘1) ∈ 𝑉 ↔ ∃𝑏 ∈ 𝑉 (𝑃‘1) = 𝑏)
31	29, 30	sylib 217	. . . 4 ⊢ ((𝐿 ∈ (ℤ_≥‘3) ∧ 𝑃:(0...𝐿)⟶𝑉) → ∃𝑏 ∈ 𝑉 (𝑃‘1) = 𝑏)
32	16, 31	jca 510	. . 3 ⊢ ((𝐿 ∈ (ℤ_≥‘3) ∧ 𝑃:(0...𝐿)⟶𝑉) → (∃𝑎 ∈ 𝑉 (𝑃‘0) = 𝑎 ∧ ∃𝑏 ∈ 𝑉 (𝑃‘1) = 𝑏))
33		2eluzge0 12915	. . . . . . 7 ⊢ 2 ∈ (ℤ_≥‘0)
34		uzuzle23 12911	. . . . . . 7 ⊢ (𝐿 ∈ (ℤ_≥‘3) → 𝐿 ∈ (ℤ_≥‘2))
35		eluzfz 13536	. . . . . . 7 ⊢ ((2 ∈ (ℤ_≥‘0) ∧ 𝐿 ∈ (ℤ_≥‘2)) → 2 ∈ (0...𝐿))
36	33, 34, 35	sylancr 585	. . . . . 6 ⊢ (𝐿 ∈ (ℤ_≥‘3) → 2 ∈ (0...𝐿))
37	36	adantr 479	. . . . 5 ⊢ ((𝐿 ∈ (ℤ_≥‘3) ∧ 𝑃:(0...𝐿)⟶𝑉) → 2 ∈ (0...𝐿))
38	1, 37	ffvelcdmd 7100	. . . 4 ⊢ ((𝐿 ∈ (ℤ_≥‘3) ∧ 𝑃:(0...𝐿)⟶𝑉) → (𝑃‘2) ∈ 𝑉)
39		clel5 3655	. . . 4 ⊢ ((𝑃‘2) ∈ 𝑉 ↔ ∃𝑐 ∈ 𝑉 (𝑃‘2) = 𝑐)
40	38, 39	sylib 217	. . 3 ⊢ ((𝐿 ∈ (ℤ_≥‘3) ∧ 𝑃:(0...𝐿)⟶𝑉) → ∃𝑐 ∈ 𝑉 (𝑃‘2) = 𝑐)
41		eluzfz 13536	. . . . . . 7 ⊢ ((3 ∈ (ℤ_≥‘0) ∧ 𝐿 ∈ (ℤ_≥‘3)) → 3 ∈ (0...𝐿))
42	7, 41	mpan 688	. . . . . 6 ⊢ (𝐿 ∈ (ℤ_≥‘3) → 3 ∈ (0...𝐿))
43	42	adantr 479	. . . . 5 ⊢ ((𝐿 ∈ (ℤ_≥‘3) ∧ 𝑃:(0...𝐿)⟶𝑉) → 3 ∈ (0...𝐿))
44	1, 43	ffvelcdmd 7100	. . . 4 ⊢ ((𝐿 ∈ (ℤ_≥‘3) ∧ 𝑃:(0...𝐿)⟶𝑉) → (𝑃‘3) ∈ 𝑉)
45		clel5 3655	. . . 4 ⊢ ((𝑃‘3) ∈ 𝑉 ↔ ∃𝑑 ∈ 𝑉 (𝑃‘3) = 𝑑)
46	44, 45	sylib 217	. . 3 ⊢ ((𝐿 ∈ (ℤ_≥‘3) ∧ 𝑃:(0...𝐿)⟶𝑉) → ∃𝑑 ∈ 𝑉 (𝑃‘3) = 𝑑)
47	32, 40, 46	jca32 514	. 2 ⊢ ((𝐿 ∈ (ℤ_≥‘3) ∧ 𝑃:(0...𝐿)⟶𝑉) → ((∃𝑎 ∈ 𝑉 (𝑃‘0) = 𝑎 ∧ ∃𝑏 ∈ 𝑉 (𝑃‘1) = 𝑏) ∧ (∃𝑐 ∈ 𝑉 (𝑃‘2) = 𝑐 ∧ ∃𝑑 ∈ 𝑉 (𝑃‘3) = 𝑑)))
48		r19.42v 3188	. . . . . 6 ⊢ (∃𝑑 ∈ 𝑉 (((𝑃‘0) = 𝑎 ∧ (𝑃‘1) = 𝑏) ∧ ((𝑃‘2) = 𝑐 ∧ (𝑃‘3) = 𝑑)) ↔ (((𝑃‘0) = 𝑎 ∧ (𝑃‘1) = 𝑏) ∧ ∃𝑑 ∈ 𝑉 ((𝑃‘2) = 𝑐 ∧ (𝑃‘3) = 𝑑)))
49		r19.42v 3188	. . . . . . 7 ⊢ (∃𝑑 ∈ 𝑉 ((𝑃‘2) = 𝑐 ∧ (𝑃‘3) = 𝑑) ↔ ((𝑃‘2) = 𝑐 ∧ ∃𝑑 ∈ 𝑉 (𝑃‘3) = 𝑑))
50	49	anbi2i 621	. . . . . 6 ⊢ ((((𝑃‘0) = 𝑎 ∧ (𝑃‘1) = 𝑏) ∧ ∃𝑑 ∈ 𝑉 ((𝑃‘2) = 𝑐 ∧ (𝑃‘3) = 𝑑)) ↔ (((𝑃‘0) = 𝑎 ∧ (𝑃‘1) = 𝑏) ∧ ((𝑃‘2) = 𝑐 ∧ ∃𝑑 ∈ 𝑉 (𝑃‘3) = 𝑑)))
51	48, 50	bitri 274	. . . . 5 ⊢ (∃𝑑 ∈ 𝑉 (((𝑃‘0) = 𝑎 ∧ (𝑃‘1) = 𝑏) ∧ ((𝑃‘2) = 𝑐 ∧ (𝑃‘3) = 𝑑)) ↔ (((𝑃‘0) = 𝑎 ∧ (𝑃‘1) = 𝑏) ∧ ((𝑃‘2) = 𝑐 ∧ ∃𝑑 ∈ 𝑉 (𝑃‘3) = 𝑑)))
52	51	rexbii 3091	. . . 4 ⊢ (∃𝑐 ∈ 𝑉 ∃𝑑 ∈ 𝑉 (((𝑃‘0) = 𝑎 ∧ (𝑃‘1) = 𝑏) ∧ ((𝑃‘2) = 𝑐 ∧ (𝑃‘3) = 𝑑)) ↔ ∃𝑐 ∈ 𝑉 (((𝑃‘0) = 𝑎 ∧ (𝑃‘1) = 𝑏) ∧ ((𝑃‘2) = 𝑐 ∧ ∃𝑑 ∈ 𝑉 (𝑃‘3) = 𝑑)))
53	52	2rexbii 3126	. . 3 ⊢ (∃𝑎 ∈ 𝑉 ∃𝑏 ∈ 𝑉 ∃𝑐 ∈ 𝑉 ∃𝑑 ∈ 𝑉 (((𝑃‘0) = 𝑎 ∧ (𝑃‘1) = 𝑏) ∧ ((𝑃‘2) = 𝑐 ∧ (𝑃‘3) = 𝑑)) ↔ ∃𝑎 ∈ 𝑉 ∃𝑏 ∈ 𝑉 ∃𝑐 ∈ 𝑉 (((𝑃‘0) = 𝑎 ∧ (𝑃‘1) = 𝑏) ∧ ((𝑃‘2) = 𝑐 ∧ ∃𝑑 ∈ 𝑉 (𝑃‘3) = 𝑑)))
54		r19.42v 3188	. . . . 5 ⊢ (∃𝑐 ∈ 𝑉 (((𝑃‘0) = 𝑎 ∧ (𝑃‘1) = 𝑏) ∧ ((𝑃‘2) = 𝑐 ∧ ∃𝑑 ∈ 𝑉 (𝑃‘3) = 𝑑)) ↔ (((𝑃‘0) = 𝑎 ∧ (𝑃‘1) = 𝑏) ∧ ∃𝑐 ∈ 𝑉 ((𝑃‘2) = 𝑐 ∧ ∃𝑑 ∈ 𝑉 (𝑃‘3) = 𝑑)))
55		r19.41v 3186	. . . . . 6 ⊢ (∃𝑐 ∈ 𝑉 ((𝑃‘2) = 𝑐 ∧ ∃𝑑 ∈ 𝑉 (𝑃‘3) = 𝑑) ↔ (∃𝑐 ∈ 𝑉 (𝑃‘2) = 𝑐 ∧ ∃𝑑 ∈ 𝑉 (𝑃‘3) = 𝑑))
56	55	anbi2i 621	. . . . 5 ⊢ ((((𝑃‘0) = 𝑎 ∧ (𝑃‘1) = 𝑏) ∧ ∃𝑐 ∈ 𝑉 ((𝑃‘2) = 𝑐 ∧ ∃𝑑 ∈ 𝑉 (𝑃‘3) = 𝑑)) ↔ (((𝑃‘0) = 𝑎 ∧ (𝑃‘1) = 𝑏) ∧ (∃𝑐 ∈ 𝑉 (𝑃‘2) = 𝑐 ∧ ∃𝑑 ∈ 𝑉 (𝑃‘3) = 𝑑)))
57	54, 56	bitri 274	. . . 4 ⊢ (∃𝑐 ∈ 𝑉 (((𝑃‘0) = 𝑎 ∧ (𝑃‘1) = 𝑏) ∧ ((𝑃‘2) = 𝑐 ∧ ∃𝑑 ∈ 𝑉 (𝑃‘3) = 𝑑)) ↔ (((𝑃‘0) = 𝑎 ∧ (𝑃‘1) = 𝑏) ∧ (∃𝑐 ∈ 𝑉 (𝑃‘2) = 𝑐 ∧ ∃𝑑 ∈ 𝑉 (𝑃‘3) = 𝑑)))
58	57	2rexbii 3126	. . 3 ⊢ (∃𝑎 ∈ 𝑉 ∃𝑏 ∈ 𝑉 ∃𝑐 ∈ 𝑉 (((𝑃‘0) = 𝑎 ∧ (𝑃‘1) = 𝑏) ∧ ((𝑃‘2) = 𝑐 ∧ ∃𝑑 ∈ 𝑉 (𝑃‘3) = 𝑑)) ↔ ∃𝑎 ∈ 𝑉 ∃𝑏 ∈ 𝑉 (((𝑃‘0) = 𝑎 ∧ (𝑃‘1) = 𝑏) ∧ (∃𝑐 ∈ 𝑉 (𝑃‘2) = 𝑐 ∧ ∃𝑑 ∈ 𝑉 (𝑃‘3) = 𝑑)))
59		r19.41v 3186	. . . . . 6 ⊢ (∃𝑏 ∈ 𝑉 (((𝑃‘0) = 𝑎 ∧ (𝑃‘1) = 𝑏) ∧ (∃𝑐 ∈ 𝑉 (𝑃‘2) = 𝑐 ∧ ∃𝑑 ∈ 𝑉 (𝑃‘3) = 𝑑)) ↔ (∃𝑏 ∈ 𝑉 ((𝑃‘0) = 𝑎 ∧ (𝑃‘1) = 𝑏) ∧ (∃𝑐 ∈ 𝑉 (𝑃‘2) = 𝑐 ∧ ∃𝑑 ∈ 𝑉 (𝑃‘3) = 𝑑)))
60		r19.42v 3188	. . . . . . 7 ⊢ (∃𝑏 ∈ 𝑉 ((𝑃‘0) = 𝑎 ∧ (𝑃‘1) = 𝑏) ↔ ((𝑃‘0) = 𝑎 ∧ ∃𝑏 ∈ 𝑉 (𝑃‘1) = 𝑏))
61	60	anbi1i 622	. . . . . 6 ⊢ ((∃𝑏 ∈ 𝑉 ((𝑃‘0) = 𝑎 ∧ (𝑃‘1) = 𝑏) ∧ (∃𝑐 ∈ 𝑉 (𝑃‘2) = 𝑐 ∧ ∃𝑑 ∈ 𝑉 (𝑃‘3) = 𝑑)) ↔ (((𝑃‘0) = 𝑎 ∧ ∃𝑏 ∈ 𝑉 (𝑃‘1) = 𝑏) ∧ (∃𝑐 ∈ 𝑉 (𝑃‘2) = 𝑐 ∧ ∃𝑑 ∈ 𝑉 (𝑃‘3) = 𝑑)))
62	59, 61	bitri 274	. . . . 5 ⊢ (∃𝑏 ∈ 𝑉 (((𝑃‘0) = 𝑎 ∧ (𝑃‘1) = 𝑏) ∧ (∃𝑐 ∈ 𝑉 (𝑃‘2) = 𝑐 ∧ ∃𝑑 ∈ 𝑉 (𝑃‘3) = 𝑑)) ↔ (((𝑃‘0) = 𝑎 ∧ ∃𝑏 ∈ 𝑉 (𝑃‘1) = 𝑏) ∧ (∃𝑐 ∈ 𝑉 (𝑃‘2) = 𝑐 ∧ ∃𝑑 ∈ 𝑉 (𝑃‘3) = 𝑑)))
63	62	rexbii 3091	. . . 4 ⊢ (∃𝑎 ∈ 𝑉 ∃𝑏 ∈ 𝑉 (((𝑃‘0) = 𝑎 ∧ (𝑃‘1) = 𝑏) ∧ (∃𝑐 ∈ 𝑉 (𝑃‘2) = 𝑐 ∧ ∃𝑑 ∈ 𝑉 (𝑃‘3) = 𝑑)) ↔ ∃𝑎 ∈ 𝑉 (((𝑃‘0) = 𝑎 ∧ ∃𝑏 ∈ 𝑉 (𝑃‘1) = 𝑏) ∧ (∃𝑐 ∈ 𝑉 (𝑃‘2) = 𝑐 ∧ ∃𝑑 ∈ 𝑉 (𝑃‘3) = 𝑑)))
64		r19.41v 3186	. . . 4 ⊢ (∃𝑎 ∈ 𝑉 (((𝑃‘0) = 𝑎 ∧ ∃𝑏 ∈ 𝑉 (𝑃‘1) = 𝑏) ∧ (∃𝑐 ∈ 𝑉 (𝑃‘2) = 𝑐 ∧ ∃𝑑 ∈ 𝑉 (𝑃‘3) = 𝑑)) ↔ (∃𝑎 ∈ 𝑉 ((𝑃‘0) = 𝑎 ∧ ∃𝑏 ∈ 𝑉 (𝑃‘1) = 𝑏) ∧ (∃𝑐 ∈ 𝑉 (𝑃‘2) = 𝑐 ∧ ∃𝑑 ∈ 𝑉 (𝑃‘3) = 𝑑)))
65		r19.41v 3186	. . . . 5 ⊢ (∃𝑎 ∈ 𝑉 ((𝑃‘0) = 𝑎 ∧ ∃𝑏 ∈ 𝑉 (𝑃‘1) = 𝑏) ↔ (∃𝑎 ∈ 𝑉 (𝑃‘0) = 𝑎 ∧ ∃𝑏 ∈ 𝑉 (𝑃‘1) = 𝑏))
66	65	anbi1i 622	. . . 4 ⊢ ((∃𝑎 ∈ 𝑉 ((𝑃‘0) = 𝑎 ∧ ∃𝑏 ∈ 𝑉 (𝑃‘1) = 𝑏) ∧ (∃𝑐 ∈ 𝑉 (𝑃‘2) = 𝑐 ∧ ∃𝑑 ∈ 𝑉 (𝑃‘3) = 𝑑)) ↔ ((∃𝑎 ∈ 𝑉 (𝑃‘0) = 𝑎 ∧ ∃𝑏 ∈ 𝑉 (𝑃‘1) = 𝑏) ∧ (∃𝑐 ∈ 𝑉 (𝑃‘2) = 𝑐 ∧ ∃𝑑 ∈ 𝑉 (𝑃‘3) = 𝑑)))
67	63, 64, 66	3bitri 296	. . 3 ⊢ (∃𝑎 ∈ 𝑉 ∃𝑏 ∈ 𝑉 (((𝑃‘0) = 𝑎 ∧ (𝑃‘1) = 𝑏) ∧ (∃𝑐 ∈ 𝑉 (𝑃‘2) = 𝑐 ∧ ∃𝑑 ∈ 𝑉 (𝑃‘3) = 𝑑)) ↔ ((∃𝑎 ∈ 𝑉 (𝑃‘0) = 𝑎 ∧ ∃𝑏 ∈ 𝑉 (𝑃‘1) = 𝑏) ∧ (∃𝑐 ∈ 𝑉 (𝑃‘2) = 𝑐 ∧ ∃𝑑 ∈ 𝑉 (𝑃‘3) = 𝑑)))
68	53, 58, 67	3bitri 296	. 2 ⊢ (∃𝑎 ∈ 𝑉 ∃𝑏 ∈ 𝑉 ∃𝑐 ∈ 𝑉 ∃𝑑 ∈ 𝑉 (((𝑃‘0) = 𝑎 ∧ (𝑃‘1) = 𝑏) ∧ ((𝑃‘2) = 𝑐 ∧ (𝑃‘3) = 𝑑)) ↔ ((∃𝑎 ∈ 𝑉 (𝑃‘0) = 𝑎 ∧ ∃𝑏 ∈ 𝑉 (𝑃‘1) = 𝑏) ∧ (∃𝑐 ∈ 𝑉 (𝑃‘2) = 𝑐 ∧ ∃𝑑 ∈ 𝑉 (𝑃‘3) = 𝑑)))
69	47, 68	sylibr 233	1 ⊢ ((𝐿 ∈ (ℤ_≥‘3) ∧ 𝑃:(0...𝐿)⟶𝑉) → ∃𝑎 ∈ 𝑉 ∃𝑏 ∈ 𝑉 ∃𝑐 ∈ 𝑉 ∃𝑑 ∈ 𝑉 (((𝑃‘0) = 𝑎 ∧ (𝑃‘1) = 𝑏) ∧ ((𝑃‘2) = 𝑐 ∧ (𝑃‘3) = 𝑑)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 394 = wceq 1533 ∈ wcel 2098 ∃wrex 3067 ⊆ wss 3949 class class class wbr 5152 ⟶wf 6549 ‘cfv 6553 (class class class)co 7426 0cc0 11146 1c1 11147 ≤ cle 11287 2c2 12305 3c3 12306 ℕ₀cn0 12510 ℤcz 12596 ℤ_≥cuz 12860 ...cfz 13524

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-sep 5303 ax-nul 5310 ax-pow 5369 ax-pr 5433 ax-un 7746 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

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-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-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-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-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-er 8731 df-en 8971 df-dom 8972 df-sdom 8973 df-pnf 11288 df-mnf 11289 df-xr 11290 df-ltxr 11291 df-le 11292 df-sub 11484 df-neg 11485 df-nn 12251 df-2 12313 df-3 12314 df-n0 12511 df-z 12597 df-uz 12861 df-fz 13525

This theorem is referenced by: (None)

W3C validator