Theorem isf34lem6 10302

Description: Lemma for isfin3-4 10304. (Contributed by Stefan O'Rear, 7-Nov-2014.) (Revised by Mario Carneiro, 17-May-2015.)

Hypothesis

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

Assertion

Ref	Expression
isf34lem6	⊢ (𝐴 ∈ 𝑉 → (𝐴 ∈ FinIII ↔ ∀𝑓 ∈ (𝒫 𝐴 ↑m ω)(∀𝑦 ∈ ω (𝑓‘𝑦) ⊆ (𝑓‘suc 𝑦) → ∪ ran 𝑓 ∈ ran 𝑓)))

Distinct variable groups:   𝑥,𝑓,𝑦,𝐴   𝑓,𝐹,𝑦   𝑥,𝑉,𝑦

Allowed substitution hints:   𝐹(𝑥)   𝑉(𝑓)

Proof of Theorem isf34lem6

Dummy variable 𝑔 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		elmapi 8796	. . . 4 ⊢ (𝑓 ∈ (𝒫 𝐴 ↑m ω) → 𝑓:ω⟶𝒫 𝐴)
2		compss.a	. . . . . 6 ⊢ 𝐹 = (𝑥 ∈ 𝒫 𝐴 ↦ (𝐴 ∖ 𝑥))
3	2	isf34lem7 10301	. . . . 5 ⊢ ((𝐴 ∈ FinIII ∧ 𝑓:ω⟶𝒫 𝐴 ∧ ∀𝑦 ∈ ω (𝑓‘𝑦) ⊆ (𝑓‘suc 𝑦)) → ∪ ran 𝑓 ∈ ran 𝑓)
4	3	3expia 1122	. . . 4 ⊢ ((𝐴 ∈ FinIII ∧ 𝑓:ω⟶𝒫 𝐴) → (∀𝑦 ∈ ω (𝑓‘𝑦) ⊆ (𝑓‘suc 𝑦) → ∪ ran 𝑓 ∈ ran 𝑓))
5	1, 4	sylan2 594	. . 3 ⊢ ((𝐴 ∈ FinIII ∧ 𝑓 ∈ (𝒫 𝐴 ↑m ω)) → (∀𝑦 ∈ ω (𝑓‘𝑦) ⊆ (𝑓‘suc 𝑦) → ∪ ran 𝑓 ∈ ran 𝑓))
6	5	ralrimiva 3129	. 2 ⊢ (𝐴 ∈ FinIII → ∀𝑓 ∈ (𝒫 𝐴 ↑m ω)(∀𝑦 ∈ ω (𝑓‘𝑦) ⊆ (𝑓‘suc 𝑦) → ∪ ran 𝑓 ∈ ran 𝑓))
7		elmapex 8795	. . . . . . . . . . 11 ⊢ (𝑔 ∈ (𝒫 𝐴 ↑m ω) → (𝒫 𝐴 ∈ V ∧ ω ∈ V))
8	7	simpld 494	. . . . . . . . . 10 ⊢ (𝑔 ∈ (𝒫 𝐴 ↑m ω) → 𝒫 𝐴 ∈ V)
9		pwexb 7720	. . . . . . . . . 10 ⊢ (𝐴 ∈ V ↔ 𝒫 𝐴 ∈ V)
10	8, 9	sylibr 234	. . . . . . . . 9 ⊢ (𝑔 ∈ (𝒫 𝐴 ↑m ω) → 𝐴 ∈ V)
11	2	isf34lem2 10295	. . . . . . . . 9 ⊢ (𝐴 ∈ V → 𝐹:𝒫 𝐴⟶𝒫 𝐴)
12	10, 11	syl 17	. . . . . . . 8 ⊢ (𝑔 ∈ (𝒫 𝐴 ↑m ω) → 𝐹:𝒫 𝐴⟶𝒫 𝐴)
13		elmapi 8796	. . . . . . . 8 ⊢ (𝑔 ∈ (𝒫 𝐴 ↑m ω) → 𝑔:ω⟶𝒫 𝐴)
14		fco 6692	. . . . . . . 8 ⊢ ((𝐹:𝒫 𝐴⟶𝒫 𝐴 ∧ 𝑔:ω⟶𝒫 𝐴) → (𝐹 ∘ 𝑔):ω⟶𝒫 𝐴)
15	12, 13, 14	syl2anc 585	. . . . . . 7 ⊢ (𝑔 ∈ (𝒫 𝐴 ↑m ω) → (𝐹 ∘ 𝑔):ω⟶𝒫 𝐴)
16		elmapg 8786	. . . . . . . 8 ⊢ ((𝒫 𝐴 ∈ V ∧ ω ∈ V) → ((𝐹 ∘ 𝑔) ∈ (𝒫 𝐴 ↑m ω) ↔ (𝐹 ∘ 𝑔):ω⟶𝒫 𝐴))
17	7, 16	syl 17	. . . . . . 7 ⊢ (𝑔 ∈ (𝒫 𝐴 ↑m ω) → ((𝐹 ∘ 𝑔) ∈ (𝒫 𝐴 ↑m ω) ↔ (𝐹 ∘ 𝑔):ω⟶𝒫 𝐴))
18	15, 17	mpbird 257	. . . . . 6 ⊢ (𝑔 ∈ (𝒫 𝐴 ↑m ω) → (𝐹 ∘ 𝑔) ∈ (𝒫 𝐴 ↑m ω))
19		fveq1 6839	. . . . . . . . . 10 ⊢ (𝑓 = (𝐹 ∘ 𝑔) → (𝑓‘𝑦) = ((𝐹 ∘ 𝑔)‘𝑦))
20		fveq1 6839	. . . . . . . . . 10 ⊢ (𝑓 = (𝐹 ∘ 𝑔) → (𝑓‘suc 𝑦) = ((𝐹 ∘ 𝑔)‘suc 𝑦))
21	19, 20	sseq12d 3955	. . . . . . . . 9 ⊢ (𝑓 = (𝐹 ∘ 𝑔) → ((𝑓‘𝑦) ⊆ (𝑓‘suc 𝑦) ↔ ((𝐹 ∘ 𝑔)‘𝑦) ⊆ ((𝐹 ∘ 𝑔)‘suc 𝑦)))
22	21	ralbidv 3160	. . . . . . . 8 ⊢ (𝑓 = (𝐹 ∘ 𝑔) → (∀𝑦 ∈ ω (𝑓‘𝑦) ⊆ (𝑓‘suc 𝑦) ↔ ∀𝑦 ∈ ω ((𝐹 ∘ 𝑔)‘𝑦) ⊆ ((𝐹 ∘ 𝑔)‘suc 𝑦)))
23		rneq 5891	. . . . . . . . . . 11 ⊢ (𝑓 = (𝐹 ∘ 𝑔) → ran 𝑓 = ran (𝐹 ∘ 𝑔))
24		rnco2 6218	. . . . . . . . . . 11 ⊢ ran (𝐹 ∘ 𝑔) = (𝐹 “ ran 𝑔)
25	23, 24	eqtrdi 2787	. . . . . . . . . 10 ⊢ (𝑓 = (𝐹 ∘ 𝑔) → ran 𝑓 = (𝐹 “ ran 𝑔))
26	25	unieqd 4863	. . . . . . . . 9 ⊢ (𝑓 = (𝐹 ∘ 𝑔) → ∪ ran 𝑓 = ∪ (𝐹 “ ran 𝑔))
27	26, 25	eleq12d 2830	. . . . . . . 8 ⊢ (𝑓 = (𝐹 ∘ 𝑔) → (∪ ran 𝑓 ∈ ran 𝑓 ↔ ∪ (𝐹 “ ran 𝑔) ∈ (𝐹 “ ran 𝑔)))
28	22, 27	imbi12d 344	. . . . . . 7 ⊢ (𝑓 = (𝐹 ∘ 𝑔) → ((∀𝑦 ∈ ω (𝑓‘𝑦) ⊆ (𝑓‘suc 𝑦) → ∪ ran 𝑓 ∈ ran 𝑓) ↔ (∀𝑦 ∈ ω ((𝐹 ∘ 𝑔)‘𝑦) ⊆ ((𝐹 ∘ 𝑔)‘suc 𝑦) → ∪ (𝐹 “ ran 𝑔) ∈ (𝐹 “ ran 𝑔))))
29	28	rspccv 3561	. . . . . 6 ⊢ (∀𝑓 ∈ (𝒫 𝐴 ↑m ω)(∀𝑦 ∈ ω (𝑓‘𝑦) ⊆ (𝑓‘suc 𝑦) → ∪ ran 𝑓 ∈ ran 𝑓) → ((𝐹 ∘ 𝑔) ∈ (𝒫 𝐴 ↑m ω) → (∀𝑦 ∈ ω ((𝐹 ∘ 𝑔)‘𝑦) ⊆ ((𝐹 ∘ 𝑔)‘suc 𝑦) → ∪ (𝐹 “ ran 𝑔) ∈ (𝐹 “ ran 𝑔))))
30	18, 29	syl5 34	. . . . 5 ⊢ (∀𝑓 ∈ (𝒫 𝐴 ↑m ω)(∀𝑦 ∈ ω (𝑓‘𝑦) ⊆ (𝑓‘suc 𝑦) → ∪ ran 𝑓 ∈ ran 𝑓) → (𝑔 ∈ (𝒫 𝐴 ↑m ω) → (∀𝑦 ∈ ω ((𝐹 ∘ 𝑔)‘𝑦) ⊆ ((𝐹 ∘ 𝑔)‘suc 𝑦) → ∪ (𝐹 “ ran 𝑔) ∈ (𝐹 “ ran 𝑔))))
31		sscon 4083	. . . . . . . . 9 ⊢ ((𝑔‘suc 𝑦) ⊆ (𝑔‘𝑦) → (𝐴 ∖ (𝑔‘𝑦)) ⊆ (𝐴 ∖ (𝑔‘suc 𝑦)))
32	13	ffvelcdmda 7036	. . . . . . . . . . . 12 ⊢ ((𝑔 ∈ (𝒫 𝐴 ↑m ω) ∧ 𝑦 ∈ ω) → (𝑔‘𝑦) ∈ 𝒫 𝐴)
33	32	elpwid 4550	. . . . . . . . . . 11 ⊢ ((𝑔 ∈ (𝒫 𝐴 ↑m ω) ∧ 𝑦 ∈ ω) → (𝑔‘𝑦) ⊆ 𝐴)
34	2	isf34lem1 10294	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ V ∧ (𝑔‘𝑦) ⊆ 𝐴) → (𝐹‘(𝑔‘𝑦)) = (𝐴 ∖ (𝑔‘𝑦)))
35	10, 33, 34	syl2an2r 686	. . . . . . . . . 10 ⊢ ((𝑔 ∈ (𝒫 𝐴 ↑m ω) ∧ 𝑦 ∈ ω) → (𝐹‘(𝑔‘𝑦)) = (𝐴 ∖ (𝑔‘𝑦)))
36		peano2 7841	. . . . . . . . . . . . 13 ⊢ (𝑦 ∈ ω → suc 𝑦 ∈ ω)
37		ffvelcdm 7033	. . . . . . . . . . . . 13 ⊢ ((𝑔:ω⟶𝒫 𝐴 ∧ suc 𝑦 ∈ ω) → (𝑔‘suc 𝑦) ∈ 𝒫 𝐴)
38	13, 36, 37	syl2an 597	. . . . . . . . . . . 12 ⊢ ((𝑔 ∈ (𝒫 𝐴 ↑m ω) ∧ 𝑦 ∈ ω) → (𝑔‘suc 𝑦) ∈ 𝒫 𝐴)
39	38	elpwid 4550	. . . . . . . . . . 11 ⊢ ((𝑔 ∈ (𝒫 𝐴 ↑m ω) ∧ 𝑦 ∈ ω) → (𝑔‘suc 𝑦) ⊆ 𝐴)
40	2	isf34lem1 10294	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ V ∧ (𝑔‘suc 𝑦) ⊆ 𝐴) → (𝐹‘(𝑔‘suc 𝑦)) = (𝐴 ∖ (𝑔‘suc 𝑦)))
41	10, 39, 40	syl2an2r 686	. . . . . . . . . 10 ⊢ ((𝑔 ∈ (𝒫 𝐴 ↑m ω) ∧ 𝑦 ∈ ω) → (𝐹‘(𝑔‘suc 𝑦)) = (𝐴 ∖ (𝑔‘suc 𝑦)))
42	35, 41	sseq12d 3955	. . . . . . . . 9 ⊢ ((𝑔 ∈ (𝒫 𝐴 ↑m ω) ∧ 𝑦 ∈ ω) → ((𝐹‘(𝑔‘𝑦)) ⊆ (𝐹‘(𝑔‘suc 𝑦)) ↔ (𝐴 ∖ (𝑔‘𝑦)) ⊆ (𝐴 ∖ (𝑔‘suc 𝑦))))
43	31, 42	imbitrrid 246	. . . . . . . 8 ⊢ ((𝑔 ∈ (𝒫 𝐴 ↑m ω) ∧ 𝑦 ∈ ω) → ((𝑔‘suc 𝑦) ⊆ (𝑔‘𝑦) → (𝐹‘(𝑔‘𝑦)) ⊆ (𝐹‘(𝑔‘suc 𝑦))))
44		fvco3 6939	. . . . . . . . . 10 ⊢ ((𝑔:ω⟶𝒫 𝐴 ∧ 𝑦 ∈ ω) → ((𝐹 ∘ 𝑔)‘𝑦) = (𝐹‘(𝑔‘𝑦)))
45	13, 44	sylan 581	. . . . . . . . 9 ⊢ ((𝑔 ∈ (𝒫 𝐴 ↑m ω) ∧ 𝑦 ∈ ω) → ((𝐹 ∘ 𝑔)‘𝑦) = (𝐹‘(𝑔‘𝑦)))
46		fvco3 6939	. . . . . . . . . 10 ⊢ ((𝑔:ω⟶𝒫 𝐴 ∧ suc 𝑦 ∈ ω) → ((𝐹 ∘ 𝑔)‘suc 𝑦) = (𝐹‘(𝑔‘suc 𝑦)))
47	13, 36, 46	syl2an 597	. . . . . . . . 9 ⊢ ((𝑔 ∈ (𝒫 𝐴 ↑m ω) ∧ 𝑦 ∈ ω) → ((𝐹 ∘ 𝑔)‘suc 𝑦) = (𝐹‘(𝑔‘suc 𝑦)))
48	45, 47	sseq12d 3955	. . . . . . . 8 ⊢ ((𝑔 ∈ (𝒫 𝐴 ↑m ω) ∧ 𝑦 ∈ ω) → (((𝐹 ∘ 𝑔)‘𝑦) ⊆ ((𝐹 ∘ 𝑔)‘suc 𝑦) ↔ (𝐹‘(𝑔‘𝑦)) ⊆ (𝐹‘(𝑔‘suc 𝑦))))
49	43, 48	sylibrd 259	. . . . . . 7 ⊢ ((𝑔 ∈ (𝒫 𝐴 ↑m ω) ∧ 𝑦 ∈ ω) → ((𝑔‘suc 𝑦) ⊆ (𝑔‘𝑦) → ((𝐹 ∘ 𝑔)‘𝑦) ⊆ ((𝐹 ∘ 𝑔)‘suc 𝑦)))
50	49	ralimdva 3149	. . . . . 6 ⊢ (𝑔 ∈ (𝒫 𝐴 ↑m ω) → (∀𝑦 ∈ ω (𝑔‘suc 𝑦) ⊆ (𝑔‘𝑦) → ∀𝑦 ∈ ω ((𝐹 ∘ 𝑔)‘𝑦) ⊆ ((𝐹 ∘ 𝑔)‘suc 𝑦)))
51	12	ffnd 6669	. . . . . . . 8 ⊢ (𝑔 ∈ (𝒫 𝐴 ↑m ω) → 𝐹 Fn 𝒫 𝐴)
52		imassrn 6036	. . . . . . . . 9 ⊢ (𝐹 “ ran 𝑔) ⊆ ran 𝐹
53	12	frnd 6676	. . . . . . . . 9 ⊢ (𝑔 ∈ (𝒫 𝐴 ↑m ω) → ran 𝐹 ⊆ 𝒫 𝐴)
54	52, 53	sstrid 3933	. . . . . . . 8 ⊢ (𝑔 ∈ (𝒫 𝐴 ↑m ω) → (𝐹 “ ran 𝑔) ⊆ 𝒫 𝐴)
55		fnfvima 7188	. . . . . . . . 9 ⊢ ((𝐹 Fn 𝒫 𝐴 ∧ (𝐹 “ ran 𝑔) ⊆ 𝒫 𝐴 ∧ ∪ (𝐹 “ ran 𝑔) ∈ (𝐹 “ ran 𝑔)) → (𝐹‘∪ (𝐹 “ ran 𝑔)) ∈ (𝐹 “ (𝐹 “ ran 𝑔)))
56	55	3expia 1122	. . . . . . . 8 ⊢ ((𝐹 Fn 𝒫 𝐴 ∧ (𝐹 “ ran 𝑔) ⊆ 𝒫 𝐴) → (∪ (𝐹 “ ran 𝑔) ∈ (𝐹 “ ran 𝑔) → (𝐹‘∪ (𝐹 “ ran 𝑔)) ∈ (𝐹 “ (𝐹 “ ran 𝑔))))
57	51, 54, 56	syl2anc 585	. . . . . . 7 ⊢ (𝑔 ∈ (𝒫 𝐴 ↑m ω) → (∪ (𝐹 “ ran 𝑔) ∈ (𝐹 “ ran 𝑔) → (𝐹‘∪ (𝐹 “ ran 𝑔)) ∈ (𝐹 “ (𝐹 “ ran 𝑔))))
58		incom 4149	. . . . . . . . . . . . 13 ⊢ (dom 𝐹 ∩ ran 𝑔) = (ran 𝑔 ∩ dom 𝐹)
59	13	frnd 6676	. . . . . . . . . . . . . . 15 ⊢ (𝑔 ∈ (𝒫 𝐴 ↑m ω) → ran 𝑔 ⊆ 𝒫 𝐴)
60	12	fdmd 6678	. . . . . . . . . . . . . . 15 ⊢ (𝑔 ∈ (𝒫 𝐴 ↑m ω) → dom 𝐹 = 𝒫 𝐴)
61	59, 60	sseqtrrd 3959	. . . . . . . . . . . . . 14 ⊢ (𝑔 ∈ (𝒫 𝐴 ↑m ω) → ran 𝑔 ⊆ dom 𝐹)
62		dfss2 3907	. . . . . . . . . . . . . 14 ⊢ (ran 𝑔 ⊆ dom 𝐹 ↔ (ran 𝑔 ∩ dom 𝐹) = ran 𝑔)
63	61, 62	sylib 218	. . . . . . . . . . . . 13 ⊢ (𝑔 ∈ (𝒫 𝐴 ↑m ω) → (ran 𝑔 ∩ dom 𝐹) = ran 𝑔)
64	58, 63	eqtrid 2783	. . . . . . . . . . . 12 ⊢ (𝑔 ∈ (𝒫 𝐴 ↑m ω) → (dom 𝐹 ∩ ran 𝑔) = ran 𝑔)
65	13	fdmd 6678	. . . . . . . . . . . . . 14 ⊢ (𝑔 ∈ (𝒫 𝐴 ↑m ω) → dom 𝑔 = ω)
66		peano1 7840	. . . . . . . . . . . . . . 15 ⊢ ∅ ∈ ω
67		ne0i 4281	. . . . . . . . . . . . . . 15 ⊢ (∅ ∈ ω → ω ≠ ∅)
68	66, 67	mp1i 13	. . . . . . . . . . . . . 14 ⊢ (𝑔 ∈ (𝒫 𝐴 ↑m ω) → ω ≠ ∅)
69	65, 68	eqnetrd 2999	. . . . . . . . . . . . 13 ⊢ (𝑔 ∈ (𝒫 𝐴 ↑m ω) → dom 𝑔 ≠ ∅)
70		dm0rn0 5879	. . . . . . . . . . . . . 14 ⊢ (dom 𝑔 = ∅ ↔ ran 𝑔 = ∅)
71	70	necon3bii 2984	. . . . . . . . . . . . 13 ⊢ (dom 𝑔 ≠ ∅ ↔ ran 𝑔 ≠ ∅)
72	69, 71	sylib 218	. . . . . . . . . . . 12 ⊢ (𝑔 ∈ (𝒫 𝐴 ↑m ω) → ran 𝑔 ≠ ∅)
73	64, 72	eqnetrd 2999	. . . . . . . . . . 11 ⊢ (𝑔 ∈ (𝒫 𝐴 ↑m ω) → (dom 𝐹 ∩ ran 𝑔) ≠ ∅)
74		imadisj 6045	. . . . . . . . . . . 12 ⊢ ((𝐹 “ ran 𝑔) = ∅ ↔ (dom 𝐹 ∩ ran 𝑔) = ∅)
75	74	necon3bii 2984	. . . . . . . . . . 11 ⊢ ((𝐹 “ ran 𝑔) ≠ ∅ ↔ (dom 𝐹 ∩ ran 𝑔) ≠ ∅)
76	73, 75	sylibr 234	. . . . . . . . . 10 ⊢ (𝑔 ∈ (𝒫 𝐴 ↑m ω) → (𝐹 “ ran 𝑔) ≠ ∅)
77	2	isf34lem4 10299	. . . . . . . . . 10 ⊢ ((𝐴 ∈ V ∧ ((𝐹 “ ran 𝑔) ⊆ 𝒫 𝐴 ∧ (𝐹 “ ran 𝑔) ≠ ∅)) → (𝐹‘∪ (𝐹 “ ran 𝑔)) = ∩ (𝐹 “ (𝐹 “ ran 𝑔)))
78	10, 54, 76, 77	syl12anc 837	. . . . . . . . 9 ⊢ (𝑔 ∈ (𝒫 𝐴 ↑m ω) → (𝐹‘∪ (𝐹 “ ran 𝑔)) = ∩ (𝐹 “ (𝐹 “ ran 𝑔)))
79	2	isf34lem3 10297	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ V ∧ ran 𝑔 ⊆ 𝒫 𝐴) → (𝐹 “ (𝐹 “ ran 𝑔)) = ran 𝑔)
80	10, 59, 79	syl2anc 585	. . . . . . . . . 10 ⊢ (𝑔 ∈ (𝒫 𝐴 ↑m ω) → (𝐹 “ (𝐹 “ ran 𝑔)) = ran 𝑔)
81	80	inteqd 4894	. . . . . . . . 9 ⊢ (𝑔 ∈ (𝒫 𝐴 ↑m ω) → ∩ (𝐹 “ (𝐹 “ ran 𝑔)) = ∩ ran 𝑔)
82	78, 81	eqtrd 2771	. . . . . . . 8 ⊢ (𝑔 ∈ (𝒫 𝐴 ↑m ω) → (𝐹‘∪ (𝐹 “ ran 𝑔)) = ∩ ran 𝑔)
83	82, 80	eleq12d 2830	. . . . . . 7 ⊢ (𝑔 ∈ (𝒫 𝐴 ↑m ω) → ((𝐹‘∪ (𝐹 “ ran 𝑔)) ∈ (𝐹 “ (𝐹 “ ran 𝑔)) ↔ ∩ ran 𝑔 ∈ ran 𝑔))
84	57, 83	sylibd 239	. . . . . 6 ⊢ (𝑔 ∈ (𝒫 𝐴 ↑m ω) → (∪ (𝐹 “ ran 𝑔) ∈ (𝐹 “ ran 𝑔) → ∩ ran 𝑔 ∈ ran 𝑔))
85	50, 84	imim12d 81	. . . . 5 ⊢ (𝑔 ∈ (𝒫 𝐴 ↑m ω) → ((∀𝑦 ∈ ω ((𝐹 ∘ 𝑔)‘𝑦) ⊆ ((𝐹 ∘ 𝑔)‘suc 𝑦) → ∪ (𝐹 “ ran 𝑔) ∈ (𝐹 “ ran 𝑔)) → (∀𝑦 ∈ ω (𝑔‘suc 𝑦) ⊆ (𝑔‘𝑦) → ∩ ran 𝑔 ∈ ran 𝑔)))
86	30, 85	sylcom 30	. . . 4 ⊢ (∀𝑓 ∈ (𝒫 𝐴 ↑m ω)(∀𝑦 ∈ ω (𝑓‘𝑦) ⊆ (𝑓‘suc 𝑦) → ∪ ran 𝑓 ∈ ran 𝑓) → (𝑔 ∈ (𝒫 𝐴 ↑m ω) → (∀𝑦 ∈ ω (𝑔‘suc 𝑦) ⊆ (𝑔‘𝑦) → ∩ ran 𝑔 ∈ ran 𝑔)))
87	86	ralrimiv 3128	. . 3 ⊢ (∀𝑓 ∈ (𝒫 𝐴 ↑m ω)(∀𝑦 ∈ ω (𝑓‘𝑦) ⊆ (𝑓‘suc 𝑦) → ∪ ran 𝑓 ∈ ran 𝑓) → ∀𝑔 ∈ (𝒫 𝐴 ↑m ω)(∀𝑦 ∈ ω (𝑔‘suc 𝑦) ⊆ (𝑔‘𝑦) → ∩ ran 𝑔 ∈ ran 𝑔))
88		isfin3-3 10290	. . 3 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∈ FinIII ↔ ∀𝑔 ∈ (𝒫 𝐴 ↑m ω)(∀𝑦 ∈ ω (𝑔‘suc 𝑦) ⊆ (𝑔‘𝑦) → ∩ ran 𝑔 ∈ ran 𝑔)))
89	87, 88	imbitrrid 246	. 2 ⊢ (𝐴 ∈ 𝑉 → (∀𝑓 ∈ (𝒫 𝐴 ↑m ω)(∀𝑦 ∈ ω (𝑓‘𝑦) ⊆ (𝑓‘suc 𝑦) → ∪ ran 𝑓 ∈ ran 𝑓) → 𝐴 ∈ FinIII))
90	6, 89	impbid2 226	1 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∈ FinIII ↔ ∀𝑓 ∈ (𝒫 𝐴 ↑m ω)(∀𝑦 ∈ ω (𝑓‘𝑦) ⊆ (𝑓‘suc 𝑦) → ∪ ran 𝑓 ∈ ran 𝑓)))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1542   ∈ wcel 2114   ≠ wne 2932  ∀wral 3051  Vcvv 3429   ∖ cdif 3886   ∩ cin 3888   ⊆ wss 3889  ∅c0 4273  𝒫 cpw 4541  ∪ cuni 4850  ∩ cint 4889   ↦ cmpt 5166  dom cdm 5631  ran crn 5632   “ cima 5634   ∘ ccom 5635  suc csuc 6325   Fn wfn 6493  ⟶wf 6494  ‘cfv 6498  (class class class)co 7367  ωcom 7817   ↑_m cmap 8773  Fin^IIIcfin3 10203

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 2708  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pow 5307  ax-pr 5375  ax-un 7689

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 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3062  df-rmo 3342  df-reu 3343  df-rab 3390  df-v 3431  df-sbc 3729  df-csb 3838  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-pss 3909  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-int 4890  df-iun 4935  df-br 5086  df-opab 5148  df-mpt 5167  df-tr 5193  df-id 5526  df-eprel 5531  df-po 5539  df-so 5540  df-fr 5584  df-se 5585  df-we 5586  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-pred 6265  df-ord 6326  df-on 6327  df-lim 6328  df-suc 6329  df-iota 6454  df-fun 6500  df-fn 6501  df-f 6502  df-f1 6503  df-fo 6504  df-f1o 6505  df-fv 6506  df-isom 6507  df-riota 7324  df-ov 7370  df-oprab 7371  df-mpo 7372  df-rpss 7677  df-om 7818  df-1st 7942  df-2nd 7943  df-frecs 8231  df-wrecs 8262  df-recs 8311  df-rdg 8349  df-seqom 8387  df-1o 8405  df-er 8643  df-map 8775  df-en 8894  df-dom 8895  df-sdom 8896  df-fin 8897  df-wdom 9480  df-card 9863  df-fin4 10209  df-fin3 10210

This theorem is referenced by:  isfin3-4  10304