dfac12lem3 - Metamath Proof Explorer

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

Theorem dfac12lem3 10139

Description: Lemma for dfac12 10143. (Contributed by Mario Carneiro, 29-May-2015.)

**Hypotheses**
Ref	Expression
dfac12.1	⊢ (𝜑 → 𝐴 ∈ On)
dfac12.3	⊢ (𝜑 → 𝐹:𝒫 (har‘(𝑅₁‘𝐴))–1-1→On)
dfac12.4	⊢ 𝐺 = recs((𝑥 ∈ V ↦ (𝑦 ∈ (𝑅₁‘dom 𝑥) ↦ if(dom 𝑥 = ∪ dom 𝑥, ((suc ∪ ran ∪ ran 𝑥 ·_o (rank‘𝑦)) +_o ((𝑥‘suc (rank‘𝑦))‘𝑦)), (𝐹‘((^◡OrdIso( E , ran (𝑥‘∪ dom 𝑥)) ∘ (𝑥‘∪ dom 𝑥)) “ 𝑦))))))

**Assertion**
Ref	Expression
dfac12lem3	⊢ (𝜑 → (𝑅₁‘𝐴) ∈ dom card)

Distinct variable groups: 𝑦,𝐴 𝑥,𝑦,𝐺 𝜑,𝑦 𝑥,𝐹,𝑦 Allowed substitution hints: 𝜑(𝑥) 𝐴(𝑥)

