isf34lem7 - Metamath Proof Explorer

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

Theorem isf34lem7 10295

Description: Lemma for isfin3-4 10298. (Contributed by Stefan O'Rear, 7-Nov-2014.)

**Hypothesis**
Ref	Expression
compss.a	⊢ 𝐹 = (𝑥 ∈ 𝒫 𝐴 ↦ (𝐴 ∖ 𝑥))

**Assertion**
Ref	Expression
isf34lem7	⊢ ((𝐴 ∈ Fin^III ∧ 𝐺:ω⟶𝒫 𝐴 ∧ ∀𝑦 ∈ ω (𝐺‘𝑦) ⊆ (𝐺‘suc 𝑦)) → ∪ ran 𝐺 ∈ ran 𝐺)

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

**Proof of Theorem isf34lem7**
Step	Hyp	Ref	Expression
1		compss.a	. . . . . . 7 ⊢ 𝐹 = (𝑥 ∈ 𝒫 𝐴 ↦ (𝐴 ∖ 𝑥))
2	1	isf34lem2 10289	. . . . . 6 ⊢ (𝐴 ∈ Fin^III → 𝐹:𝒫 𝐴⟶𝒫 𝐴)
3	2	adantr 480	. . . . 5 ⊢ ((𝐴 ∈ Fin^III ∧ 𝐺:ω⟶𝒫 𝐴) → 𝐹:𝒫 𝐴⟶𝒫 𝐴)
4	3	3adant3 1133	. . . 4 ⊢ ((𝐴 ∈ Fin^III ∧ 𝐺:ω⟶𝒫 𝐴 ∧ ∀𝑦 ∈ ω (𝐺‘𝑦) ⊆ (𝐺‘suc 𝑦)) → 𝐹:𝒫 𝐴⟶𝒫 𝐴)
5	4	ffnd 6664	. . 3 ⊢ ((𝐴 ∈ Fin^III ∧ 𝐺:ω⟶𝒫 𝐴 ∧ ∀𝑦 ∈ ω (𝐺‘𝑦) ⊆ (𝐺‘suc 𝑦)) → 𝐹 Fn 𝒫 𝐴)
6		imassrn 6031	. . . 4 ⊢ (𝐹 “ ran 𝐺) ⊆ ran 𝐹
7	3	frnd 6671	. . . . 5 ⊢ ((𝐴 ∈ Fin^III ∧ 𝐺:ω⟶𝒫 𝐴) → ran 𝐹 ⊆ 𝒫 𝐴)
8	7	3adant3 1133	. . . 4 ⊢ ((𝐴 ∈ Fin^III ∧ 𝐺:ω⟶𝒫 𝐴 ∧ ∀𝑦 ∈ ω (𝐺‘𝑦) ⊆ (𝐺‘suc 𝑦)) → ran 𝐹 ⊆ 𝒫 𝐴)
9	6, 8	sstrid 3934	. . 3 ⊢ ((𝐴 ∈ Fin^III ∧ 𝐺:ω⟶𝒫 𝐴 ∧ ∀𝑦 ∈ ω (𝐺‘𝑦) ⊆ (𝐺‘suc 𝑦)) → (𝐹 “ ran 𝐺) ⊆ 𝒫 𝐴)
10		simp1 1137	. . . . 5 ⊢ ((𝐴 ∈ Fin^III ∧ 𝐺:ω⟶𝒫 𝐴 ∧ ∀𝑦 ∈ ω (𝐺‘𝑦) ⊆ (𝐺‘suc 𝑦)) → 𝐴 ∈ Fin^III)
11		fco 6687	. . . . . . 7 ⊢ ((𝐹:𝒫 𝐴⟶𝒫 𝐴 ∧ 𝐺:ω⟶𝒫 𝐴) → (𝐹 ∘ 𝐺):ω⟶𝒫 𝐴)
12	2, 11	sylan 581	. . . . . 6 ⊢ ((𝐴 ∈ Fin^III ∧ 𝐺:ω⟶𝒫 𝐴) → (𝐹 ∘ 𝐺):ω⟶𝒫 𝐴)
13	12	3adant3 1133	. . . . 5 ⊢ ((𝐴 ∈ Fin^III ∧ 𝐺:ω⟶𝒫 𝐴 ∧ ∀𝑦 ∈ ω (𝐺‘𝑦) ⊆ (𝐺‘suc 𝑦)) → (𝐹 ∘ 𝐺):ω⟶𝒫 𝐴)
14		sscon 4084	. . . . . . . 8 ⊢ ((𝐺‘𝑦) ⊆ (𝐺‘suc 𝑦) → (𝐴 ∖ (𝐺‘suc 𝑦)) ⊆ (𝐴 ∖ (𝐺‘𝑦)))
15		simpr 484	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ Fin^III ∧ 𝐺:ω⟶𝒫 𝐴) → 𝐺:ω⟶𝒫 𝐴)
16		peano2 7835	. . . . . . . . . . 11 ⊢ (𝑦 ∈ ω → suc 𝑦 ∈ ω)
17		fvco3 6934	. . . . . . . . . . 11 ⊢ ((𝐺:ω⟶𝒫 𝐴 ∧ suc 𝑦 ∈ ω) → ((𝐹 ∘ 𝐺)‘suc 𝑦) = (𝐹‘(𝐺‘suc 𝑦)))
18	15, 16, 17	syl2an 597	. . . . . . . . . 10 ⊢ (((𝐴 ∈ Fin^III ∧ 𝐺:ω⟶𝒫 𝐴) ∧ 𝑦 ∈ ω) → ((𝐹 ∘ 𝐺)‘suc 𝑦) = (𝐹‘(𝐺‘suc 𝑦)))
19		simpll 767	. . . . . . . . . . 11 ⊢ (((𝐴 ∈ Fin^III ∧ 𝐺:ω⟶𝒫 𝐴) ∧ 𝑦 ∈ ω) → 𝐴 ∈ Fin^III)
20		ffvelcdm 7028	. . . . . . . . . . . . 13 ⊢ ((𝐺:ω⟶𝒫 𝐴 ∧ suc 𝑦 ∈ ω) → (𝐺‘suc 𝑦) ∈ 𝒫 𝐴)
21	15, 16, 20	syl2an 597	. . . . . . . . . . . 12 ⊢ (((𝐴 ∈ Fin^III ∧ 𝐺:ω⟶𝒫 𝐴) ∧ 𝑦 ∈ ω) → (𝐺‘suc 𝑦) ∈ 𝒫 𝐴)
22	21	elpwid 4551	. . . . . . . . . . 11 ⊢ (((𝐴 ∈ Fin^III ∧ 𝐺:ω⟶𝒫 𝐴) ∧ 𝑦 ∈ ω) → (𝐺‘suc 𝑦) ⊆ 𝐴)
23	1	isf34lem1 10288	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ Fin^III ∧ (𝐺‘suc 𝑦) ⊆ 𝐴) → (𝐹‘(𝐺‘suc 𝑦)) = (𝐴 ∖ (𝐺‘suc 𝑦)))
24	19, 22, 23	syl2anc 585	. . . . . . . . . 10 ⊢ (((𝐴 ∈ Fin^III ∧ 𝐺:ω⟶𝒫 𝐴) ∧ 𝑦 ∈ ω) → (𝐹‘(𝐺‘suc 𝑦)) = (𝐴 ∖ (𝐺‘suc 𝑦)))
25	18, 24	eqtrd 2772	. . . . . . . . 9 ⊢ (((𝐴 ∈ Fin^III ∧ 𝐺:ω⟶𝒫 𝐴) ∧ 𝑦 ∈ ω) → ((𝐹 ∘ 𝐺)‘suc 𝑦) = (𝐴 ∖ (𝐺‘suc 𝑦)))
26		fvco3 6934	. . . . . . . . . . 11 ⊢ ((𝐺:ω⟶𝒫 𝐴 ∧ 𝑦 ∈ ω) → ((𝐹 ∘ 𝐺)‘𝑦) = (𝐹‘(𝐺‘𝑦)))
27	26	adantll 715	. . . . . . . . . 10 ⊢ (((𝐴 ∈ Fin^III ∧ 𝐺:ω⟶𝒫 𝐴) ∧ 𝑦 ∈ ω) → ((𝐹 ∘ 𝐺)‘𝑦) = (𝐹‘(𝐺‘𝑦)))
28		ffvelcdm 7028	. . . . . . . . . . . . 13 ⊢ ((𝐺:ω⟶𝒫 𝐴 ∧ 𝑦 ∈ ω) → (𝐺‘𝑦) ∈ 𝒫 𝐴)
29	28	adantll 715	. . . . . . . . . . . 12 ⊢ (((𝐴 ∈ Fin^III ∧ 𝐺:ω⟶𝒫 𝐴) ∧ 𝑦 ∈ ω) → (𝐺‘𝑦) ∈ 𝒫 𝐴)
30	29	elpwid 4551	. . . . . . . . . . 11 ⊢ (((𝐴 ∈ Fin^III ∧ 𝐺:ω⟶𝒫 𝐴) ∧ 𝑦 ∈ ω) → (𝐺‘𝑦) ⊆ 𝐴)
31	1	isf34lem1 10288	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ Fin^III ∧ (𝐺‘𝑦) ⊆ 𝐴) → (𝐹‘(𝐺‘𝑦)) = (𝐴 ∖ (𝐺‘𝑦)))
32	19, 30, 31	syl2anc 585	. . . . . . . . . 10 ⊢ (((𝐴 ∈ Fin^III ∧ 𝐺:ω⟶𝒫 𝐴) ∧ 𝑦 ∈ ω) → (𝐹‘(𝐺‘𝑦)) = (𝐴 ∖ (𝐺‘𝑦)))
33	27, 32	eqtrd 2772	. . . . . . . . 9 ⊢ (((𝐴 ∈ Fin^III ∧ 𝐺:ω⟶𝒫 𝐴) ∧ 𝑦 ∈ ω) → ((𝐹 ∘ 𝐺)‘𝑦) = (𝐴 ∖ (𝐺‘𝑦)))
34	25, 33	sseq12d 3956	. . . . . . . 8 ⊢ (((𝐴 ∈ Fin^III ∧ 𝐺:ω⟶𝒫 𝐴) ∧ 𝑦 ∈ ω) → (((𝐹 ∘ 𝐺)‘suc 𝑦) ⊆ ((𝐹 ∘ 𝐺)‘𝑦) ↔ (𝐴 ∖ (𝐺‘suc 𝑦)) ⊆ (𝐴 ∖ (𝐺‘𝑦))))
35	14, 34	imbitrrid 246	. . . . . . 7 ⊢ (((𝐴 ∈ Fin^III ∧ 𝐺:ω⟶𝒫 𝐴) ∧ 𝑦 ∈ ω) → ((𝐺‘𝑦) ⊆ (𝐺‘suc 𝑦) → ((𝐹 ∘ 𝐺)‘suc 𝑦) ⊆ ((𝐹 ∘ 𝐺)‘𝑦)))
36	35	ralimdva 3150	. . . . . 6 ⊢ ((𝐴 ∈ Fin^III ∧ 𝐺:ω⟶𝒫 𝐴) → (∀𝑦 ∈ ω (𝐺‘𝑦) ⊆ (𝐺‘suc 𝑦) → ∀𝑦 ∈ ω ((𝐹 ∘ 𝐺)‘suc 𝑦) ⊆ ((𝐹 ∘ 𝐺)‘𝑦)))
37	36	3impia 1118	. . . . 5 ⊢ ((𝐴 ∈ Fin^III ∧ 𝐺:ω⟶𝒫 𝐴 ∧ ∀𝑦 ∈ ω (𝐺‘𝑦) ⊆ (𝐺‘suc 𝑦)) → ∀𝑦 ∈ ω ((𝐹 ∘ 𝐺)‘suc 𝑦) ⊆ ((𝐹 ∘ 𝐺)‘𝑦))
38		fin33i 10285	. . . . 5 ⊢ ((𝐴 ∈ Fin^III ∧ (𝐹 ∘ 𝐺):ω⟶𝒫 𝐴 ∧ ∀𝑦 ∈ ω ((𝐹 ∘ 𝐺)‘suc 𝑦) ⊆ ((𝐹 ∘ 𝐺)‘𝑦)) → ∩ ran (𝐹 ∘ 𝐺) ∈ ran (𝐹 ∘ 𝐺))
39	10, 13, 37, 38	syl3anc 1374	. . . 4 ⊢ ((𝐴 ∈ Fin^III ∧ 𝐺:ω⟶𝒫 𝐴 ∧ ∀𝑦 ∈ ω (𝐺‘𝑦) ⊆ (𝐺‘suc 𝑦)) → ∩ ran (𝐹 ∘ 𝐺) ∈ ran (𝐹 ∘ 𝐺))
40		rnco2 6213	. . . . 5 ⊢ ran (𝐹 ∘ 𝐺) = (𝐹 “ ran 𝐺)
41	40	inteqi 4894	. . . 4 ⊢ ∩ ran (𝐹 ∘ 𝐺) = ∩ (𝐹 “ ran 𝐺)
42	39, 41, 40	3eltr3g 2853	. . 3 ⊢ ((𝐴 ∈ Fin^III ∧ 𝐺:ω⟶𝒫 𝐴 ∧ ∀𝑦 ∈ ω (𝐺‘𝑦) ⊆ (𝐺‘suc 𝑦)) → ∩ (𝐹 “ ran 𝐺) ∈ (𝐹 “ ran 𝐺))
43		fnfvima 7182	. . 3 ⊢ ((𝐹 Fn 𝒫 𝐴 ∧ (𝐹 “ ran 𝐺) ⊆ 𝒫 𝐴 ∧ ∩ (𝐹 “ ran 𝐺) ∈ (𝐹 “ ran 𝐺)) → (𝐹‘∩ (𝐹 “ ran 𝐺)) ∈ (𝐹 “ (𝐹 “ ran 𝐺)))
44	5, 9, 42, 43	syl3anc 1374	. 2 ⊢ ((𝐴 ∈ Fin^III ∧ 𝐺:ω⟶𝒫 𝐴 ∧ ∀𝑦 ∈ ω (𝐺‘𝑦) ⊆ (𝐺‘suc 𝑦)) → (𝐹‘∩ (𝐹 “ ran 𝐺)) ∈ (𝐹 “ (𝐹 “ ran 𝐺)))
45		simpl 482	. . . . . 6 ⊢ ((𝐴 ∈ Fin^III ∧ 𝐺:ω⟶𝒫 𝐴) → 𝐴 ∈ Fin^III)
46	6, 7	sstrid 3934	. . . . . 6 ⊢ ((𝐴 ∈ Fin^III ∧ 𝐺:ω⟶𝒫 𝐴) → (𝐹 “ ran 𝐺) ⊆ 𝒫 𝐴)
47		incom 4150	. . . . . . . . 9 ⊢ (dom 𝐹 ∩ ran 𝐺) = (ran 𝐺 ∩ dom 𝐹)
48		frn 6670	. . . . . . . . . . . 12 ⊢ (𝐺:ω⟶𝒫 𝐴 → ran 𝐺 ⊆ 𝒫 𝐴)
49	48	adantl 481	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ Fin^III ∧ 𝐺:ω⟶𝒫 𝐴) → ran 𝐺 ⊆ 𝒫 𝐴)
50	3	fdmd 6673	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ Fin^III ∧ 𝐺:ω⟶𝒫 𝐴) → dom 𝐹 = 𝒫 𝐴)
51	49, 50	sseqtrrd 3960	. . . . . . . . . 10 ⊢ ((𝐴 ∈ Fin^III ∧ 𝐺:ω⟶𝒫 𝐴) → ran 𝐺 ⊆ dom 𝐹)
52		dfss2 3908	. . . . . . . . . 10 ⊢ (ran 𝐺 ⊆ dom 𝐹 ↔ (ran 𝐺 ∩ dom 𝐹) = ran 𝐺)
53	51, 52	sylib 218	. . . . . . . . 9 ⊢ ((𝐴 ∈ Fin^III ∧ 𝐺:ω⟶𝒫 𝐴) → (ran 𝐺 ∩ dom 𝐹) = ran 𝐺)
54	47, 53	eqtrid 2784	. . . . . . . 8 ⊢ ((𝐴 ∈ Fin^III ∧ 𝐺:ω⟶𝒫 𝐴) → (dom 𝐹 ∩ ran 𝐺) = ran 𝐺)
55		fdm 6672	. . . . . . . . . . 11 ⊢ (𝐺:ω⟶𝒫 𝐴 → dom 𝐺 = ω)
56	55	adantl 481	. . . . . . . . . 10 ⊢ ((𝐴 ∈ Fin^III ∧ 𝐺:ω⟶𝒫 𝐴) → dom 𝐺 = ω)
57		peano1 7834	. . . . . . . . . . 11 ⊢ ∅ ∈ ω
58		ne0i 4282	. . . . . . . . . . 11 ⊢ (∅ ∈ ω → ω ≠ ∅)
59	57, 58	mp1i 13	. . . . . . . . . 10 ⊢ ((𝐴 ∈ Fin^III ∧ 𝐺:ω⟶𝒫 𝐴) → ω ≠ ∅)
60	56, 59	eqnetrd 3000	. . . . . . . . 9 ⊢ ((𝐴 ∈ Fin^III ∧ 𝐺:ω⟶𝒫 𝐴) → dom 𝐺 ≠ ∅)
61		dm0rn0 5874	. . . . . . . . . 10 ⊢ (dom 𝐺 = ∅ ↔ ran 𝐺 = ∅)
62	61	necon3bii 2985	. . . . . . . . 9 ⊢ (dom 𝐺 ≠ ∅ ↔ ran 𝐺 ≠ ∅)
63	60, 62	sylib 218	. . . . . . . 8 ⊢ ((𝐴 ∈ Fin^III ∧ 𝐺:ω⟶𝒫 𝐴) → ran 𝐺 ≠ ∅)
64	54, 63	eqnetrd 3000	. . . . . . 7 ⊢ ((𝐴 ∈ Fin^III ∧ 𝐺:ω⟶𝒫 𝐴) → (dom 𝐹 ∩ ran 𝐺) ≠ ∅)
65		imadisj 6040	. . . . . . . 8 ⊢ ((𝐹 “ ran 𝐺) = ∅ ↔ (dom 𝐹 ∩ ran 𝐺) = ∅)
66	65	necon3bii 2985	. . . . . . 7 ⊢ ((𝐹 “ ran 𝐺) ≠ ∅ ↔ (dom 𝐹 ∩ ran 𝐺) ≠ ∅)
67	64, 66	sylibr 234	. . . . . 6 ⊢ ((𝐴 ∈ Fin^III ∧ 𝐺:ω⟶𝒫 𝐴) → (𝐹 “ ran 𝐺) ≠ ∅)
68	1	isf34lem5 10294	. . . . . 6 ⊢ ((𝐴 ∈ Fin^III ∧ ((𝐹 “ ran 𝐺) ⊆ 𝒫 𝐴 ∧ (𝐹 “ ran 𝐺) ≠ ∅)) → (𝐹‘∩ (𝐹 “ ran 𝐺)) = ∪ (𝐹 “ (𝐹 “ ran 𝐺)))
69	45, 46, 67, 68	syl12anc 837	. . . . 5 ⊢ ((𝐴 ∈ Fin^III ∧ 𝐺:ω⟶𝒫 𝐴) → (𝐹‘∩ (𝐹 “ ran 𝐺)) = ∪ (𝐹 “ (𝐹 “ ran 𝐺)))
70	1	isf34lem3 10291	. . . . . . 7 ⊢ ((𝐴 ∈ Fin^III ∧ ran 𝐺 ⊆ 𝒫 𝐴) → (𝐹 “ (𝐹 “ ran 𝐺)) = ran 𝐺)
71	45, 49, 70	syl2anc 585	. . . . . 6 ⊢ ((𝐴 ∈ Fin^III ∧ 𝐺:ω⟶𝒫 𝐴) → (𝐹 “ (𝐹 “ ran 𝐺)) = ran 𝐺)
72	71	unieqd 4864	. . . . 5 ⊢ ((𝐴 ∈ Fin^III ∧ 𝐺:ω⟶𝒫 𝐴) → ∪ (𝐹 “ (𝐹 “ ran 𝐺)) = ∪ ran 𝐺)
73	69, 72	eqtrd 2772	. . . 4 ⊢ ((𝐴 ∈ Fin^III ∧ 𝐺:ω⟶𝒫 𝐴) → (𝐹‘∩ (𝐹 “ ran 𝐺)) = ∪ ran 𝐺)
74	73, 71	eleq12d 2831	. . 3 ⊢ ((𝐴 ∈ Fin^III ∧ 𝐺:ω⟶𝒫 𝐴) → ((𝐹‘∩ (𝐹 “ ran 𝐺)) ∈ (𝐹 “ (𝐹 “ ran 𝐺)) ↔ ∪ ran 𝐺 ∈ ran 𝐺))
75	74	3adant3 1133	. 2 ⊢ ((𝐴 ∈ Fin^III ∧ 𝐺:ω⟶𝒫 𝐴 ∧ ∀𝑦 ∈ ω (𝐺‘𝑦) ⊆ (𝐺‘suc 𝑦)) → ((𝐹‘∩ (𝐹 “ ran 𝐺)) ∈ (𝐹 “ (𝐹 “ ran 𝐺)) ↔ ∪ ran 𝐺 ∈ ran 𝐺))
76	44, 75	mpbid 232	1 ⊢ ((𝐴 ∈ Fin^III ∧ 𝐺:ω⟶𝒫 𝐴 ∧ ∀𝑦 ∈ ω (𝐺‘𝑦) ⊆ (𝐺‘suc 𝑦)) → ∪ ran 𝐺 ∈ ran 𝐺)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 ≠ wne 2933 ∀wral 3052 ∖ cdif 3887 ∩ cin 3889 ⊆ wss 3890 ∅c0 4274 𝒫 cpw 4542 ∪ cuni 4851 ∩ cint 4890 ↦ cmpt 5167 dom cdm 5625 ran crn 5626 “ cima 5628 ∘ ccom 5629 suc csuc 6320 Fn wfn 6488 ⟶wf 6489 ‘cfv 6493 ωcom 7811 Fin^IIIcfin3 10197

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 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5213 ax-sep 5232 ax-nul 5242 ax-pow 5303 ax-pr 5371 ax-un 7683

This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3063 df-rmo 3343 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-int 4891 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5520 df-eprel 5525 df-po 5533 df-so 5534 df-fr 5578 df-se 5579 df-we 5580 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-pred 6260 df-ord 6321 df-on 6322 df-lim 6323 df-suc 6324 df-iota 6449 df-fun 6495 df-fn 6496 df-f 6497 df-f1 6498 df-fo 6499 df-f1o 6500 df-fv 6501 df-isom 6502 df-riota 7318 df-ov 7364 df-rpss 7671 df-om 7812 df-2nd 7937 df-frecs 8225 df-wrecs 8256 df-recs 8305 df-rdg 8343 df-1o 8399 df-er 8637 df-en 8888 df-dom 8889 df-sdom 8890 df-fin 8891 df-wdom 9474 df-card 9857 df-fin4 10203 df-fin3 10204

This theorem is referenced by: isf34lem6 10296 fin34i 10297

W3C validator