relexp0a - Mathbox for Richard Penner

	Mathbox for Richard Penner		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > relexp0a		Structured version Visualization version GIF version

Theorem relexp0a 44470

Description: Absorption law for zeroth power of a relation. (Contributed by RP, 17-Jun-2020.)

**Assertion**
Ref	Expression
relexp0a	⊢ ((𝐴 ∈ 𝑉 ∧ 𝑁 ∈ ℕ₀) → ((𝐴↑_𝑟𝑁)↑_𝑟0) ⊆ (𝐴↑_𝑟0))

Proof of Theorem relexp0a Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		elnn0 12510	. . 3 ⊢ (𝑁 ∈ ℕ₀ ↔ (𝑁 ∈ ℕ ∨ 𝑁 = 0))
2		oveq2 7418	. . . . . . . 8 ⊢ (𝑥 = 1 → (𝐴↑_𝑟𝑥) = (𝐴↑_𝑟1))
3	2	oveq1d 7425	. . . . . . 7 ⊢ (𝑥 = 1 → ((𝐴↑_𝑟𝑥)↑_𝑟0) = ((𝐴↑_𝑟1)↑_𝑟0))
4	3	sseq1d 3968	. . . . . 6 ⊢ (𝑥 = 1 → (((𝐴↑_𝑟𝑥)↑_𝑟0) ⊆ (𝐴↑_𝑟0) ↔ ((𝐴↑_𝑟1)↑_𝑟0) ⊆ (𝐴↑_𝑟0)))
5	4	imbi2d 343	. . . . 5 ⊢ (𝑥 = 1 → ((𝐴 ∈ 𝑉 → ((𝐴↑_𝑟𝑥)↑_𝑟0) ⊆ (𝐴↑_𝑟0)) ↔ (𝐴 ∈ 𝑉 → ((𝐴↑_𝑟1)↑_𝑟0) ⊆ (𝐴↑_𝑟0))))
6		oveq2 7418	. . . . . . . 8 ⊢ (𝑥 = 𝑦 → (𝐴↑_𝑟𝑥) = (𝐴↑_𝑟𝑦))
7	6	oveq1d 7425	. . . . . . 7 ⊢ (𝑥 = 𝑦 → ((𝐴↑_𝑟𝑥)↑_𝑟0) = ((𝐴↑_𝑟𝑦)↑_𝑟0))
8	7	sseq1d 3968	. . . . . 6 ⊢ (𝑥 = 𝑦 → (((𝐴↑_𝑟𝑥)↑_𝑟0) ⊆ (𝐴↑_𝑟0) ↔ ((𝐴↑_𝑟𝑦)↑_𝑟0) ⊆ (𝐴↑_𝑟0)))
9	8	imbi2d 343	. . . . 5 ⊢ (𝑥 = 𝑦 → ((𝐴 ∈ 𝑉 → ((𝐴↑_𝑟𝑥)↑_𝑟0) ⊆ (𝐴↑_𝑟0)) ↔ (𝐴 ∈ 𝑉 → ((𝐴↑_𝑟𝑦)↑_𝑟0) ⊆ (𝐴↑_𝑟0))))
10		oveq2 7418	. . . . . . . 8 ⊢ (𝑥 = (𝑦 + 1) → (𝐴↑_𝑟𝑥) = (𝐴↑_𝑟(𝑦 + 1)))
11	10	oveq1d 7425	. . . . . . 7 ⊢ (𝑥 = (𝑦 + 1) → ((𝐴↑_𝑟𝑥)↑_𝑟0) = ((𝐴↑_𝑟(𝑦 + 1))↑_𝑟0))
12	11	sseq1d 3968	. . . . . 6 ⊢ (𝑥 = (𝑦 + 1) → (((𝐴↑_𝑟𝑥)↑_𝑟0) ⊆ (𝐴↑_𝑟0) ↔ ((𝐴↑_𝑟(𝑦 + 1))↑_𝑟0) ⊆ (𝐴↑_𝑟0)))
13	12	imbi2d 343	. . . . 5 ⊢ (𝑥 = (𝑦 + 1) → ((𝐴 ∈ 𝑉 → ((𝐴↑_𝑟𝑥)↑_𝑟0) ⊆ (𝐴↑_𝑟0)) ↔ (𝐴 ∈ 𝑉 → ((𝐴↑_𝑟(𝑦 + 1))↑_𝑟0) ⊆ (𝐴↑_𝑟0))))
14		oveq2 7418	. . . . . . . 8 ⊢ (𝑥 = 𝑁 → (𝐴↑_𝑟𝑥) = (𝐴↑_𝑟𝑁))
15	14	oveq1d 7425	. . . . . . 7 ⊢ (𝑥 = 𝑁 → ((𝐴↑_𝑟𝑥)↑_𝑟0) = ((𝐴↑_𝑟𝑁)↑_𝑟0))
16	15	sseq1d 3968	. . . . . 6 ⊢ (𝑥 = 𝑁 → (((𝐴↑_𝑟𝑥)↑_𝑟0) ⊆ (𝐴↑_𝑟0) ↔ ((𝐴↑_𝑟𝑁)↑_𝑟0) ⊆ (𝐴↑_𝑟0)))
17	16	imbi2d 343	. . . . 5 ⊢ (𝑥 = 𝑁 → ((𝐴 ∈ 𝑉 → ((𝐴↑_𝑟𝑥)↑_𝑟0) ⊆ (𝐴↑_𝑟0)) ↔ (𝐴 ∈ 𝑉 → ((𝐴↑_𝑟𝑁)↑_𝑟0) ⊆ (𝐴↑_𝑟0))))
18		relexp1g 15068	. . . . . . 7 ⊢ (𝐴 ∈ 𝑉 → (𝐴↑_𝑟1) = 𝐴)
19	18	oveq1d 7425	. . . . . 6 ⊢ (𝐴 ∈ 𝑉 → ((𝐴↑_𝑟1)↑_𝑟0) = (𝐴↑_𝑟0))
20		ssid 3959	. . . . . 6 ⊢ (𝐴↑_𝑟0) ⊆ (𝐴↑_𝑟0)
21	19, 20	eqsstrdi 3981	. . . . 5 ⊢ (𝐴 ∈ 𝑉 → ((𝐴↑_𝑟1)↑_𝑟0) ⊆ (𝐴↑_𝑟0))
22		simp2 1155	. . . . . . . . 9 ⊢ ((𝑦 ∈ ℕ ∧ 𝐴 ∈ 𝑉 ∧ ((𝐴↑_𝑟𝑦)↑_𝑟0) ⊆ (𝐴↑_𝑟0)) → 𝐴 ∈ 𝑉)
23		simp1 1154	. . . . . . . . 9 ⊢ ((𝑦 ∈ ℕ ∧ 𝐴 ∈ 𝑉 ∧ ((𝐴↑_𝑟𝑦)↑_𝑟0) ⊆ (𝐴↑_𝑟0)) → 𝑦 ∈ ℕ)
24		relexpsucnnr 15067	. . . . . . . . . 10 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑦 ∈ ℕ) → (𝐴↑_𝑟(𝑦 + 1)) = ((𝐴↑_𝑟𝑦) ∘ 𝐴))
25	24	oveq1d 7425	. . . . . . . . 9 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑦 ∈ ℕ) → ((𝐴↑_𝑟(𝑦 + 1))↑_𝑟0) = (((𝐴↑_𝑟𝑦) ∘ 𝐴)↑_𝑟0))
26	22, 23, 25	syl2anc 595	. . . . . . . 8 ⊢ ((𝑦 ∈ ℕ ∧ 𝐴 ∈ 𝑉 ∧ ((𝐴↑_𝑟𝑦)↑_𝑟0) ⊆ (𝐴↑_𝑟0)) → ((𝐴↑_𝑟(𝑦 + 1))↑_𝑟0) = (((𝐴↑_𝑟𝑦) ∘ 𝐴)↑_𝑟0))
27		ovex 7443	. . . . . . . . . . . . 13 ⊢ (𝐴↑_𝑟𝑦) ∈ V
28		coexg 7922	. . . . . . . . . . . . 13 ⊢ (((𝐴↑_𝑟𝑦) ∈ V ∧ 𝐴 ∈ 𝑉) → ((𝐴↑_𝑟𝑦) ∘ 𝐴) ∈ V)
29	27, 28	mpan 702	. . . . . . . . . . . 12 ⊢ (𝐴 ∈ 𝑉 → ((𝐴↑_𝑟𝑦) ∘ 𝐴) ∈ V)
30		relexp0g 15064	. . . . . . . . . . . 12 ⊢ (((𝐴↑_𝑟𝑦) ∘ 𝐴) ∈ V → (((𝐴↑_𝑟𝑦) ∘ 𝐴)↑_𝑟0) = ( I ↾ (dom ((𝐴↑_𝑟𝑦) ∘ 𝐴) ∪ ran ((𝐴↑_𝑟𝑦) ∘ 𝐴))))
31	29, 30	syl 18	. . . . . . . . . . 11 ⊢ (𝐴 ∈ 𝑉 → (((𝐴↑_𝑟𝑦) ∘ 𝐴)↑_𝑟0) = ( I ↾ (dom ((𝐴↑_𝑟𝑦) ∘ 𝐴) ∪ ran ((𝐴↑_𝑟𝑦) ∘ 𝐴))))
32		dmcoss 5965	. . . . . . . . . . . . 13 ⊢ dom ((𝐴↑_𝑟𝑦) ∘ 𝐴) ⊆ dom 𝐴
33		rncoss 5967	. . . . . . . . . . . . 13 ⊢ ran ((𝐴↑_𝑟𝑦) ∘ 𝐴) ⊆ ran (𝐴↑_𝑟𝑦)
34		unss12 4141	. . . . . . . . . . . . 13 ⊢ ((dom ((𝐴↑_𝑟𝑦) ∘ 𝐴) ⊆ dom 𝐴 ∧ ran ((𝐴↑_𝑟𝑦) ∘ 𝐴) ⊆ ran (𝐴↑_𝑟𝑦)) → (dom ((𝐴↑_𝑟𝑦) ∘ 𝐴) ∪ ran ((𝐴↑_𝑟𝑦) ∘ 𝐴)) ⊆ (dom 𝐴 ∪ ran (𝐴↑_𝑟𝑦)))
35	32, 33, 34	mp2an 704	. . . . . . . . . . . 12 ⊢ (dom ((𝐴↑_𝑟𝑦) ∘ 𝐴) ∪ ran ((𝐴↑_𝑟𝑦) ∘ 𝐴)) ⊆ (dom 𝐴 ∪ ran (𝐴↑_𝑟𝑦))
36		ssres2 6003	. . . . . . . . . . . 12 ⊢ ((dom ((𝐴↑_𝑟𝑦) ∘ 𝐴) ∪ ran ((𝐴↑_𝑟𝑦) ∘ 𝐴)) ⊆ (dom 𝐴 ∪ ran (𝐴↑_𝑟𝑦)) → ( I ↾ (dom ((𝐴↑_𝑟𝑦) ∘ 𝐴) ∪ ran ((𝐴↑_𝑟𝑦) ∘ 𝐴))) ⊆ ( I ↾ (dom 𝐴 ∪ ran (𝐴↑_𝑟𝑦))))
37	35, 36	ax-mp 5	. . . . . . . . . . 11 ⊢ ( I ↾ (dom ((𝐴↑_𝑟𝑦) ∘ 𝐴) ∪ ran ((𝐴↑_𝑟𝑦) ∘ 𝐴))) ⊆ ( I ↾ (dom 𝐴 ∪ ran (𝐴↑_𝑟𝑦)))
38	31, 37	eqsstrdi 3981	. . . . . . . . . 10 ⊢ (𝐴 ∈ 𝑉 → (((𝐴↑_𝑟𝑦) ∘ 𝐴)↑_𝑟0) ⊆ ( I ↾ (dom 𝐴 ∪ ran (𝐴↑_𝑟𝑦))))
39	22, 38	syl 18	. . . . . . . . 9 ⊢ ((𝑦 ∈ ℕ ∧ 𝐴 ∈ 𝑉 ∧ ((𝐴↑_𝑟𝑦)↑_𝑟0) ⊆ (𝐴↑_𝑟0)) → (((𝐴↑_𝑟𝑦) ∘ 𝐴)↑_𝑟0) ⊆ ( I ↾ (dom 𝐴 ∪ ran (𝐴↑_𝑟𝑦))))
40		resundi 5992	. . . . . . . . . . 11 ⊢ ( I ↾ (dom 𝐴 ∪ ran (𝐴↑_𝑟𝑦))) = (( I ↾ dom 𝐴) ∪ ( I ↾ ran (𝐴↑_𝑟𝑦)))
41		ssun1 4131	. . . . . . . . . . . . . . 15 ⊢ dom 𝐴 ⊆ (dom 𝐴 ∪ ran 𝐴)
42		ssres2 6003	. . . . . . . . . . . . . . 15 ⊢ (dom 𝐴 ⊆ (dom 𝐴 ∪ ran 𝐴) → ( I ↾ dom 𝐴) ⊆ ( I ↾ (dom 𝐴 ∪ ran 𝐴)))
43	41, 42	ax-mp 5	. . . . . . . . . . . . . 14 ⊢ ( I ↾ dom 𝐴) ⊆ ( I ↾ (dom 𝐴 ∪ ran 𝐴))
44		relexp0g 15064	. . . . . . . . . . . . . 14 ⊢ (𝐴 ∈ 𝑉 → (𝐴↑_𝑟0) = ( I ↾ (dom 𝐴 ∪ ran 𝐴)))
45	43, 44	sseqtrrid 3980	. . . . . . . . . . . . 13 ⊢ (𝐴 ∈ 𝑉 → ( I ↾ dom 𝐴) ⊆ (𝐴↑_𝑟0))
46	45	adantr 485	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ 𝑉 ∧ ((𝐴↑_𝑟𝑦)↑_𝑟0) ⊆ (𝐴↑_𝑟0)) → ( I ↾ dom 𝐴) ⊆ (𝐴↑_𝑟0))
47		ssun2 4132	. . . . . . . . . . . . . . 15 ⊢ ran (𝐴↑_𝑟𝑦) ⊆ (dom (𝐴↑_𝑟𝑦) ∪ ran (𝐴↑_𝑟𝑦))
48		ssres2 6003	. . . . . . . . . . . . . . 15 ⊢ (ran (𝐴↑_𝑟𝑦) ⊆ (dom (𝐴↑_𝑟𝑦) ∪ ran (𝐴↑_𝑟𝑦)) → ( I ↾ ran (𝐴↑_𝑟𝑦)) ⊆ ( I ↾ (dom (𝐴↑_𝑟𝑦) ∪ ran (𝐴↑_𝑟𝑦))))
49	47, 48	ax-mp 5	. . . . . . . . . . . . . 14 ⊢ ( I ↾ ran (𝐴↑_𝑟𝑦)) ⊆ ( I ↾ (dom (𝐴↑_𝑟𝑦) ∪ ran (𝐴↑_𝑟𝑦)))
50		relexp0g 15064	. . . . . . . . . . . . . . 15 ⊢ ((𝐴↑_𝑟𝑦) ∈ V → ((𝐴↑_𝑟𝑦)↑_𝑟0) = ( I ↾ (dom (𝐴↑_𝑟𝑦) ∪ ran (𝐴↑_𝑟𝑦))))
51	27, 50	ax-mp 5	. . . . . . . . . . . . . 14 ⊢ ((𝐴↑_𝑟𝑦)↑_𝑟0) = ( I ↾ (dom (𝐴↑_𝑟𝑦) ∪ ran (𝐴↑_𝑟𝑦)))
52	49, 51	sseqtrri 3986	. . . . . . . . . . . . 13 ⊢ ( I ↾ ran (𝐴↑_𝑟𝑦)) ⊆ ((𝐴↑_𝑟𝑦)↑_𝑟0)
53		simpr 489	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∈ 𝑉 ∧ ((𝐴↑_𝑟𝑦)↑_𝑟0) ⊆ (𝐴↑_𝑟0)) → ((𝐴↑_𝑟𝑦)↑_𝑟0) ⊆ (𝐴↑_𝑟0))
54	52, 53	sstrid 3948	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ 𝑉 ∧ ((𝐴↑_𝑟𝑦)↑_𝑟0) ⊆ (𝐴↑_𝑟0)) → ( I ↾ ran (𝐴↑_𝑟𝑦)) ⊆ (𝐴↑_𝑟0))
55	46, 54	unssd 4145	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ 𝑉 ∧ ((𝐴↑_𝑟𝑦)↑_𝑟0) ⊆ (𝐴↑_𝑟0)) → (( I ↾ dom 𝐴) ∪ ( I ↾ ran (𝐴↑_𝑟𝑦))) ⊆ (𝐴↑_𝑟0))
56	40, 55	eqsstrid 3975	. . . . . . . . . 10 ⊢ ((𝐴 ∈ 𝑉 ∧ ((𝐴↑_𝑟𝑦)↑_𝑟0) ⊆ (𝐴↑_𝑟0)) → ( I ↾ (dom 𝐴 ∪ ran (𝐴↑_𝑟𝑦))) ⊆ (𝐴↑_𝑟0))
57	56	3adant1 1148	. . . . . . . . 9 ⊢ ((𝑦 ∈ ℕ ∧ 𝐴 ∈ 𝑉 ∧ ((𝐴↑_𝑟𝑦)↑_𝑟0) ⊆ (𝐴↑_𝑟0)) → ( I ↾ (dom 𝐴 ∪ ran (𝐴↑_𝑟𝑦))) ⊆ (𝐴↑_𝑟0))
58	39, 57	sstrd 3947	. . . . . . . 8 ⊢ ((𝑦 ∈ ℕ ∧ 𝐴 ∈ 𝑉 ∧ ((𝐴↑_𝑟𝑦)↑_𝑟0) ⊆ (𝐴↑_𝑟0)) → (((𝐴↑_𝑟𝑦) ∘ 𝐴)↑_𝑟0) ⊆ (𝐴↑_𝑟0))
59	26, 58	eqsstrd 3971	. . . . . . 7 ⊢ ((𝑦 ∈ ℕ ∧ 𝐴 ∈ 𝑉 ∧ ((𝐴↑_𝑟𝑦)↑_𝑟0) ⊆ (𝐴↑_𝑟0)) → ((𝐴↑_𝑟(𝑦 + 1))↑_𝑟0) ⊆ (𝐴↑_𝑟0))
60	59	3exp 1137	. . . . . 6 ⊢ (𝑦 ∈ ℕ → (𝐴 ∈ 𝑉 → (((𝐴↑_𝑟𝑦)↑_𝑟0) ⊆ (𝐴↑_𝑟0) → ((𝐴↑_𝑟(𝑦 + 1))↑_𝑟0) ⊆ (𝐴↑_𝑟0))))
61	60	a2d 30	. . . . 5 ⊢ (𝑦 ∈ ℕ → ((𝐴 ∈ 𝑉 → ((𝐴↑_𝑟𝑦)↑_𝑟0) ⊆ (𝐴↑_𝑟0)) → (𝐴 ∈ 𝑉 → ((𝐴↑_𝑟(𝑦 + 1))↑_𝑟0) ⊆ (𝐴↑_𝑟0))))
62	5, 9, 13, 17, 21, 61	nnind 12255	. . . 4 ⊢ (𝑁 ∈ ℕ → (𝐴 ∈ 𝑉 → ((𝐴↑_𝑟𝑁)↑_𝑟0) ⊆ (𝐴↑_𝑟0)))
63		oveq2 7418	. . . . . . . 8 ⊢ (𝑁 = 0 → (𝐴↑_𝑟𝑁) = (𝐴↑_𝑟0))
64	63	oveq1d 7425	. . . . . . 7 ⊢ (𝑁 = 0 → ((𝐴↑_𝑟𝑁)↑_𝑟0) = ((𝐴↑_𝑟0)↑_𝑟0))
65		relexp0idm 44469	. . . . . . 7 ⊢ (𝐴 ∈ 𝑉 → ((𝐴↑_𝑟0)↑_𝑟0) = (𝐴↑_𝑟0))
66	64, 65	sylan9eq 2818	. . . . . 6 ⊢ ((𝑁 = 0 ∧ 𝐴 ∈ 𝑉) → ((𝐴↑_𝑟𝑁)↑_𝑟0) = (𝐴↑_𝑟0))
67		eqimss 3995	. . . . . 6 ⊢ (((𝐴↑_𝑟𝑁)↑_𝑟0) = (𝐴↑_𝑟0) → ((𝐴↑_𝑟𝑁)↑_𝑟0) ⊆ (𝐴↑_𝑟0))
68	66, 67	syl 18	. . . . 5 ⊢ ((𝑁 = 0 ∧ 𝐴 ∈ 𝑉) → ((𝐴↑_𝑟𝑁)↑_𝑟0) ⊆ (𝐴↑_𝑟0))
69	68	ex 417	. . . 4 ⊢ (𝑁 = 0 → (𝐴 ∈ 𝑉 → ((𝐴↑_𝑟𝑁)↑_𝑟0) ⊆ (𝐴↑_𝑟0)))
70	62, 69	jaoi 870	. . 3 ⊢ ((𝑁 ∈ ℕ ∨ 𝑁 = 0) → (𝐴 ∈ 𝑉 → ((𝐴↑_𝑟𝑁)↑_𝑟0) ⊆ (𝐴↑_𝑟0)))
71	1, 70	sylbi 220	. 2 ⊢ (𝑁 ∈ ℕ₀ → (𝐴 ∈ 𝑉 → ((𝐴↑_𝑟𝑁)↑_𝑟0) ⊆ (𝐴↑_𝑟0)))
72	71	impcom 412	1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑁 ∈ ℕ₀) → ((𝐴↑_𝑟𝑁)↑_𝑟0) ⊆ (𝐴↑_𝑟0))