Proof of Theorem dfac12lem3 Dummy variables 𝑚 𝑛 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		fvex 6904	. . . 4 ⊢ (𝐺‘𝐴) ∈ V
2	1	rnex 7902	. . 3 ⊢ ran (𝐺‘𝐴) ∈ V
3		ssid 4004	. . . . 5 ⊢ 𝐴 ⊆ 𝐴
4		dfac12.1	. . . . . 6 ⊢ (𝜑 → 𝐴 ∈ On)
5		sseq1 4007	. . . . . . . . 9 ⊢ (𝑚 = 𝑛 → (𝑚 ⊆ 𝐴 ↔ 𝑛 ⊆ 𝐴))
6		fveq2 6891	. . . . . . . . . . 11 ⊢ (𝑚 = 𝑛 → (𝐺‘𝑚) = (𝐺‘𝑛))
7		f1eq1 6782	. . . . . . . . . . 11 ⊢ ((𝐺‘𝑚) = (𝐺‘𝑛) → ((𝐺‘𝑚):(𝑅₁‘𝑚)–1-1→On ↔ (𝐺‘𝑛):(𝑅₁‘𝑚)–1-1→On))
8	6, 7	syl 17	. . . . . . . . . 10 ⊢ (𝑚 = 𝑛 → ((𝐺‘𝑚):(𝑅₁‘𝑚)–1-1→On ↔ (𝐺‘𝑛):(𝑅₁‘𝑚)–1-1→On))
9		fveq2 6891	. . . . . . . . . . 11 ⊢ (𝑚 = 𝑛 → (𝑅₁‘𝑚) = (𝑅₁‘𝑛))
10		f1eq2 6783	. . . . . . . . . . 11 ⊢ ((𝑅₁‘𝑚) = (𝑅₁‘𝑛) → ((𝐺‘𝑛):(𝑅₁‘𝑚)–1-1→On ↔ (𝐺‘𝑛):(𝑅₁‘𝑛)–1-1→On))
11	9, 10	syl 17	. . . . . . . . . 10 ⊢ (𝑚 = 𝑛 → ((𝐺‘𝑛):(𝑅₁‘𝑚)–1-1→On ↔ (𝐺‘𝑛):(𝑅₁‘𝑛)–1-1→On))
12	8, 11	bitrd 278	. . . . . . . . 9 ⊢ (𝑚 = 𝑛 → ((𝐺‘𝑚):(𝑅₁‘𝑚)–1-1→On ↔ (𝐺‘𝑛):(𝑅₁‘𝑛)–1-1→On))
13	5, 12	imbi12d 344	. . . . . . . 8 ⊢ (𝑚 = 𝑛 → ((𝑚 ⊆ 𝐴 → (𝐺‘𝑚):(𝑅₁‘𝑚)–1-1→On) ↔ (𝑛 ⊆ 𝐴 → (𝐺‘𝑛):(𝑅₁‘𝑛)–1-1→On)))
14	13	imbi2d 340	. . . . . . 7 ⊢ (𝑚 = 𝑛 → ((𝜑 → (𝑚 ⊆ 𝐴 → (𝐺‘𝑚):(𝑅₁‘𝑚)–1-1→On)) ↔ (𝜑 → (𝑛 ⊆ 𝐴 → (𝐺‘𝑛):(𝑅₁‘𝑛)–1-1→On))))
15		sseq1 4007	. . . . . . . . 9 ⊢ (𝑚 = 𝐴 → (𝑚 ⊆ 𝐴 ↔ 𝐴 ⊆ 𝐴))
16		fveq2 6891	. . . . . . . . . . 11 ⊢ (𝑚 = 𝐴 → (𝐺‘𝑚) = (𝐺‘𝐴))
17		f1eq1 6782	. . . . . . . . . . 11 ⊢ ((𝐺‘𝑚) = (𝐺‘𝐴) → ((𝐺‘𝑚):(𝑅₁‘𝑚)–1-1→On ↔ (𝐺‘𝐴):(𝑅₁‘𝑚)–1-1→On))
18	16, 17	syl 17	. . . . . . . . . 10 ⊢ (𝑚 = 𝐴 → ((𝐺‘𝑚):(𝑅₁‘𝑚)–1-1→On ↔ (𝐺‘𝐴):(𝑅₁‘𝑚)–1-1→On))
19		fveq2 6891	. . . . . . . . . . 11 ⊢ (𝑚 = 𝐴 → (𝑅₁‘𝑚) = (𝑅₁‘𝐴))
20		f1eq2 6783	. . . . . . . . . . 11 ⊢ ((𝑅₁‘𝑚) = (𝑅₁‘𝐴) → ((𝐺‘𝐴):(𝑅₁‘𝑚)–1-1→On ↔ (𝐺‘𝐴):(𝑅₁‘𝐴)–1-1→On))
21	19, 20	syl 17	. . . . . . . . . 10 ⊢ (𝑚 = 𝐴 → ((𝐺‘𝐴):(𝑅₁‘𝑚)–1-1→On ↔ (𝐺‘𝐴):(𝑅₁‘𝐴)–1-1→On))
22	18, 21	bitrd 278	. . . . . . . . 9 ⊢ (𝑚 = 𝐴 → ((𝐺‘𝑚):(𝑅₁‘𝑚)–1-1→On ↔ (𝐺‘𝐴):(𝑅₁‘𝐴)–1-1→On))
23	15, 22	imbi12d 344	. . . . . . . 8 ⊢ (𝑚 = 𝐴 → ((𝑚 ⊆ 𝐴 → (𝐺‘𝑚):(𝑅₁‘𝑚)–1-1→On) ↔ (𝐴 ⊆ 𝐴 → (𝐺‘𝐴):(𝑅₁‘𝐴)–1-1→On)))
24	23	imbi2d 340	. . . . . . 7 ⊢ (𝑚 = 𝐴 → ((𝜑 → (𝑚 ⊆ 𝐴 → (𝐺‘𝑚):(𝑅₁‘𝑚)–1-1→On)) ↔ (𝜑 → (𝐴 ⊆ 𝐴 → (𝐺‘𝐴):(𝑅₁‘𝐴)–1-1→On))))
25		r19.21v 3179	. . . . . . . 8 ⊢ (∀𝑛 ∈ 𝑚 (𝜑 → (𝑛 ⊆ 𝐴 → (𝐺‘𝑛):(𝑅₁‘𝑛)–1-1→On)) ↔ (𝜑 → ∀𝑛 ∈ 𝑚 (𝑛 ⊆ 𝐴 → (𝐺‘𝑛):(𝑅₁‘𝑛)–1-1→On)))
26		eloni 6374	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑚 ∈ On → Ord 𝑚)
27	26	ad2antrl 726	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ (𝑚 ∈ On ∧ 𝑚 ⊆ 𝐴)) → Ord 𝑚)
28		ordelss 6380	. . . . . . . . . . . . . . . . 17 ⊢ ((Ord 𝑚 ∧ 𝑛 ∈ 𝑚) → 𝑛 ⊆ 𝑚)
29	27, 28	sylan 580	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ (𝑚 ∈ On ∧ 𝑚 ⊆ 𝐴)) ∧ 𝑛 ∈ 𝑚) → 𝑛 ⊆ 𝑚)
30		simplrr 776	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ (𝑚 ∈ On ∧ 𝑚 ⊆ 𝐴)) ∧ 𝑛 ∈ 𝑚) → 𝑚 ⊆ 𝐴)
31	29, 30	sstrd 3992	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝑚 ∈ On ∧ 𝑚 ⊆ 𝐴)) ∧ 𝑛 ∈ 𝑚) → 𝑛 ⊆ 𝐴)
32		pm5.5 361	. . . . . . . . . . . . . . 15 ⊢ (𝑛 ⊆ 𝐴 → ((𝑛 ⊆ 𝐴 → (𝐺‘𝑛):(𝑅₁‘𝑛)–1-1→On) ↔ (𝐺‘𝑛):(𝑅₁‘𝑛)–1-1→On))
33	31, 32	syl 17	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝑚 ∈ On ∧ 𝑚 ⊆ 𝐴)) ∧ 𝑛 ∈ 𝑚) → ((𝑛 ⊆ 𝐴 → (𝐺‘𝑛):(𝑅₁‘𝑛)–1-1→On) ↔ (𝐺‘𝑛):(𝑅₁‘𝑛)–1-1→On))
34	33	ralbidva 3175	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑚 ∈ On ∧ 𝑚 ⊆ 𝐴)) → (∀𝑛 ∈ 𝑚 (𝑛 ⊆ 𝐴 → (𝐺‘𝑛):(𝑅₁‘𝑛)–1-1→On) ↔ ∀𝑛 ∈ 𝑚 (𝐺‘𝑛):(𝑅₁‘𝑛)–1-1→On))
35	4	ad2antrr 724	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝑚 ∈ On ∧ 𝑚 ⊆ 𝐴)) ∧ ∀𝑛 ∈ 𝑚 (𝐺‘𝑛):(𝑅₁‘𝑛)–1-1→On) → 𝐴 ∈ On)
36		dfac12.3	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → 𝐹:𝒫 (har‘(𝑅₁‘𝐴))–1-1→On)
37	36	ad2antrr 724	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝑚 ∈ On ∧ 𝑚 ⊆ 𝐴)) ∧ ∀𝑛 ∈ 𝑚 (𝐺‘𝑛):(𝑅₁‘𝑛)–1-1→On) → 𝐹:𝒫 (har‘(𝑅₁‘𝐴))–1-1→On)
38		dfac12.4	. . . . . . . . . . . . . . 15 ⊢ 𝐺 = recs((𝑥 ∈ V ↦ (𝑦 ∈ (𝑅₁‘dom 𝑥) ↦ if(dom 𝑥 = ∪ dom 𝑥, ((suc ∪ ran ∪ ran 𝑥 ·_o (rank‘𝑦)) +_o ((𝑥‘suc (rank‘𝑦))‘𝑦)), (𝐹‘((^◡OrdIso( E , ran (𝑥‘∪ dom 𝑥)) ∘ (𝑥‘∪ dom 𝑥)) “ 𝑦))))))
39		simplrl 775	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝑚 ∈ On ∧ 𝑚 ⊆ 𝐴)) ∧ ∀𝑛 ∈ 𝑚 (𝐺‘𝑛):(𝑅₁‘𝑛)–1-1→On) → 𝑚 ∈ On)
40		eqid 2732	. . . . . . . . . . . . . . 15 ⊢ (^◡OrdIso( E , ran (𝐺‘∪ 𝑚)) ∘ (𝐺‘∪ 𝑚)) = (^◡OrdIso( E , ran (𝐺‘∪ 𝑚)) ∘ (𝐺‘∪ 𝑚))
41		simplrr 776	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝑚 ∈ On ∧ 𝑚 ⊆ 𝐴)) ∧ ∀𝑛 ∈ 𝑚 (𝐺‘𝑛):(𝑅₁‘𝑛)–1-1→On) → 𝑚 ⊆ 𝐴)
42		simpr 485	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ (𝑚 ∈ On ∧ 𝑚 ⊆ 𝐴)) ∧ ∀𝑛 ∈ 𝑚 (𝐺‘𝑛):(𝑅₁‘𝑛)–1-1→On) → ∀𝑛 ∈ 𝑚 (𝐺‘𝑛):(𝑅₁‘𝑛)–1-1→On)
43		fveq2 6891	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑛 = 𝑧 → (𝐺‘𝑛) = (𝐺‘𝑧))
44		f1eq1 6782	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝐺‘𝑛) = (𝐺‘𝑧) → ((𝐺‘𝑛):(𝑅₁‘𝑛)–1-1→On ↔ (𝐺‘𝑧):(𝑅₁‘𝑛)–1-1→On))
45	43, 44	syl 17	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑛 = 𝑧 → ((𝐺‘𝑛):(𝑅₁‘𝑛)–1-1→On ↔ (𝐺‘𝑧):(𝑅₁‘𝑛)–1-1→On))
46		fveq2 6891	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑛 = 𝑧 → (𝑅₁‘𝑛) = (𝑅₁‘𝑧))
47		f1eq2 6783	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑅₁‘𝑛) = (𝑅₁‘𝑧) → ((𝐺‘𝑧):(𝑅₁‘𝑛)–1-1→On ↔ (𝐺‘𝑧):(𝑅₁‘𝑧)–1-1→On))
48	46, 47	syl 17	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑛 = 𝑧 → ((𝐺‘𝑧):(𝑅₁‘𝑛)–1-1→On ↔ (𝐺‘𝑧):(𝑅₁‘𝑧)–1-1→On))
49	45, 48	bitrd 278	. . . . . . . . . . . . . . . . 17 ⊢ (𝑛 = 𝑧 → ((𝐺‘𝑛):(𝑅₁‘𝑛)–1-1→On ↔ (𝐺‘𝑧):(𝑅₁‘𝑧)–1-1→On))
50	49	cbvralvw 3234	. . . . . . . . . . . . . . . 16 ⊢ (∀𝑛 ∈ 𝑚 (𝐺‘𝑛):(𝑅₁‘𝑛)–1-1→On ↔ ∀𝑧 ∈ 𝑚 (𝐺‘𝑧):(𝑅₁‘𝑧)–1-1→On)
51	42, 50	sylib 217	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝑚 ∈ On ∧ 𝑚 ⊆ 𝐴)) ∧ ∀𝑛 ∈ 𝑚 (𝐺‘𝑛):(𝑅₁‘𝑛)–1-1→On) → ∀𝑧 ∈ 𝑚 (𝐺‘𝑧):(𝑅₁‘𝑧)–1-1→On)
52	35, 37, 38, 39, 40, 41, 51	dfac12lem2 10138	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝑚 ∈ On ∧ 𝑚 ⊆ 𝐴)) ∧ ∀𝑛 ∈ 𝑚 (𝐺‘𝑛):(𝑅₁‘𝑛)–1-1→On) → (𝐺‘𝑚):(𝑅₁‘𝑚)–1-1→On)
53	52	ex 413	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑚 ∈ On ∧ 𝑚 ⊆ 𝐴)) → (∀𝑛 ∈ 𝑚 (𝐺‘𝑛):(𝑅₁‘𝑛)–1-1→On → (𝐺‘𝑚):(𝑅₁‘𝑚)–1-1→On))
54	34, 53	sylbid 239	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑚 ∈ On ∧ 𝑚 ⊆ 𝐴)) → (∀𝑛 ∈ 𝑚 (𝑛 ⊆ 𝐴 → (𝐺‘𝑛):(𝑅₁‘𝑛)–1-1→On) → (𝐺‘𝑚):(𝑅₁‘𝑚)–1-1→On))
55	54	expr 457	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑚 ∈ On) → (𝑚 ⊆ 𝐴 → (∀𝑛 ∈ 𝑚 (𝑛 ⊆ 𝐴 → (𝐺‘𝑛):(𝑅₁‘𝑛)–1-1→On) → (𝐺‘𝑚):(𝑅₁‘𝑚)–1-1→On)))
56	55	com23 86	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑚 ∈ On) → (∀𝑛 ∈ 𝑚 (𝑛 ⊆ 𝐴 → (𝐺‘𝑛):(𝑅₁‘𝑛)–1-1→On) → (𝑚 ⊆ 𝐴 → (𝐺‘𝑚):(𝑅₁‘𝑚)–1-1→On)))
57	56	expcom 414	. . . . . . . . 9 ⊢ (𝑚 ∈ On → (𝜑 → (∀𝑛 ∈ 𝑚 (𝑛 ⊆ 𝐴 → (𝐺‘𝑛):(𝑅₁‘𝑛)–1-1→On) → (𝑚 ⊆ 𝐴 → (𝐺‘𝑚):(𝑅₁‘𝑚)–1-1→On))))
58	57	a2d 29	. . . . . . . 8 ⊢ (𝑚 ∈ On → ((𝜑 → ∀𝑛 ∈ 𝑚 (𝑛 ⊆ 𝐴 → (𝐺‘𝑛):(𝑅₁‘𝑛)–1-1→On)) → (𝜑 → (𝑚 ⊆ 𝐴 → (𝐺‘𝑚):(𝑅₁‘𝑚)–1-1→On))))
59	25, 58	biimtrid 241	. . . . . . 7 ⊢ (𝑚 ∈ On → (∀𝑛 ∈ 𝑚 (𝜑 → (𝑛 ⊆ 𝐴 → (𝐺‘𝑛):(𝑅₁‘𝑛)–1-1→On)) → (𝜑 → (𝑚 ⊆ 𝐴 → (𝐺‘𝑚):(𝑅₁‘𝑚)–1-1→On))))
60	14, 24, 59	tfis3 7846	. . . . . 6 ⊢ (𝐴 ∈ On → (𝜑 → (𝐴 ⊆ 𝐴 → (𝐺‘𝐴):(𝑅₁‘𝐴)–1-1→On)))
61	4, 60	mpcom 38	. . . . 5 ⊢ (𝜑 → (𝐴 ⊆ 𝐴 → (𝐺‘𝐴):(𝑅₁‘𝐴)–1-1→On))
62	3, 61	mpi 20	. . . 4 ⊢ (𝜑 → (𝐺‘𝐴):(𝑅₁‘𝐴)–1-1→On)
63		f1f 6787	. . . 4 ⊢ ((𝐺‘𝐴):(𝑅₁‘𝐴)–1-1→On → (𝐺‘𝐴):(𝑅₁‘𝐴)⟶On)
64		frn 6724	. . . 4 ⊢ ((𝐺‘𝐴):(𝑅₁‘𝐴)⟶On → ran (𝐺‘𝐴) ⊆ On)
65	62, 63, 64	3syl 18	. . 3 ⊢ (𝜑 → ran (𝐺‘𝐴) ⊆ On)
66		onssnum 10034	. . 3 ⊢ ((ran (𝐺‘𝐴) ∈ V ∧ ran (𝐺‘𝐴) ⊆ On) → ran (𝐺‘𝐴) ∈ dom card)
67	2, 65, 66	sylancr 587	. 2 ⊢ (𝜑 → ran (𝐺‘𝐴) ∈ dom card)
68		f1f1orn 6844	. . . 4 ⊢ ((𝐺‘𝐴):(𝑅₁‘𝐴)–1-1→On → (𝐺‘𝐴):(𝑅₁‘𝐴)–1-1-onto→ran (𝐺‘𝐴))
69	62, 68	syl 17	. . 3 ⊢ (𝜑 → (𝐺‘𝐴):(𝑅₁‘𝐴)–1-1-onto→ran (𝐺‘𝐴))
70		fvex 6904	. . . 4 ⊢ (𝑅₁‘𝐴) ∈ V
71	70	f1oen 8968	. . 3 ⊢ ((𝐺‘𝐴):(𝑅₁‘𝐴)–1-1-onto→ran (𝐺‘𝐴) → (𝑅₁‘𝐴) ≈ ran (𝐺‘𝐴))
72		ennum 9941	. . 3 ⊢ ((𝑅₁‘𝐴) ≈ ran (𝐺‘𝐴) → ((𝑅₁‘𝐴) ∈ dom card ↔ ran (𝐺‘𝐴) ∈ dom card))
73	69, 71, 72	3syl 18	. 2 ⊢ (𝜑 → ((𝑅₁‘𝐴) ∈ dom card ↔ ran (𝐺‘𝐴) ∈ dom card))
74	67, 73	mpbird 256	1 ⊢ (𝜑 → (𝑅₁‘𝐴) ∈ dom card)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 = wceq 1541 ∈ wcel 2106 ∀wral 3061 Vcvv 3474 ⊆ wss 3948 ifcif 4528 𝒫 cpw 4602 ∪ cuni 4908 class class class wbr 5148 ↦ cmpt 5231 E cep 5579 ^◡ccnv 5675 dom cdm 5676 ran crn 5677 “ cima 5679 ∘ ccom 5680 Ord word 6363 Oncon0 6364 suc csuc 6366 ⟶wf 6539 –1-1→wf1 6540 –1-1-onto→wf1o 6542 ‘cfv 6543 (class class class)co 7408 recscrecs 8369 +_o coa 8462 ·_o comu 8463 ≈ cen 8935 OrdIsocoi 9503 harchar 9550 𝑅₁cr1 9756 rankcrnk 9757 cardccrd 9929

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2703 ax-rep 5285 ax-sep 5299 ax-nul 5306 ax-pow 5363 ax-pr 5427 ax-un 7724

