Theorem fictb 10001

Description: A set is countable iff its collection of finite intersections is countable. (Contributed by Jeff Hankins, 24-Aug-2009.) (Proof shortened by Mario Carneiro, 17-May-2015.)

Assertion

Ref	Expression
fictb	⊢ (𝐴 ∈ 𝐵 → (𝐴 ≼ ω ↔ (fi‘𝐴) ≼ ω))

Proof of Theorem fictb

Dummy variables 𝑥 𝑓 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		brdomi 8748	. . . . 5 ⊢ (𝐴 ≼ ω → ∃𝑓 𝑓:𝐴–1-1→ω)
2	1	adantl 482	. . . 4 ⊢ ((𝐴 ∈ 𝐵 ∧ 𝐴 ≼ ω) → ∃𝑓 𝑓:𝐴–1-1→ω)
3		reldom 8739	. . . . . 6 ⊢ Rel ≼
4	3	brrelex2i 5644	. . . . 5 ⊢ (𝐴 ≼ ω → ω ∈ V)
5		omelon2 7725	. . . . . . . . . . 11 ⊢ (ω ∈ V → ω ∈ On)
6	5	ad2antlr 724	. . . . . . . . . 10 ⊢ (((𝐴 ∈ 𝐵 ∧ ω ∈ V) ∧ 𝑓:𝐴–1-1→ω) → ω ∈ On)
7		pwexg 5301	. . . . . . . . . . . . . 14 ⊢ (𝐴 ∈ 𝐵 → 𝒫 𝐴 ∈ V)
8	7	ad2antrr 723	. . . . . . . . . . . . 13 ⊢ (((𝐴 ∈ 𝐵 ∧ ω ∈ V) ∧ 𝑓:𝐴–1-1→ω) → 𝒫 𝐴 ∈ V)
9		inex1g 5243	. . . . . . . . . . . . 13 ⊢ (𝒫 𝐴 ∈ V → (𝒫 𝐴 ∩ Fin) ∈ V)
10	8, 9	syl 17	. . . . . . . . . . . 12 ⊢ (((𝐴 ∈ 𝐵 ∧ ω ∈ V) ∧ 𝑓:𝐴–1-1→ω) → (𝒫 𝐴 ∩ Fin) ∈ V)
11		difss 4066	. . . . . . . . . . . 12 ⊢ ((𝒫 𝐴 ∩ Fin) ∖ {∅}) ⊆ (𝒫 𝐴 ∩ Fin)
12		ssdomg 8786	. . . . . . . . . . . 12 ⊢ ((𝒫 𝐴 ∩ Fin) ∈ V → (((𝒫 𝐴 ∩ Fin) ∖ {∅}) ⊆ (𝒫 𝐴 ∩ Fin) → ((𝒫 𝐴 ∩ Fin) ∖ {∅}) ≼ (𝒫 𝐴 ∩ Fin)))
13	10, 11, 12	mpisyl 21	. . . . . . . . . . 11 ⊢ (((𝐴 ∈ 𝐵 ∧ ω ∈ V) ∧ 𝑓:𝐴–1-1→ω) → ((𝒫 𝐴 ∩ Fin) ∖ {∅}) ≼ (𝒫 𝐴 ∩ Fin))
14		f1f1orn 6727	. . . . . . . . . . . . . . 15 ⊢ (𝑓:𝐴–1-1→ω → 𝑓:𝐴–1-1-onto→ran 𝑓)
15	14	adantl 482	. . . . . . . . . . . . . 14 ⊢ (((𝐴 ∈ 𝐵 ∧ ω ∈ V) ∧ 𝑓:𝐴–1-1→ω) → 𝑓:𝐴–1-1-onto→ran 𝑓)
16		f1opwfi 9123	. . . . . . . . . . . . . 14 ⊢ (𝑓:𝐴–1-1-onto→ran 𝑓 → (𝑥 ∈ (𝒫 𝐴 ∩ Fin) ↦ (𝑓 “ 𝑥)):(𝒫 𝐴 ∩ Fin)–1-1-onto→(𝒫 ran 𝑓 ∩ Fin))
17	15, 16	syl 17	. . . . . . . . . . . . 13 ⊢ (((𝐴 ∈ 𝐵 ∧ ω ∈ V) ∧ 𝑓:𝐴–1-1→ω) → (𝑥 ∈ (𝒫 𝐴 ∩ Fin) ↦ (𝑓 “ 𝑥)):(𝒫 𝐴 ∩ Fin)–1-1-onto→(𝒫 ran 𝑓 ∩ Fin))
18		f1oeng 8759	. . . . . . . . . . . . 13 ⊢ (((𝒫 𝐴 ∩ Fin) ∈ V ∧ (𝑥 ∈ (𝒫 𝐴 ∩ Fin) ↦ (𝑓 “ 𝑥)):(𝒫 𝐴 ∩ Fin)–1-1-onto→(𝒫 ran 𝑓 ∩ Fin)) → (𝒫 𝐴 ∩ Fin) ≈ (𝒫 ran 𝑓 ∩ Fin))
19	10, 17, 18	syl2anc 584	. . . . . . . . . . . 12 ⊢ (((𝐴 ∈ 𝐵 ∧ ω ∈ V) ∧ 𝑓:𝐴–1-1→ω) → (𝒫 𝐴 ∩ Fin) ≈ (𝒫 ran 𝑓 ∩ Fin))
20		pwexg 5301	. . . . . . . . . . . . . . . 16 ⊢ (ω ∈ V → 𝒫 ω ∈ V)
21	20	ad2antlr 724	. . . . . . . . . . . . . . 15 ⊢ (((𝐴 ∈ 𝐵 ∧ ω ∈ V) ∧ 𝑓:𝐴–1-1→ω) → 𝒫 ω ∈ V)
22		inex1g 5243	. . . . . . . . . . . . . . 15 ⊢ (𝒫 ω ∈ V → (𝒫 ω ∩ Fin) ∈ V)
23	21, 22	syl 17	. . . . . . . . . . . . . 14 ⊢ (((𝐴 ∈ 𝐵 ∧ ω ∈ V) ∧ 𝑓:𝐴–1-1→ω) → (𝒫 ω ∩ Fin) ∈ V)
24		f1f 6670	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑓:𝐴–1-1→ω → 𝑓:𝐴⟶ω)
25	24	frnd 6608	. . . . . . . . . . . . . . . . 17 ⊢ (𝑓:𝐴–1-1→ω → ran 𝑓 ⊆ ω)
26	25	adantl 482	. . . . . . . . . . . . . . . 16 ⊢ (((𝐴 ∈ 𝐵 ∧ ω ∈ V) ∧ 𝑓:𝐴–1-1→ω) → ran 𝑓 ⊆ ω)
27	26	sspwd 4548	. . . . . . . . . . . . . . 15 ⊢ (((𝐴 ∈ 𝐵 ∧ ω ∈ V) ∧ 𝑓:𝐴–1-1→ω) → 𝒫 ran 𝑓 ⊆ 𝒫 ω)
28	27	ssrind 4169	. . . . . . . . . . . . . 14 ⊢ (((𝐴 ∈ 𝐵 ∧ ω ∈ V) ∧ 𝑓:𝐴–1-1→ω) → (𝒫 ran 𝑓 ∩ Fin) ⊆ (𝒫 ω ∩ Fin))
29		ssdomg 8786	. . . . . . . . . . . . . 14 ⊢ ((𝒫 ω ∩ Fin) ∈ V → ((𝒫 ran 𝑓 ∩ Fin) ⊆ (𝒫 ω ∩ Fin) → (𝒫 ran 𝑓 ∩ Fin) ≼ (𝒫 ω ∩ Fin)))
30	23, 28, 29	sylc 65	. . . . . . . . . . . . 13 ⊢ (((𝐴 ∈ 𝐵 ∧ ω ∈ V) ∧ 𝑓:𝐴–1-1→ω) → (𝒫 ran 𝑓 ∩ Fin) ≼ (𝒫 ω ∩ Fin))
31		sneq 4571	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑓 = 𝑧 → {𝑓} = {𝑧})
32		pweq 4549	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑓 = 𝑧 → 𝒫 𝑓 = 𝒫 𝑧)
33	31, 32	xpeq12d 5620	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑓 = 𝑧 → ({𝑓} × 𝒫 𝑓) = ({𝑧} × 𝒫 𝑧))
34	33	cbviunv 4970	. . . . . . . . . . . . . . . . . 18 ⊢ ∪ 𝑓 ∈ 𝑥 ({𝑓} × 𝒫 𝑓) = ∪ 𝑧 ∈ 𝑥 ({𝑧} × 𝒫 𝑧)
35		iuneq1 4940	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑥 = 𝑦 → ∪ 𝑧 ∈ 𝑥 ({𝑧} × 𝒫 𝑧) = ∪ 𝑧 ∈ 𝑦 ({𝑧} × 𝒫 𝑧))
36	34, 35	eqtrid 2790	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 = 𝑦 → ∪ 𝑓 ∈ 𝑥 ({𝑓} × 𝒫 𝑓) = ∪ 𝑧 ∈ 𝑦 ({𝑧} × 𝒫 𝑧))
37	36	fveq2d 6778	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 = 𝑦 → (card‘∪ 𝑓 ∈ 𝑥 ({𝑓} × 𝒫 𝑓)) = (card‘∪ 𝑧 ∈ 𝑦 ({𝑧} × 𝒫 𝑧)))
38	37	cbvmptv 5187	. . . . . . . . . . . . . . 15 ⊢ (𝑥 ∈ (𝒫 ω ∩ Fin) ↦ (card‘∪ 𝑓 ∈ 𝑥 ({𝑓} × 𝒫 𝑓))) = (𝑦 ∈ (𝒫 ω ∩ Fin) ↦ (card‘∪ 𝑧 ∈ 𝑦 ({𝑧} × 𝒫 𝑧)))
39	38	ackbij1 9994	. . . . . . . . . . . . . 14 ⊢ (𝑥 ∈ (𝒫 ω ∩ Fin) ↦ (card‘∪ 𝑓 ∈ 𝑥 ({𝑓} × 𝒫 𝑓))):(𝒫 ω ∩ Fin)–1-1-onto→ω
40		f1oeng 8759	. . . . . . . . . . . . . 14 ⊢ (((𝒫 ω ∩ Fin) ∈ V ∧ (𝑥 ∈ (𝒫 ω ∩ Fin) ↦ (card‘∪ 𝑓 ∈ 𝑥 ({𝑓} × 𝒫 𝑓))):(𝒫 ω ∩ Fin)–1-1-onto→ω) → (𝒫 ω ∩ Fin) ≈ ω)
41	23, 39, 40	sylancl 586	. . . . . . . . . . . . 13 ⊢ (((𝐴 ∈ 𝐵 ∧ ω ∈ V) ∧ 𝑓:𝐴–1-1→ω) → (𝒫 ω ∩ Fin) ≈ ω)
42		domentr 8799	. . . . . . . . . . . . 13 ⊢ (((𝒫 ran 𝑓 ∩ Fin) ≼ (𝒫 ω ∩ Fin) ∧ (𝒫 ω ∩ Fin) ≈ ω) → (𝒫 ran 𝑓 ∩ Fin) ≼ ω)
43	30, 41, 42	syl2anc 584	. . . . . . . . . . . 12 ⊢ (((𝐴 ∈ 𝐵 ∧ ω ∈ V) ∧ 𝑓:𝐴–1-1→ω) → (𝒫 ran 𝑓 ∩ Fin) ≼ ω)
44		endomtr 8798	. . . . . . . . . . . 12 ⊢ (((𝒫 𝐴 ∩ Fin) ≈ (𝒫 ran 𝑓 ∩ Fin) ∧ (𝒫 ran 𝑓 ∩ Fin) ≼ ω) → (𝒫 𝐴 ∩ Fin) ≼ ω)
45	19, 43, 44	syl2anc 584	. . . . . . . . . . 11 ⊢ (((𝐴 ∈ 𝐵 ∧ ω ∈ V) ∧ 𝑓:𝐴–1-1→ω) → (𝒫 𝐴 ∩ Fin) ≼ ω)
46		domtr 8793	. . . . . . . . . . 11 ⊢ ((((𝒫 𝐴 ∩ Fin) ∖ {∅}) ≼ (𝒫 𝐴 ∩ Fin) ∧ (𝒫 𝐴 ∩ Fin) ≼ ω) → ((𝒫 𝐴 ∩ Fin) ∖ {∅}) ≼ ω)
47	13, 45, 46	syl2anc 584	. . . . . . . . . 10 ⊢ (((𝐴 ∈ 𝐵 ∧ ω ∈ V) ∧ 𝑓:𝐴–1-1→ω) → ((𝒫 𝐴 ∩ Fin) ∖ {∅}) ≼ ω)
48		ondomen 9793	. . . . . . . . . 10 ⊢ ((ω ∈ On ∧ ((𝒫 𝐴 ∩ Fin) ∖ {∅}) ≼ ω) → ((𝒫 𝐴 ∩ Fin) ∖ {∅}) ∈ dom card)
49	6, 47, 48	syl2anc 584	. . . . . . . . 9 ⊢ (((𝐴 ∈ 𝐵 ∧ ω ∈ V) ∧ 𝑓:𝐴–1-1→ω) → ((𝒫 𝐴 ∩ Fin) ∖ {∅}) ∈ dom card)
50		eqid 2738	. . . . . . . . . . 11 ⊢ (𝑦 ∈ ((𝒫 𝐴 ∩ Fin) ∖ {∅}) ↦ ∩ 𝑦) = (𝑦 ∈ ((𝒫 𝐴 ∩ Fin) ∖ {∅}) ↦ ∩ 𝑦)
51	50	fifo 9191	. . . . . . . . . 10 ⊢ (𝐴 ∈ 𝐵 → (𝑦 ∈ ((𝒫 𝐴 ∩ Fin) ∖ {∅}) ↦ ∩ 𝑦):((𝒫 𝐴 ∩ Fin) ∖ {∅})–onto→(fi‘𝐴))
52	51	ad2antrr 723	. . . . . . . . 9 ⊢ (((𝐴 ∈ 𝐵 ∧ ω ∈ V) ∧ 𝑓:𝐴–1-1→ω) → (𝑦 ∈ ((𝒫 𝐴 ∩ Fin) ∖ {∅}) ↦ ∩ 𝑦):((𝒫 𝐴 ∩ Fin) ∖ {∅})–onto→(fi‘𝐴))
53		fodomnum 9813	. . . . . . . . 9 ⊢ (((𝒫 𝐴 ∩ Fin) ∖ {∅}) ∈ dom card → ((𝑦 ∈ ((𝒫 𝐴 ∩ Fin) ∖ {∅}) ↦ ∩ 𝑦):((𝒫 𝐴 ∩ Fin) ∖ {∅})–onto→(fi‘𝐴) → (fi‘𝐴) ≼ ((𝒫 𝐴 ∩ Fin) ∖ {∅})))
54	49, 52, 53	sylc 65	. . . . . . . 8 ⊢ (((𝐴 ∈ 𝐵 ∧ ω ∈ V) ∧ 𝑓:𝐴–1-1→ω) → (fi‘𝐴) ≼ ((𝒫 𝐴 ∩ Fin) ∖ {∅}))
55		domtr 8793	. . . . . . . 8 ⊢ (((fi‘𝐴) ≼ ((𝒫 𝐴 ∩ Fin) ∖ {∅}) ∧ ((𝒫 𝐴 ∩ Fin) ∖ {∅}) ≼ ω) → (fi‘𝐴) ≼ ω)
56	54, 47, 55	syl2anc 584	. . . . . . 7 ⊢ (((𝐴 ∈ 𝐵 ∧ ω ∈ V) ∧ 𝑓:𝐴–1-1→ω) → (fi‘𝐴) ≼ ω)
57	56	ex 413	. . . . . 6 ⊢ ((𝐴 ∈ 𝐵 ∧ ω ∈ V) → (𝑓:𝐴–1-1→ω → (fi‘𝐴) ≼ ω))
58	57	exlimdv 1936	. . . . 5 ⊢ ((𝐴 ∈ 𝐵 ∧ ω ∈ V) → (∃𝑓 𝑓:𝐴–1-1→ω → (fi‘𝐴) ≼ ω))
59	4, 58	sylan2 593	. . . 4 ⊢ ((𝐴 ∈ 𝐵 ∧ 𝐴 ≼ ω) → (∃𝑓 𝑓:𝐴–1-1→ω → (fi‘𝐴) ≼ ω))
60	2, 59	mpd 15	. . 3 ⊢ ((𝐴 ∈ 𝐵 ∧ 𝐴 ≼ ω) → (fi‘𝐴) ≼ ω)
61	60	ex 413	. 2 ⊢ (𝐴 ∈ 𝐵 → (𝐴 ≼ ω → (fi‘𝐴) ≼ ω))
62		fvex 6787	. . . 4 ⊢ (fi‘𝐴) ∈ V
63		ssfii 9178	. . . 4 ⊢ (𝐴 ∈ 𝐵 → 𝐴 ⊆ (fi‘𝐴))
64		ssdomg 8786	. . . 4 ⊢ ((fi‘𝐴) ∈ V → (𝐴 ⊆ (fi‘𝐴) → 𝐴 ≼ (fi‘𝐴)))
65	62, 63, 64	mpsyl 68	. . 3 ⊢ (𝐴 ∈ 𝐵 → 𝐴 ≼ (fi‘𝐴))
66		domtr 8793	. . . 4 ⊢ ((𝐴 ≼ (fi‘𝐴) ∧ (fi‘𝐴) ≼ ω) → 𝐴 ≼ ω)
67	66	ex 413	. . 3 ⊢ (𝐴 ≼ (fi‘𝐴) → ((fi‘𝐴) ≼ ω → 𝐴 ≼ ω))
68	65, 67	syl 17	. 2 ⊢ (𝐴 ∈ 𝐵 → ((fi‘𝐴) ≼ ω → 𝐴 ≼ ω))
69	61, 68	impbid 211	1 ⊢ (𝐴 ∈ 𝐵 → (𝐴 ≼ ω ↔ (fi‘𝐴) ≼ ω))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 396  ∃wex 1782   ∈ wcel 2106  Vcvv 3432   ∖ cdif 3884   ∩ cin 3886   ⊆ wss 3887  ∅c0 4256  𝒫 cpw 4533  {csn 4561  ∩ cint 4879  ∪ ciun 4924   class class class wbr 5074   ↦ cmpt 5157   × cxp 5587  dom cdm 5589  ran crn 5590   “ cima 5592  Oncon0 6266  –1-1→wf1 6430  –onto→wfo 6431  –1-1-onto→wf1o 6432  ‘cfv 6433  ωcom 7712   ≈ cen 8730   ≼ cdom 8731  Fincfn 8733  ficfi 9169  cardccrd 9693

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  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 2709  ax-rep 5209  ax-sep 5223  ax-nul 5230  ax-pow 5288  ax-pr 5352  ax-un 7588

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3or 1087  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ne 2944  df-ral 3069  df-rex 3070  df-rmo 3071  df-reu 3072  df-rab 3073  df-v 3434  df-sbc 3717  df-csb 3833  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-pss 3906  df-nul 4257  df-if 4460  df-pw 4535  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-int 4880  df-iun 4926  df-br 5075  df-opab 5137  df-mpt 5158  df-tr 5192  df-id 5489  df-eprel 5495  df-po 5503  df-so 5504  df-fr 5544  df-se 5545  df-we 5546  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-res 5601  df-ima 5602  df-pred 6202  df-ord 6269  df-on 6270  df-lim 6271  df-suc 6272  df-iota 6391  df-fun 6435  df-fn 6436  df-f 6437  df-f1 6438  df-fo 6439  df-f1o 6440  df-fv 6441  df-isom 6442  df-riota 7232  df-ov 7278  df-oprab 7279  df-mpo 7280  df-om 7713  df-1st 7831  df-2nd 7832  df-frecs 8097  df-wrecs 8128  df-recs 8202  df-rdg 8241  df-1o 8297  df-2o 8298  df-oadd 8301  df-er 8498  df-map 8617  df-en 8734  df-dom 8735  df-sdom 8736  df-fin 8737  df-fi 9170  df-dju 9659  df-card 9697  df-acn 9700

This theorem is referenced by:  2ndcsb  22600