Colors of variables: wff setvar class

This proof depends on syntax axioms: → wi 4 ∧ wa 400 ∨ wo 860 ∧ w3a 1103 = wceq 1570 ∈ wcel 2143 Vcvv 3455 ∪ cun 3903 ⊆ wss 3905 I cid 5555 dom cdm 5661 ran crn 5662 ↾ cres 5663 ∘ ccom 5665 (class class class)co 7410 0cc0 11104 1c1 11105 + caddc 11107 ℕcn 12237 ℕ₀cn0 12508 ↑_𝑟crelexp 15061

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-rep 5238 ax-sep 5257 ax-nul 5269 ax-pow 5336 ax-pr 5404 ax-un 7732 ax-cnex 11160 ax-resscn 11161 ax-1cn 11162 ax-icn 11163 ax-addcl 11164 ax-addrcl 11165 ax-mulcl 11166 ax-mulrcl 11167 ax-mulcom 11168 ax-addass 11169 ax-mulass 11170 ax-distr 11171 ax-i2m1 11172 ax-1ne0 11173 ax-1rid 11174 ax-rnegex 11175 ax-rrecex 11176 ax-cnre 11177 ax-pre-lttri 11178 ax-pre-lttrn 11179 ax-pre-ltadd 11180 ax-pre-mulgt0 11181

This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3065 df-ral 3080 df-rex 3090 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3745 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-pss 3925 df-nul 4287 df-if 4488 df-pw 4564 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4873 df-iun 4958 df-br 5110 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5556 df-eprel 5561 df-po 5569 df-so 5570 df-fr 5614 df-we 5616 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-pred 6302 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7367 df-ov 7413 df-oprab 7414 df-mpo 7415 df-om 7859 df-2nd 7983 df-frecs 8274 df-wrecs 8305 df-recs 8354 df-rdg 8393 df-er 8690 df-en 8940 df-dom 8941 df-sdom 8942 df-pnf 11249 df-mnf 11250 df-xr 11251 df-ltxr 11252 df-le 11253 df-sub 11447 df-neg 11448 df-nn 12238 df-n0 12509 df-z 12596 df-uz 12867 df-seq 14043 df-relexp 15062

This theorem is used by: (None)

W3C validator