This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2534 df-eu 2563 df-clab 2710 df-cleq 2724 df-clel 2810 df-nfc 2885 df-ne 2941 df-ral 3062 df-rex 3071 df-rmo 3376 df-reu 3377 df-rab 3433 df-v 3476 df-sbc 3778 df-csb 3894 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-pss 3967 df-nul 4323 df-if 4529 df-pw 4604 df-sn 4629 df-pr 4631 df-op 4635 df-uni 4909 df-int 4951 df-iun 4999 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5574 df-eprel 5580 df-po 5588 df-so 5589 df-fr 5631 df-se 5632 df-we 5633 df-xp 5682 df-rel 5683 df-cnv 5684 df-co 5685 df-dm 5686 df-rn 5687 df-res 5688 df-ima 5689 df-pred 6300 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6495 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-isom 6552 df-riota 7364 df-ov 7411 df-oprab 7412 df-mpo 7413 df-om 7855 df-2nd 7975 df-frecs 8265 df-wrecs 8296 df-recs 8370 df-rdg 8409 df-oadd 8469 df-omul 8470 df-er 8702 df-en 8939 df-dom 8940 df-oi 9504 df-har 9551 df-r1 9758 df-rank 9759 df-card 9933

This theorem is referenced by: dfac12r 10140

W3C validator