Theorem fictb 10258

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 8973	. . . . 5 ⊢ (𝐴 ≼ ω → ∃𝑓 𝑓:𝐴–1-1→ω)
2	1	adantl 481	. . . 4 ⊢ ((𝐴 ∈ 𝐵 ∧ 𝐴 ≼ ω) → ∃𝑓 𝑓:𝐴–1-1→ω)
3		reldom 8965	. . . . . 6 ⊢ Rel ≼
4	3	brrelex2i 5711	. . . . 5 ⊢ (𝐴 ≼ ω → ω ∈ V)
5		omelon2 7874	. . . . . . . . . . 11 ⊢ (ω ∈ V → ω ∈ On)
6	5	ad2antlr 727	. . . . . . . . . 10 ⊢ (((𝐴 ∈ 𝐵 ∧ ω ∈ V) ∧ 𝑓:𝐴–1-1→ω) → ω ∈ On)
7		pwexg 5348	. . . . . . . . . . . . . 14 ⊢ (𝐴 ∈ 𝐵 → 𝒫 𝐴 ∈ V)
8	7	ad2antrr 726	. . . . . . . . . . . . 13 ⊢ (((𝐴 ∈ 𝐵 ∧ ω ∈ V) ∧ 𝑓:𝐴–1-1→ω) → 𝒫 𝐴 ∈ V)
9		inex1g 5289	. . . . . . . . . . . . 13 ⊢ (𝒫 𝐴 ∈ V → (𝒫 𝐴 ∩ Fin) ∈ V)
10	8, 9	syl 17	. . . . . . . . . . . 12 ⊢ (((𝐴 ∈ 𝐵 ∧ ω ∈ V) ∧ 𝑓:𝐴–1-1→ω) → (𝒫 𝐴 ∩ Fin) ∈ V)
11		difss 4111	. . . . . . . . . . . 12 ⊢ ((𝒫 𝐴 ∩ Fin) ∖ {∅}) ⊆ (𝒫 𝐴 ∩ Fin)
12		ssdomg 9014	. . . . . . . . . . . 12 ⊢ ((𝒫 𝐴 ∩ Fin) ∈ V → (((𝒫 𝐴 ∩ Fin) ∖ {∅}) ⊆ (𝒫 𝐴 ∩ Fin) → ((𝒫 𝐴 ∩ Fin) ∖ {∅}) ≼ (𝒫 𝐴 ∩ Fin)))
13	10, 11, 12	mpisyl 21	. . . . . . . . . . 11 ⊢ (((𝐴 ∈ 𝐵 ∧ ω ∈ V) ∧ 𝑓:𝐴–1-1→ω) → ((𝒫 𝐴 ∩ Fin) ∖ {∅}) ≼ (𝒫 𝐴 ∩ Fin))
14		f1f1orn 6829	. . . . . . . . . . . . . . 15 ⊢ (𝑓:𝐴–1-1→ω → 𝑓:𝐴–1-1-onto→ran 𝑓)
15	14	adantl 481	. . . . . . . . . . . . . 14 ⊢ (((𝐴 ∈ 𝐵 ∧ ω ∈ V) ∧ 𝑓:𝐴–1-1→ω) → 𝑓:𝐴–1-1-onto→ran 𝑓)
16		f1opwfi 9368	. . . . . . . . . . . . . 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 8985	. . . . . . . . . . . . 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 5348	. . . . . . . . . . . . . . . 16 ⊢ (ω ∈ V → 𝒫 ω ∈ V)
21	20	ad2antlr 727	. . . . . . . . . . . . . . 15 ⊢ (((𝐴 ∈ 𝐵 ∧ ω ∈ V) ∧ 𝑓:𝐴–1-1→ω) → 𝒫 ω ∈ V)
22		inex1g 5289	. . . . . . . . . . . . . . 15 ⊢ (𝒫 ω ∈ V → (𝒫 ω ∩ Fin) ∈ V)
23	21, 22	syl 17	. . . . . . . . . . . . . 14 ⊢ (((𝐴 ∈ 𝐵 ∧ ω ∈ V) ∧ 𝑓:𝐴–1-1→ω) → (𝒫 ω ∩ Fin) ∈ V)
24		f1f 6774	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑓:𝐴–1-1→ω → 𝑓:𝐴⟶ω)
25	24	frnd 6714	. . . . . . . . . . . . . . . . 17 ⊢ (𝑓:𝐴–1-1→ω → ran 𝑓 ⊆ ω)
26	25	adantl 481	. . . . . . . . . . . . . . . 16 ⊢ (((𝐴 ∈ 𝐵 ∧ ω ∈ V) ∧ 𝑓:𝐴–1-1→ω) → ran 𝑓 ⊆ ω)
27	26	sspwd 4588	. . . . . . . . . . . . . . 15 ⊢ (((𝐴 ∈ 𝐵 ∧ ω ∈ V) ∧ 𝑓:𝐴–1-1→ω) → 𝒫 ran 𝑓 ⊆ 𝒫 ω)
28	27	ssrind 4219	. . . . . . . . . . . . . 14 ⊢ (((𝐴 ∈ 𝐵 ∧ ω ∈ V) ∧ 𝑓:𝐴–1-1→ω) → (𝒫 ran 𝑓 ∩ Fin) ⊆ (𝒫 ω ∩ Fin))
29		ssdomg 9014	. . . . . . . . . . . . . 14 ⊢ ((𝒫 ω ∩ Fin) ∈ V → ((𝒫 ran 𝑓 ∩ Fin) ⊆ (𝒫 ω ∩ Fin) → (𝒫 ran 𝑓 ∩ Fin) ≼ (𝒫 ω ∩ Fin)))
30	23, 28, 29	sylc 65	. . . . . . . . . . . . 13 ⊢ (((𝐴 ∈ 𝐵 ∧ ω ∈ V) ∧ 𝑓:𝐴–1-1→ω) → (𝒫 ran 𝑓 ∩ Fin) ≼ (𝒫 ω ∩ Fin))
31		sneq 4611	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑓 = 𝑧 → {𝑓} = {𝑧})
32		pweq 4589	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑓 = 𝑧 → 𝒫 𝑓 = 𝒫 𝑧)
33	31, 32	xpeq12d 5685	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑓 = 𝑧 → ({𝑓} × 𝒫 𝑓) = ({𝑧} × 𝒫 𝑧))
34	33	cbviunv 5016	. . . . . . . . . . . . . . . . . 18 ⊢ ∪ 𝑓 ∈ 𝑥 ({𝑓} × 𝒫 𝑓) = ∪ 𝑧 ∈ 𝑥 ({𝑧} × 𝒫 𝑧)
35		iuneq1 4984	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑥 = 𝑦 → ∪ 𝑧 ∈ 𝑥 ({𝑧} × 𝒫 𝑧) = ∪ 𝑧 ∈ 𝑦 ({𝑧} × 𝒫 𝑧))
36	34, 35	eqtrid 2782	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 = 𝑦 → ∪ 𝑓 ∈ 𝑥 ({𝑓} × 𝒫 𝑓) = ∪ 𝑧 ∈ 𝑦 ({𝑧} × 𝒫 𝑧))
37	36	fveq2d 6880	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 = 𝑦 → (card‘∪ 𝑓 ∈ 𝑥 ({𝑓} × 𝒫 𝑓)) = (card‘∪ 𝑧 ∈ 𝑦 ({𝑧} × 𝒫 𝑧)))
38	37	cbvmptv 5225	. . . . . . . . . . . . . . 15 ⊢ (𝑥 ∈ (𝒫 ω ∩ Fin) ↦ (card‘∪ 𝑓 ∈ 𝑥 ({𝑓} × 𝒫 𝑓))) = (𝑦 ∈ (𝒫 ω ∩ Fin) ↦ (card‘∪ 𝑧 ∈ 𝑦 ({𝑧} × 𝒫 𝑧)))
39	38	ackbij1 10251	. . . . . . . . . . . . . 14 ⊢ (𝑥 ∈ (𝒫 ω ∩ Fin) ↦ (card‘∪ 𝑓 ∈ 𝑥 ({𝑓} × 𝒫 𝑓))):(𝒫 ω ∩ Fin)–1-1-onto→ω
40		f1oeng 8985	. . . . . . . . . . . . . 14 ⊢ (((𝒫 ω ∩ Fin) ∈ V ∧ (𝑥 ∈ (𝒫 ω ∩ Fin) ↦ (card‘∪ 𝑓 ∈ 𝑥 ({𝑓} × 𝒫 𝑓))):(𝒫 ω ∩ Fin)–1-1-onto→ω) → (𝒫 ω ∩ Fin) ≈ ω)
41	23, 39, 40	sylancl 586	. . . . . . . . . . . . 13 ⊢ (((𝐴 ∈ 𝐵 ∧ ω ∈ V) ∧ 𝑓:𝐴–1-1→ω) → (𝒫 ω ∩ Fin) ≈ ω)
42		domentr 9027	. . . . . . . . . . . . 13 ⊢ (((𝒫 ran 𝑓 ∩ Fin) ≼ (𝒫 ω ∩ Fin) ∧ (𝒫 ω ∩ Fin) ≈ ω) → (𝒫 ran 𝑓 ∩ Fin) ≼ ω)
43	30, 41, 42	syl2anc 584	. . . . . . . . . . . 12 ⊢ (((𝐴 ∈ 𝐵 ∧ ω ∈ V) ∧ 𝑓:𝐴–1-1→ω) → (𝒫 ran 𝑓 ∩ Fin) ≼ ω)
44		endomtr 9026	. . . . . . . . . . . 12 ⊢ (((𝒫 𝐴 ∩ Fin) ≈ (𝒫 ran 𝑓 ∩ Fin) ∧ (𝒫 ran 𝑓 ∩ Fin) ≼ ω) → (𝒫 𝐴 ∩ Fin) ≼ ω)
45	19, 43, 44	syl2anc 584	. . . . . . . . . . 11 ⊢ (((𝐴 ∈ 𝐵 ∧ ω ∈ V) ∧ 𝑓:𝐴–1-1→ω) → (𝒫 𝐴 ∩ Fin) ≼ ω)
46		domtr 9021	. . . . . . . . . . 11 ⊢ ((((𝒫 𝐴 ∩ Fin) ∖ {∅}) ≼ (𝒫 𝐴 ∩ Fin) ∧ (𝒫 𝐴 ∩ Fin) ≼ ω) → ((𝒫 𝐴 ∩ Fin) ∖ {∅}) ≼ ω)
47	13, 45, 46	syl2anc 584	. . . . . . . . . 10 ⊢ (((𝐴 ∈ 𝐵 ∧ ω ∈ V) ∧ 𝑓:𝐴–1-1→ω) → ((𝒫 𝐴 ∩ Fin) ∖ {∅}) ≼ ω)
48		ondomen 10051	. . . . . . . . . 10 ⊢ ((ω ∈ On ∧ ((𝒫 𝐴 ∩ Fin) ∖ {∅}) ≼ ω) → ((𝒫 𝐴 ∩ Fin) ∖ {∅}) ∈ dom card)
49	6, 47, 48	syl2anc 584	. . . . . . . . 9 ⊢ (((𝐴 ∈ 𝐵 ∧ ω ∈ V) ∧ 𝑓:𝐴–1-1→ω) → ((𝒫 𝐴 ∩ Fin) ∖ {∅}) ∈ dom card)
50		eqid 2735	. . . . . . . . . . 11 ⊢ (𝑦 ∈ ((𝒫 𝐴 ∩ Fin) ∖ {∅}) ↦ ∩ 𝑦) = (𝑦 ∈ ((𝒫 𝐴 ∩ Fin) ∖ {∅}) ↦ ∩ 𝑦)
51	50	fifo 9444	. . . . . . . . . 10 ⊢ (𝐴 ∈ 𝐵 → (𝑦 ∈ ((𝒫 𝐴 ∩ Fin) ∖ {∅}) ↦ ∩ 𝑦):((𝒫 𝐴 ∩ Fin) ∖ {∅})–onto→(fi‘𝐴))
52	51	ad2antrr 726	. . . . . . . . 9 ⊢ (((𝐴 ∈ 𝐵 ∧ ω ∈ V) ∧ 𝑓:𝐴–1-1→ω) → (𝑦 ∈ ((𝒫 𝐴 ∩ Fin) ∖ {∅}) ↦ ∩ 𝑦):((𝒫 𝐴 ∩ Fin) ∖ {∅})–onto→(fi‘𝐴))
53		fodomnum 10071	. . . . . . . . 9 ⊢ (((𝒫 𝐴 ∩ Fin) ∖ {∅}) ∈ dom card → ((𝑦 ∈ ((𝒫 𝐴 ∩ Fin) ∖ {∅}) ↦ ∩ 𝑦):((𝒫 𝐴 ∩ Fin) ∖ {∅})–onto→(fi‘𝐴) → (fi‘𝐴) ≼ ((𝒫 𝐴 ∩ Fin) ∖ {∅})))
54	49, 52, 53	sylc 65	. . . . . . . 8 ⊢ (((𝐴 ∈ 𝐵 ∧ ω ∈ V) ∧ 𝑓:𝐴–1-1→ω) → (fi‘𝐴) ≼ ((𝒫 𝐴 ∩ Fin) ∖ {∅}))
55		domtr 9021	. . . . . . . 8 ⊢ (((fi‘𝐴) ≼ ((𝒫 𝐴 ∩ Fin) ∖ {∅}) ∧ ((𝒫 𝐴 ∩ Fin) ∖ {∅}) ≼ ω) → (fi‘𝐴) ≼ ω)
56	54, 47, 55	syl2anc 584	. . . . . . 7 ⊢ (((𝐴 ∈ 𝐵 ∧ ω ∈ V) ∧ 𝑓:𝐴–1-1→ω) → (fi‘𝐴) ≼ ω)
57	56	ex 412	. . . . . 6 ⊢ ((𝐴 ∈ 𝐵 ∧ ω ∈ V) → (𝑓:𝐴–1-1→ω → (fi‘𝐴) ≼ ω))
58	57	exlimdv 1933	. . . . 5 ⊢ ((𝐴 ∈ 𝐵 ∧ ω ∈ V) → (∃𝑓 𝑓:𝐴–1-1→ω → (fi‘𝐴) ≼ ω))
59	4, 58	sylan2 593	. . . 4 ⊢ ((𝐴 ∈ 𝐵 ∧ 𝐴 ≼ ω) → (∃𝑓 𝑓:𝐴–1-1→ω → (fi‘𝐴) ≼ ω))
60	2, 59	mpd 15	. . 3 ⊢ ((𝐴 ∈ 𝐵 ∧ 𝐴 ≼ ω) → (fi‘𝐴) ≼ ω)
61	60	ex 412	. 2 ⊢ (𝐴 ∈ 𝐵 → (𝐴 ≼ ω → (fi‘𝐴) ≼ ω))
62		fvex 6889	. . . 4 ⊢ (fi‘𝐴) ∈ V
63		ssfii 9431	. . . 4 ⊢ (𝐴 ∈ 𝐵 → 𝐴 ⊆ (fi‘𝐴))
64		ssdomg 9014	. . . 4 ⊢ ((fi‘𝐴) ∈ V → (𝐴 ⊆ (fi‘𝐴) → 𝐴 ≼ (fi‘𝐴)))
65	62, 63, 64	mpsyl 68	. . 3 ⊢ (𝐴 ∈ 𝐵 → 𝐴 ≼ (fi‘𝐴))
66		domtr 9021	. . . 4 ⊢ ((𝐴 ≼ (fi‘𝐴) ∧ (fi‘𝐴) ≼ ω) → 𝐴 ≼ ω)
67	66	ex 412	. . 3 ⊢ (𝐴 ≼ (fi‘𝐴) → ((fi‘𝐴) ≼ ω → 𝐴 ≼ ω))
68	65, 67	syl 17	. 2 ⊢ (𝐴 ∈ 𝐵 → ((fi‘𝐴) ≼ ω → 𝐴 ≼ ω))
69	61, 68	impbid 212	1 ⊢ (𝐴 ∈ 𝐵 → (𝐴 ≼ ω ↔ (fi‘𝐴) ≼ ω))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395  ∃wex 1779   ∈ wcel 2108  Vcvv 3459   ∖ cdif 3923   ∩ cin 3925   ⊆ wss 3926  ∅c0 4308  𝒫 cpw 4575  {csn 4601  ∩ cint 4922  ∪ ciun 4967   class class class wbr 5119   ↦ cmpt 5201   × cxp 5652  dom cdm 5654  ran crn 5655   “ cima 5657  Oncon0 6352  –1-1→wf1 6528  –onto→wfo 6529  –1-1-onto→wf1o 6530  ‘cfv 6531  ωcom 7861   ≈ cen 8956   ≼ cdom 8957  Fincfn 8959  ficfi 9422  cardccrd 9949

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2707  ax-rep 5249  ax-sep 5266  ax-nul 5276  ax-pow 5335  ax-pr 5402  ax-un 7729

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2539  df-eu 2568  df-clab 2714  df-cleq 2727  df-clel 2809  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3061  df-rmo 3359  df-reu 3360  df-rab 3416  df-v 3461  df-sbc 3766  df-csb 3875  df-dif 3929  df-un 3931  df-in 3933  df-ss 3943  df-pss 3946  df-nul 4309  df-if 4501  df-pw 4577  df-sn 4602  df-pr 4604  df-op 4608  df-uni 4884  df-int 4923  df-iun 4969  df-br 5120  df-opab 5182  df-mpt 5202  df-tr 5230  df-id 5548  df-eprel 5553  df-po 5561  df-so 5562  df-fr 5606  df-se 5607  df-we 5608  df-xp 5660  df-rel 5661  df-cnv 5662  df-co 5663  df-dm 5664  df-rn 5665  df-res 5666  df-ima 5667  df-pred 6290  df-ord 6355  df-on 6356  df-lim 6357  df-suc 6358  df-iota 6484  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-isom 6540  df-riota 7362  df-ov 7408  df-oprab 7409  df-mpo 7410  df-om 7862  df-1st 7988  df-2nd 7989  df-frecs 8280  df-wrecs 8311  df-recs 8385  df-rdg 8424  df-1o 8480  df-2o 8481  df-oadd 8484  df-er 8719  df-map 8842  df-en 8960  df-dom 8961  df-sdom 8962  df-fin 8963  df-fi 9423  df-dju 9915  df-card 9953  df-acn 9956

This theorem is referenced by:  2ndcsb  23387