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 13705

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 484	. . . . . 6 ⊢ ((𝐿 ∈ (ℤ_≥‘3) ∧ 𝑃:(0...𝐿)⟶𝑉) → 𝑃:(0...𝐿)⟶𝑉)
2		0nn0 12568	. . . . . . . . 9 ⊢ 0 ∈ ℕ₀
3		elnn0uz 12948	. . . . . . . . 9 ⊢ (0 ∈ ℕ₀ ↔ 0 ∈ (ℤ_≥‘0))
4	2, 3	mpbi 230	. . . . . . . 8 ⊢ 0 ∈ (ℤ_≥‘0)
5		3nn0 12571	. . . . . . . . . . 11 ⊢ 3 ∈ ℕ₀
6		elnn0uz 12948	. . . . . . . . . . 11 ⊢ (3 ∈ ℕ₀ ↔ 3 ∈ (ℤ_≥‘0))
7	5, 6	mpbi 230	. . . . . . . . . 10 ⊢ 3 ∈ (ℤ_≥‘0)
8		uzss 12926	. . . . . . . . . 10 ⊢ (3 ∈ (ℤ_≥‘0) → (ℤ_≥‘3) ⊆ (ℤ_≥‘0))
9	7, 8	ax-mp 5	. . . . . . . . 9 ⊢ (ℤ_≥‘3) ⊆ (ℤ_≥‘0)
10	9	sseli 4004	. . . . . . . 8 ⊢ (𝐿 ∈ (ℤ_≥‘3) → 𝐿 ∈ (ℤ_≥‘0))
11		eluzfz 13579	. . . . . . . 8 ⊢ ((0 ∈ (ℤ_≥‘0) ∧ 𝐿 ∈ (ℤ_≥‘0)) → 0 ∈ (0...𝐿))
12	4, 10, 11	sylancr 586	. . . . . . 7 ⊢ (𝐿 ∈ (ℤ_≥‘3) → 0 ∈ (0...𝐿))
13	12	adantr 480	. . . . . 6 ⊢ ((𝐿 ∈ (ℤ_≥‘3) ∧ 𝑃:(0...𝐿)⟶𝑉) → 0 ∈ (0...𝐿))
14	1, 13	ffvelcdmd 7119	. . . . 5 ⊢ ((𝐿 ∈ (ℤ_≥‘3) ∧ 𝑃:(0...𝐿)⟶𝑉) → (𝑃‘0) ∈ 𝑉)
15		clel5 3678	. . . . 5 ⊢ ((𝑃‘0) ∈ 𝑉 ↔ ∃𝑎 ∈ 𝑉 (𝑃‘0) = 𝑎)
16	14, 15	sylib 218	. . . 4 ⊢ ((𝐿 ∈ (ℤ_≥‘3) ∧ 𝑃:(0...𝐿)⟶𝑉) → ∃𝑎 ∈ 𝑉 (𝑃‘0) = 𝑎)
17		1eluzge0 12957	. . . . . . . 8 ⊢ 1 ∈ (ℤ_≥‘0)
18		1z 12673	. . . . . . . . . . 11 ⊢ 1 ∈ ℤ
19		3z 12676	. . . . . . . . . . 11 ⊢ 3 ∈ ℤ
20		1le3 12505	. . . . . . . . . . 11 ⊢ 1 ≤ 3
21		eluz2 12909	. . . . . . . . . . 11 ⊢ (3 ∈ (ℤ_≥‘1) ↔ (1 ∈ ℤ ∧ 3 ∈ ℤ ∧ 1 ≤ 3))
22	18, 19, 20, 21	mpbir3an 1341	. . . . . . . . . 10 ⊢ 3 ∈ (ℤ_≥‘1)
23		uzss 12926	. . . . . . . . . 10 ⊢ (3 ∈ (ℤ_≥‘1) → (ℤ_≥‘3) ⊆ (ℤ_≥‘1))
24	22, 23	ax-mp 5	. . . . . . . . 9 ⊢ (ℤ_≥‘3) ⊆ (ℤ_≥‘1)
25	24	sseli 4004	. . . . . . . 8 ⊢ (𝐿 ∈ (ℤ_≥‘3) → 𝐿 ∈ (ℤ_≥‘1))
26		eluzfz 13579	. . . . . . . 8 ⊢ ((1 ∈ (ℤ_≥‘0) ∧ 𝐿 ∈ (ℤ_≥‘1)) → 1 ∈ (0...𝐿))
27	17, 25, 26	sylancr 586	. . . . . . 7 ⊢ (𝐿 ∈ (ℤ_≥‘3) → 1 ∈ (0...𝐿))
28	27	adantr 480	. . . . . 6 ⊢ ((𝐿 ∈ (ℤ_≥‘3) ∧ 𝑃:(0...𝐿)⟶𝑉) → 1 ∈ (0...𝐿))
29	1, 28	ffvelcdmd 7119	. . . . 5 ⊢ ((𝐿 ∈ (ℤ_≥‘3) ∧ 𝑃:(0...𝐿)⟶𝑉) → (𝑃‘1) ∈ 𝑉)
30		clel5 3678	. . . . 5 ⊢ ((𝑃‘1) ∈ 𝑉 ↔ ∃𝑏 ∈ 𝑉 (𝑃‘1) = 𝑏)
31	29, 30	sylib 218	. . . 4 ⊢ ((𝐿 ∈ (ℤ_≥‘3) ∧ 𝑃:(0...𝐿)⟶𝑉) → ∃𝑏 ∈ 𝑉 (𝑃‘1) = 𝑏)
32	16, 31	jca 511	. . 3 ⊢ ((𝐿 ∈ (ℤ_≥‘3) ∧ 𝑃:(0...𝐿)⟶𝑉) → (∃𝑎 ∈ 𝑉 (𝑃‘0) = 𝑎 ∧ ∃𝑏 ∈ 𝑉 (𝑃‘1) = 𝑏))
33		2eluzge0 12958	. . . . . . 7 ⊢ 2 ∈ (ℤ_≥‘0)
34		uzuzle23 12954	. . . . . . 7 ⊢ (𝐿 ∈ (ℤ_≥‘3) → 𝐿 ∈ (ℤ_≥‘2))
35		eluzfz 13579	. . . . . . 7 ⊢ ((2 ∈ (ℤ_≥‘0) ∧ 𝐿 ∈ (ℤ_≥‘2)) → 2 ∈ (0...𝐿))
36	33, 34, 35	sylancr 586	. . . . . 6 ⊢ (𝐿 ∈ (ℤ_≥‘3) → 2 ∈ (0...𝐿))
37	36	adantr 480	. . . . 5 ⊢ ((𝐿 ∈ (ℤ_≥‘3) ∧ 𝑃:(0...𝐿)⟶𝑉) → 2 ∈ (0...𝐿))
38	1, 37	ffvelcdmd 7119	. . . 4 ⊢ ((𝐿 ∈ (ℤ_≥‘3) ∧ 𝑃:(0...𝐿)⟶𝑉) → (𝑃‘2) ∈ 𝑉)
39		clel5 3678	. . . 4 ⊢ ((𝑃‘2) ∈ 𝑉 ↔ ∃𝑐 ∈ 𝑉 (𝑃‘2) = 𝑐)
40	38, 39	sylib 218	. . 3 ⊢ ((𝐿 ∈ (ℤ_≥‘3) ∧ 𝑃:(0...𝐿)⟶𝑉) → ∃𝑐 ∈ 𝑉 (𝑃‘2) = 𝑐)
41		eluzfz 13579	. . . . . . 7 ⊢ ((3 ∈ (ℤ_≥‘0) ∧ 𝐿 ∈ (ℤ_≥‘3)) → 3 ∈ (0...𝐿))
42	7, 41	mpan 689	. . . . . 6 ⊢ (𝐿 ∈ (ℤ_≥‘3) → 3 ∈ (0...𝐿))
43	42	adantr 480	. . . . 5 ⊢ ((𝐿 ∈ (ℤ_≥‘3) ∧ 𝑃:(0...𝐿)⟶𝑉) → 3 ∈ (0...𝐿))
44	1, 43	ffvelcdmd 7119	. . . 4 ⊢ ((𝐿 ∈ (ℤ_≥‘3) ∧ 𝑃:(0...𝐿)⟶𝑉) → (𝑃‘3) ∈ 𝑉)
45		clel5 3678	. . . 4 ⊢ ((𝑃‘3) ∈ 𝑉 ↔ ∃𝑑 ∈ 𝑉 (𝑃‘3) = 𝑑)
46	44, 45	sylib 218	. . 3 ⊢ ((𝐿 ∈ (ℤ_≥‘3) ∧ 𝑃:(0...𝐿)⟶𝑉) → ∃𝑑 ∈ 𝑉 (𝑃‘3) = 𝑑)
47	32, 40, 46	jca32 515	. 2 ⊢ ((𝐿 ∈ (ℤ_≥‘3) ∧ 𝑃:(0...𝐿)⟶𝑉) → ((∃𝑎 ∈ 𝑉 (𝑃‘0) = 𝑎 ∧ ∃𝑏 ∈ 𝑉 (𝑃‘1) = 𝑏) ∧ (∃𝑐 ∈ 𝑉 (𝑃‘2) = 𝑐 ∧ ∃𝑑 ∈ 𝑉 (𝑃‘3) = 𝑑)))
48		r19.42v 3197	. . . . . 6 ⊢ (∃𝑑 ∈ 𝑉 (((𝑃‘0) = 𝑎 ∧ (𝑃‘1) = 𝑏) ∧ ((𝑃‘2) = 𝑐 ∧ (𝑃‘3) = 𝑑)) ↔ (((𝑃‘0) = 𝑎 ∧ (𝑃‘1) = 𝑏) ∧ ∃𝑑 ∈ 𝑉 ((𝑃‘2) = 𝑐 ∧ (𝑃‘3) = 𝑑)))
49		r19.42v 3197	. . . . . . 7 ⊢ (∃𝑑 ∈ 𝑉 ((𝑃‘2) = 𝑐 ∧ (𝑃‘3) = 𝑑) ↔ ((𝑃‘2) = 𝑐 ∧ ∃𝑑 ∈ 𝑉 (𝑃‘3) = 𝑑))
50	49	anbi2i 622	. . . . . 6 ⊢ ((((𝑃‘0) = 𝑎 ∧ (𝑃‘1) = 𝑏) ∧ ∃𝑑 ∈ 𝑉 ((𝑃‘2) = 𝑐 ∧ (𝑃‘3) = 𝑑)) ↔ (((𝑃‘0) = 𝑎 ∧ (𝑃‘1) = 𝑏) ∧ ((𝑃‘2) = 𝑐 ∧ ∃𝑑 ∈ 𝑉 (𝑃‘3) = 𝑑)))
51	48, 50	bitri 275	. . . . 5 ⊢ (∃𝑑 ∈ 𝑉 (((𝑃‘0) = 𝑎 ∧ (𝑃‘1) = 𝑏) ∧ ((𝑃‘2) = 𝑐 ∧ (𝑃‘3) = 𝑑)) ↔ (((𝑃‘0) = 𝑎 ∧ (𝑃‘1) = 𝑏) ∧ ((𝑃‘2) = 𝑐 ∧ ∃𝑑 ∈ 𝑉 (𝑃‘3) = 𝑑)))
52	51	rexbii 3100	. . . 4 ⊢ (∃𝑐 ∈ 𝑉 ∃𝑑 ∈ 𝑉 (((𝑃‘0) = 𝑎 ∧ (𝑃‘1) = 𝑏) ∧ ((𝑃‘2) = 𝑐 ∧ (𝑃‘3) = 𝑑)) ↔ ∃𝑐 ∈ 𝑉 (((𝑃‘0) = 𝑎 ∧ (𝑃‘1) = 𝑏) ∧ ((𝑃‘2) = 𝑐 ∧ ∃𝑑 ∈ 𝑉 (𝑃‘3) = 𝑑)))
53	52	2rexbii 3135	. . 3 ⊢ (∃𝑎 ∈ 𝑉 ∃𝑏 ∈ 𝑉 ∃𝑐 ∈ 𝑉 ∃𝑑 ∈ 𝑉 (((𝑃‘0) = 𝑎 ∧ (𝑃‘1) = 𝑏) ∧ ((𝑃‘2) = 𝑐 ∧ (𝑃‘3) = 𝑑)) ↔ ∃𝑎 ∈ 𝑉 ∃𝑏 ∈ 𝑉 ∃𝑐 ∈ 𝑉 (((𝑃‘0) = 𝑎 ∧ (𝑃‘1) = 𝑏) ∧ ((𝑃‘2) = 𝑐 ∧ ∃𝑑 ∈ 𝑉 (𝑃‘3) = 𝑑)))
54		r19.42v 3197	. . . . 5 ⊢ (∃𝑐 ∈ 𝑉 (((𝑃‘0) = 𝑎 ∧ (𝑃‘1) = 𝑏) ∧ ((𝑃‘2) = 𝑐 ∧ ∃𝑑 ∈ 𝑉 (𝑃‘3) = 𝑑)) ↔ (((𝑃‘0) = 𝑎 ∧ (𝑃‘1) = 𝑏) ∧ ∃𝑐 ∈ 𝑉 ((𝑃‘2) = 𝑐 ∧ ∃𝑑 ∈ 𝑉 (𝑃‘3) = 𝑑)))
55		r19.41v 3195	. . . . . 6 ⊢ (∃𝑐 ∈ 𝑉 ((𝑃‘2) = 𝑐 ∧ ∃𝑑 ∈ 𝑉 (𝑃‘3) = 𝑑) ↔ (∃𝑐 ∈ 𝑉 (𝑃‘2) = 𝑐 ∧ ∃𝑑 ∈ 𝑉 (𝑃‘3) = 𝑑))
56	55	anbi2i 622	. . . . 5 ⊢ ((((𝑃‘0) = 𝑎 ∧ (𝑃‘1) = 𝑏) ∧ ∃𝑐 ∈ 𝑉 ((𝑃‘2) = 𝑐 ∧ ∃𝑑 ∈ 𝑉 (𝑃‘3) = 𝑑)) ↔ (((𝑃‘0) = 𝑎 ∧ (𝑃‘1) = 𝑏) ∧ (∃𝑐 ∈ 𝑉 (𝑃‘2) = 𝑐 ∧ ∃𝑑 ∈ 𝑉 (𝑃‘3) = 𝑑)))
57	54, 56	bitri 275	. . . 4 ⊢ (∃𝑐 ∈ 𝑉 (((𝑃‘0) = 𝑎 ∧ (𝑃‘1) = 𝑏) ∧ ((𝑃‘2) = 𝑐 ∧ ∃𝑑 ∈ 𝑉 (𝑃‘3) = 𝑑)) ↔ (((𝑃‘0) = 𝑎 ∧ (𝑃‘1) = 𝑏) ∧ (∃𝑐 ∈ 𝑉 (𝑃‘2) = 𝑐 ∧ ∃𝑑 ∈ 𝑉 (𝑃‘3) = 𝑑)))
58	57	2rexbii 3135	. . 3 ⊢ (∃𝑎 ∈ 𝑉 ∃𝑏 ∈ 𝑉 ∃𝑐 ∈ 𝑉 (((𝑃‘0) = 𝑎 ∧ (𝑃‘1) = 𝑏) ∧ ((𝑃‘2) = 𝑐 ∧ ∃𝑑 ∈ 𝑉 (𝑃‘3) = 𝑑)) ↔ ∃𝑎 ∈ 𝑉 ∃𝑏 ∈ 𝑉 (((𝑃‘0) = 𝑎 ∧ (𝑃‘1) = 𝑏) ∧ (∃𝑐 ∈ 𝑉 (𝑃‘2) = 𝑐 ∧ ∃𝑑 ∈ 𝑉 (𝑃‘3) = 𝑑)))
59		r19.41v 3195	. . . . . 6 ⊢ (∃𝑏 ∈ 𝑉 (((𝑃‘0) = 𝑎 ∧ (𝑃‘1) = 𝑏) ∧ (∃𝑐 ∈ 𝑉 (𝑃‘2) = 𝑐 ∧ ∃𝑑 ∈ 𝑉 (𝑃‘3) = 𝑑)) ↔ (∃𝑏 ∈ 𝑉 ((𝑃‘0) = 𝑎 ∧ (𝑃‘1) = 𝑏) ∧ (∃𝑐 ∈ 𝑉 (𝑃‘2) = 𝑐 ∧ ∃𝑑 ∈ 𝑉 (𝑃‘3) = 𝑑)))
60		r19.42v 3197	. . . . . . 7 ⊢ (∃𝑏 ∈ 𝑉 ((𝑃‘0) = 𝑎 ∧ (𝑃‘1) = 𝑏) ↔ ((𝑃‘0) = 𝑎 ∧ ∃𝑏 ∈ 𝑉 (𝑃‘1) = 𝑏))
61	60	anbi1i 623	. . . . . 6 ⊢ ((∃𝑏 ∈ 𝑉 ((𝑃‘0) = 𝑎 ∧ (𝑃‘1) = 𝑏) ∧ (∃𝑐 ∈ 𝑉 (𝑃‘2) = 𝑐 ∧ ∃𝑑 ∈ 𝑉 (𝑃‘3) = 𝑑)) ↔ (((𝑃‘0) = 𝑎 ∧ ∃𝑏 ∈ 𝑉 (𝑃‘1) = 𝑏) ∧ (∃𝑐 ∈ 𝑉 (𝑃‘2) = 𝑐 ∧ ∃𝑑 ∈ 𝑉 (𝑃‘3) = 𝑑)))
62	59, 61	bitri 275	. . . . 5 ⊢ (∃𝑏 ∈ 𝑉 (((𝑃‘0) = 𝑎 ∧ (𝑃‘1) = 𝑏) ∧ (∃𝑐 ∈ 𝑉 (𝑃‘2) = 𝑐 ∧ ∃𝑑 ∈ 𝑉 (𝑃‘3) = 𝑑)) ↔ (((𝑃‘0) = 𝑎 ∧ ∃𝑏 ∈ 𝑉 (𝑃‘1) = 𝑏) ∧ (∃𝑐 ∈ 𝑉 (𝑃‘2) = 𝑐 ∧ ∃𝑑 ∈ 𝑉 (𝑃‘3) = 𝑑)))
63	62	rexbii 3100	. . . 4 ⊢ (∃𝑎 ∈ 𝑉 ∃𝑏 ∈ 𝑉 (((𝑃‘0) = 𝑎 ∧ (𝑃‘1) = 𝑏) ∧ (∃𝑐 ∈ 𝑉 (𝑃‘2) = 𝑐 ∧ ∃𝑑 ∈ 𝑉 (𝑃‘3) = 𝑑)) ↔ ∃𝑎 ∈ 𝑉 (((𝑃‘0) = 𝑎 ∧ ∃𝑏 ∈ 𝑉 (𝑃‘1) = 𝑏) ∧ (∃𝑐 ∈ 𝑉 (𝑃‘2) = 𝑐 ∧ ∃𝑑 ∈ 𝑉 (𝑃‘3) = 𝑑)))
64		r19.41v 3195	. . . 4 ⊢ (∃𝑎 ∈ 𝑉 (((𝑃‘0) = 𝑎 ∧ ∃𝑏 ∈ 𝑉 (𝑃‘1) = 𝑏) ∧ (∃𝑐 ∈ 𝑉 (𝑃‘2) = 𝑐 ∧ ∃𝑑 ∈ 𝑉 (𝑃‘3) = 𝑑)) ↔ (∃𝑎 ∈ 𝑉 ((𝑃‘0) = 𝑎 ∧ ∃𝑏 ∈ 𝑉 (𝑃‘1) = 𝑏) ∧ (∃𝑐 ∈ 𝑉 (𝑃‘2) = 𝑐 ∧ ∃𝑑 ∈ 𝑉 (𝑃‘3) = 𝑑)))
65		r19.41v 3195	. . . . 5 ⊢ (∃𝑎 ∈ 𝑉 ((𝑃‘0) = 𝑎 ∧ ∃𝑏 ∈ 𝑉 (𝑃‘1) = 𝑏) ↔ (∃𝑎 ∈ 𝑉 (𝑃‘0) = 𝑎 ∧ ∃𝑏 ∈ 𝑉 (𝑃‘1) = 𝑏))
66	65	anbi1i 623	. . . 4 ⊢ ((∃𝑎 ∈ 𝑉 ((𝑃‘0) = 𝑎 ∧ ∃𝑏 ∈ 𝑉 (𝑃‘1) = 𝑏) ∧ (∃𝑐 ∈ 𝑉 (𝑃‘2) = 𝑐 ∧ ∃𝑑 ∈ 𝑉 (𝑃‘3) = 𝑑)) ↔ ((∃𝑎 ∈ 𝑉 (𝑃‘0) = 𝑎 ∧ ∃𝑏 ∈ 𝑉 (𝑃‘1) = 𝑏) ∧ (∃𝑐 ∈ 𝑉 (𝑃‘2) = 𝑐 ∧ ∃𝑑 ∈ 𝑉 (𝑃‘3) = 𝑑)))
67	63, 64, 66	3bitri 297	. . 3 ⊢ (∃𝑎 ∈ 𝑉 ∃𝑏 ∈ 𝑉 (((𝑃‘0) = 𝑎 ∧ (𝑃‘1) = 𝑏) ∧ (∃𝑐 ∈ 𝑉 (𝑃‘2) = 𝑐 ∧ ∃𝑑 ∈ 𝑉 (𝑃‘3) = 𝑑)) ↔ ((∃𝑎 ∈ 𝑉 (𝑃‘0) = 𝑎 ∧ ∃𝑏 ∈ 𝑉 (𝑃‘1) = 𝑏) ∧ (∃𝑐 ∈ 𝑉 (𝑃‘2) = 𝑐 ∧ ∃𝑑 ∈ 𝑉 (𝑃‘3) = 𝑑)))
68	53, 58, 67	3bitri 297	. 2 ⊢ (∃𝑎 ∈ 𝑉 ∃𝑏 ∈ 𝑉 ∃𝑐 ∈ 𝑉 ∃𝑑 ∈ 𝑉 (((𝑃‘0) = 𝑎 ∧ (𝑃‘1) = 𝑏) ∧ ((𝑃‘2) = 𝑐 ∧ (𝑃‘3) = 𝑑)) ↔ ((∃𝑎 ∈ 𝑉 (𝑃‘0) = 𝑎 ∧ ∃𝑏 ∈ 𝑉 (𝑃‘1) = 𝑏) ∧ (∃𝑐 ∈ 𝑉 (𝑃‘2) = 𝑐 ∧ ∃𝑑 ∈ 𝑉 (𝑃‘3) = 𝑑)))
69	47, 68	sylibr 234	1 ⊢ ((𝐿 ∈ (ℤ_≥‘3) ∧ 𝑃:(0...𝐿)⟶𝑉) → ∃𝑎 ∈ 𝑉 ∃𝑏 ∈ 𝑉 ∃𝑐 ∈ 𝑉 ∃𝑑 ∈ 𝑉 (((𝑃‘0) = 𝑎 ∧ (𝑃‘1) = 𝑏) ∧ ((𝑃‘2) = 𝑐 ∧ (𝑃‘3) = 𝑑)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 = wceq 1537 ∈ wcel 2108 ∃wrex 3076 ⊆ wss 3976 class class class wbr 5166 ⟶wf 6569 ‘cfv 6573 (class class class)co 7448 0cc0 11184 1c1 11185 ≤ cle 11325 2c2 12348 3c3 12349 ℕ₀cn0 12553 ℤcz 12639 ℤ_≥cuz 12903 ...cfz 13567

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2158 ax-12 2178 ax-ext 2711 ax-sep 5317 ax-nul 5324 ax-pow 5383 ax-pr 5447 ax-un 7770 ax-cnex 11240 ax-resscn 11241 ax-1cn 11242 ax-icn 11243 ax-addcl 11244 ax-addrcl 11245 ax-mulcl 11246 ax-mulrcl 11247 ax-mulcom 11248 ax-addass 11249 ax-mulass 11250 ax-distr 11251 ax-i2m1 11252 ax-1ne0 11253 ax-1rid 11254 ax-rnegex 11255 ax-rrecex 11256 ax-cnre 11257 ax-pre-lttri 11258 ax-pre-lttrn 11259 ax-pre-ltadd 11260 ax-pre-mulgt0 11261

This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3or 1088 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2065 df-mo 2543 df-eu 2572 df-clab 2718 df-cleq 2732 df-clel 2819 df-nfc 2895 df-ne 2947 df-nel 3053 df-ral 3068 df-rex 3077 df-reu 3389 df-rab 3444 df-v 3490 df-sbc 3805 df-csb 3922 df-dif 3979 df-un 3981 df-in 3983 df-ss 3993 df-pss 3996 df-nul 4353 df-if 4549 df-pw 4624 df-sn 4649 df-pr 4651 df-op 4655 df-uni 4932 df-iun 5017 df-br 5167 df-opab 5229 df-mpt 5250 df-tr 5284 df-id 5593 df-eprel 5599 df-po 5607 df-so 5608 df-fr 5652 df-we 5654 df-xp 5706 df-rel 5707 df-cnv 5708 df-co 5709 df-dm 5710 df-rn 5711 df-res 5712 df-ima 5713 df-pred 6332 df-ord 6398 df-on 6399 df-lim 6400 df-suc 6401 df-iota 6525 df-fun 6575 df-fn 6576 df-f 6577 df-f1 6578 df-fo 6579 df-f1o 6580 df-fv 6581 df-riota 7404 df-ov 7451 df-oprab 7452 df-mpo 7453 df-om 7904 df-1st 8030 df-2nd 8031 df-frecs 8322 df-wrecs 8353 df-recs 8427 df-rdg 8466 df-er 8763 df-en 9004 df-dom 9005 df-sdom 9006 df-pnf 11326 df-mnf 11327 df-xr 11328 df-ltxr 11329 df-le 11330 df-sub 11522 df-neg 11523 df-nn 12294 df-2 12356 df-3 12357 df-n0 12554 df-z 12640 df-uz 12904 df-fz 13568

This theorem is referenced by: (None)

W3C validator