Theorem fictb 10228

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 8957	. . . . 5 ⊢ (𝐴 ≼ ω → ∃𝑓 𝑓:𝐴–1-1→ω)
2	1	adantl 486	. . . 4 ⊢ ((𝐴 ∈ 𝐵 ∧ 𝐴 ≼ ω) → ∃𝑓 𝑓:𝐴–1-1→ω)
3		reldom 8950	. . . . . 6 ⊢ Rel ≼
4	3	brrelex2i 5720	. . . . 5 ⊢ (𝐴 ≼ ω → ω ∈ V)
5		omelon2 7876	. . . . . . . . . . 11 ⊢ (ω ∈ V → ω ∈ On)
6	5	ad2antlr 739	. . . . . . . . . 10 ⊢ (((𝐴 ∈ 𝐵 ∧ ω ∈ V) ∧ 𝑓:𝐴–1-1→ω) → ω ∈ On)
7		pwexg 5351	. . . . . . . . . . . . . 14 ⊢ (𝐴 ∈ 𝐵 → 𝒫 𝐴 ∈ V)
8	7	ad2antrr 738	. . . . . . . . . . . . 13 ⊢ (((𝐴 ∈ 𝐵 ∧ ω ∈ V) ∧ 𝑓:𝐴–1-1→ω) → 𝒫 𝐴 ∈ V)
9		inex1g 5289	. . . . . . . . . . . . 13 ⊢ (𝒫 𝐴 ∈ V → (𝒫 𝐴 ∩ Fin) ∈ V)
10	8, 9	syl 18	. . . . . . . . . . . 12 ⊢ (((𝐴 ∈ 𝐵 ∧ ω ∈ V) ∧ 𝑓:𝐴–1-1→ω) → (𝒫 𝐴 ∩ Fin) ∈ V)
11		difss 4091	. . . . . . . . . . . 12 ⊢ ((𝒫 𝐴 ∩ Fin) ∖ {∅}) ⊆ (𝒫 𝐴 ∩ Fin)
12		ssdomg 8998	. . . . . . . . . . . 12 ⊢ ((𝒫 𝐴 ∩ Fin) ∈ V → (((𝒫 𝐴 ∩ Fin) ∖ {∅}) ⊆ (𝒫 𝐴 ∩ Fin) → ((𝒫 𝐴 ∩ Fin) ∖ {∅}) ≼ (𝒫 𝐴 ∩ Fin)))
13	10, 11, 12	mpisyl 22	. . . . . . . . . . 11 ⊢ (((𝐴 ∈ 𝐵 ∧ ω ∈ V) ∧ 𝑓:𝐴–1-1→ω) → ((𝒫 𝐴 ∩ Fin) ∖ {∅}) ≼ (𝒫 𝐴 ∩ Fin))
14		f1f1orn 6834	. . . . . . . . . . . . . . 15 ⊢ (𝑓:𝐴–1-1→ω → 𝑓:𝐴–1-1-onto→ran 𝑓)
15	14	adantl 486	. . . . . . . . . . . . . 14 ⊢ (((𝐴 ∈ 𝐵 ∧ ω ∈ V) ∧ 𝑓:𝐴–1-1→ω) → 𝑓:𝐴–1-1-onto→ran 𝑓)
16		f1opwfi 9314	. . . . . . . . . . . . . 14 ⊢ (𝑓:𝐴–1-1-onto→ran 𝑓 → (𝑥 ∈ (𝒫 𝐴 ∩ Fin) ↦ (𝑓 “ 𝑥)):(𝒫 𝐴 ∩ Fin)–1-1-onto→(𝒫 ran 𝑓 ∩ Fin))
17	15, 16	syl 18	. . . . . . . . . . . . 13 ⊢ (((𝐴 ∈ 𝐵 ∧ ω ∈ V) ∧ 𝑓:𝐴–1-1→ω) → (𝑥 ∈ (𝒫 𝐴 ∩ Fin) ↦ (𝑓 “ 𝑥)):(𝒫 𝐴 ∩ Fin)–1-1-onto→(𝒫 ran 𝑓 ∩ Fin))
18		f1oeng 8968	. . . . . . . . . . . . 13 ⊢ (((𝒫 𝐴 ∩ Fin) ∈ V ∧ (𝑥 ∈ (𝒫 𝐴 ∩ Fin) ↦ (𝑓 “ 𝑥)):(𝒫 𝐴 ∩ Fin)–1-1-onto→(𝒫 ran 𝑓 ∩ Fin)) → (𝒫 𝐴 ∩ Fin) ≈ (𝒫 ran 𝑓 ∩ Fin))
19	10, 17, 18	syl2anc 595	. . . . . . . . . . . 12 ⊢ (((𝐴 ∈ 𝐵 ∧ ω ∈ V) ∧ 𝑓:𝐴–1-1→ω) → (𝒫 𝐴 ∩ Fin) ≈ (𝒫 ran 𝑓 ∩ Fin))
20		pwexg 5351	. . . . . . . . . . . . . . . 16 ⊢ (ω ∈ V → 𝒫 ω ∈ V)
21	20	ad2antlr 739	. . . . . . . . . . . . . . 15 ⊢ (((𝐴 ∈ 𝐵 ∧ ω ∈ V) ∧ 𝑓:𝐴–1-1→ω) → 𝒫 ω ∈ V)
22		inex1g 5289	. . . . . . . . . . . . . . 15 ⊢ (𝒫 ω ∈ V → (𝒫 ω ∩ Fin) ∈ V)
23	21, 22	syl 18	. . . . . . . . . . . . . 14 ⊢ (((𝐴 ∈ 𝐵 ∧ ω ∈ V) ∧ 𝑓:𝐴–1-1→ω) → (𝒫 ω ∩ Fin) ∈ V)
24		f1f 6776	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑓:𝐴–1-1→ω → 𝑓:𝐴⟶ω)
25	24	frnd 6716	. . . . . . . . . . . . . . . . 17 ⊢ (𝑓:𝐴–1-1→ω → ran 𝑓 ⊆ ω)
26	25	adantl 486	. . . . . . . . . . . . . . . 16 ⊢ (((𝐴 ∈ 𝐵 ∧ ω ∈ V) ∧ 𝑓:𝐴–1-1→ω) → ran 𝑓 ⊆ ω)
27	26	sspwd 4576	. . . . . . . . . . . . . . 15 ⊢ (((𝐴 ∈ 𝐵 ∧ ω ∈ V) ∧ 𝑓:𝐴–1-1→ω) → 𝒫 ran 𝑓 ⊆ 𝒫 ω)
28	27	ssrind 4197	. . . . . . . . . . . . . 14 ⊢ (((𝐴 ∈ 𝐵 ∧ ω ∈ V) ∧ 𝑓:𝐴–1-1→ω) → (𝒫 ran 𝑓 ∩ Fin) ⊆ (𝒫 ω ∩ Fin))
29		ssdomg 8998	. . . . . . . . . . . . . 14 ⊢ ((𝒫 ω ∩ Fin) ∈ V → ((𝒫 ran 𝑓 ∩ Fin) ⊆ (𝒫 ω ∩ Fin) → (𝒫 ran 𝑓 ∩ Fin) ≼ (𝒫 ω ∩ Fin)))
30	23, 28, 29	sylc 66	. . . . . . . . . . . . 13 ⊢ (((𝐴 ∈ 𝐵 ∧ ω ∈ V) ∧ 𝑓:𝐴–1-1→ω) → (𝒫 ran 𝑓 ∩ Fin) ≼ (𝒫 ω ∩ Fin))
31		sneq 4600	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑓 = 𝑧 → {𝑓} = {𝑧})
32		pweq 4577	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑓 = 𝑧 → 𝒫 𝑓 = 𝒫 𝑧)
33	31, 32	xpeq12d 5694	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑓 = 𝑧 → ({𝑓} × 𝒫 𝑓) = ({𝑧} × 𝒫 𝑧))
34	33	cbviunv 5004	. . . . . . . . . . . . . . . . . 18 ⊢ ∪ 𝑓 ∈ 𝑥 ({𝑓} × 𝒫 𝑓) = ∪ 𝑧 ∈ 𝑥 ({𝑧} × 𝒫 𝑧)
35		iuneq1 4974	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑥 = 𝑦 → ∪ 𝑧 ∈ 𝑥 ({𝑧} × 𝒫 𝑧) = ∪ 𝑧 ∈ 𝑦 ({𝑧} × 𝒫 𝑧))
36	34, 35	eqtrid 2810	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 = 𝑦 → ∪ 𝑓 ∈ 𝑥 ({𝑓} × 𝒫 𝑓) = ∪ 𝑧 ∈ 𝑦 ({𝑧} × 𝒫 𝑧))
37	36	fveq2d 6887	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 = 𝑦 → (card‘∪ 𝑓 ∈ 𝑥 ({𝑓} × 𝒫 𝑓)) = (card‘∪ 𝑧 ∈ 𝑦 ({𝑧} × 𝒫 𝑧)))
38	37	cbvmptv 5216	. . . . . . . . . . . . . . 15 ⊢ (𝑥 ∈ (𝒫 ω ∩ Fin) ↦ (card‘∪ 𝑓 ∈ 𝑥 ({𝑓} × 𝒫 𝑓))) = (𝑦 ∈ (𝒫 ω ∩ Fin) ↦ (card‘∪ 𝑧 ∈ 𝑦 ({𝑧} × 𝒫 𝑧)))
39	38	ackbij1 10221	. . . . . . . . . . . . . 14 ⊢ (𝑥 ∈ (𝒫 ω ∩ Fin) ↦ (card‘∪ 𝑓 ∈ 𝑥 ({𝑓} × 𝒫 𝑓))):(𝒫 ω ∩ Fin)–1-1-onto→ω
40		f1oeng 8968	. . . . . . . . . . . . . 14 ⊢ (((𝒫 ω ∩ Fin) ∈ V ∧ (𝑥 ∈ (𝒫 ω ∩ Fin) ↦ (card‘∪ 𝑓 ∈ 𝑥 ({𝑓} × 𝒫 𝑓))):(𝒫 ω ∩ Fin)–1-1-onto→ω) → (𝒫 ω ∩ Fin) ≈ ω)
41	23, 39, 40	sylancl 597	. . . . . . . . . . . . 13 ⊢ (((𝐴 ∈ 𝐵 ∧ ω ∈ V) ∧ 𝑓:𝐴–1-1→ω) → (𝒫 ω ∩ Fin) ≈ ω)
42		domentr 9011	. . . . . . . . . . . . 13 ⊢ (((𝒫 ran 𝑓 ∩ Fin) ≼ (𝒫 ω ∩ Fin) ∧ (𝒫 ω ∩ Fin) ≈ ω) → (𝒫 ran 𝑓 ∩ Fin) ≼ ω)
43	30, 41, 42	syl2anc 595	. . . . . . . . . . . 12 ⊢ (((𝐴 ∈ 𝐵 ∧ ω ∈ V) ∧ 𝑓:𝐴–1-1→ω) → (𝒫 ran 𝑓 ∩ Fin) ≼ ω)
44		endomtr 9010	. . . . . . . . . . . 12 ⊢ (((𝒫 𝐴 ∩ Fin) ≈ (𝒫 ran 𝑓 ∩ Fin) ∧ (𝒫 ran 𝑓 ∩ Fin) ≼ ω) → (𝒫 𝐴 ∩ Fin) ≼ ω)
45	19, 43, 44	syl2anc 595	. . . . . . . . . . 11 ⊢ (((𝐴 ∈ 𝐵 ∧ ω ∈ V) ∧ 𝑓:𝐴–1-1→ω) → (𝒫 𝐴 ∩ Fin) ≼ ω)
46		domtr 9005	. . . . . . . . . . 11 ⊢ ((((𝒫 𝐴 ∩ Fin) ∖ {∅}) ≼ (𝒫 𝐴 ∩ Fin) ∧ (𝒫 𝐴 ∩ Fin) ≼ ω) → ((𝒫 𝐴 ∩ Fin) ∖ {∅}) ≼ ω)
47	13, 45, 46	syl2anc 595	. . . . . . . . . 10 ⊢ (((𝐴 ∈ 𝐵 ∧ ω ∈ V) ∧ 𝑓:𝐴–1-1→ω) → ((𝒫 𝐴 ∩ Fin) ∖ {∅}) ≼ ω)
48		ondomen 10022	. . . . . . . . . 10 ⊢ ((ω ∈ On ∧ ((𝒫 𝐴 ∩ Fin) ∖ {∅}) ≼ ω) → ((𝒫 𝐴 ∩ Fin) ∖ {∅}) ∈ dom card)
49	6, 47, 48	syl2anc 595	. . . . . . . . 9 ⊢ (((𝐴 ∈ 𝐵 ∧ ω ∈ V) ∧ 𝑓:𝐴–1-1→ω) → ((𝒫 𝐴 ∩ Fin) ∖ {∅}) ∈ dom card)
50		eqid 2763	. . . . . . . . . . 11 ⊢ (𝑦 ∈ ((𝒫 𝐴 ∩ Fin) ∖ {∅}) ↦ ∩ 𝑦) = (𝑦 ∈ ((𝒫 𝐴 ∩ Fin) ∖ {∅}) ↦ ∩ 𝑦)
51	50	fifo 9393	. . . . . . . . . 10 ⊢ (𝐴 ∈ 𝐵 → (𝑦 ∈ ((𝒫 𝐴 ∩ Fin) ∖ {∅}) ↦ ∩ 𝑦):((𝒫 𝐴 ∩ Fin) ∖ {∅})–onto→(fi‘𝐴))
52	51	ad2antrr 738	. . . . . . . . 9 ⊢ (((𝐴 ∈ 𝐵 ∧ ω ∈ V) ∧ 𝑓:𝐴–1-1→ω) → (𝑦 ∈ ((𝒫 𝐴 ∩ Fin) ∖ {∅}) ↦ ∩ 𝑦):((𝒫 𝐴 ∩ Fin) ∖ {∅})–onto→(fi‘𝐴))
53		fodomnum 10042	. . . . . . . . 9 ⊢ (((𝒫 𝐴 ∩ Fin) ∖ {∅}) ∈ dom card → ((𝑦 ∈ ((𝒫 𝐴 ∩ Fin) ∖ {∅}) ↦ ∩ 𝑦):((𝒫 𝐴 ∩ Fin) ∖ {∅})–onto→(fi‘𝐴) → (fi‘𝐴) ≼ ((𝒫 𝐴 ∩ Fin) ∖ {∅})))
54	49, 52, 53	sylc 66	. . . . . . . 8 ⊢ (((𝐴 ∈ 𝐵 ∧ ω ∈ V) ∧ 𝑓:𝐴–1-1→ω) → (fi‘𝐴) ≼ ((𝒫 𝐴 ∩ Fin) ∖ {∅}))
55		domtr 9005	. . . . . . . 8 ⊢ (((fi‘𝐴) ≼ ((𝒫 𝐴 ∩ Fin) ∖ {∅}) ∧ ((𝒫 𝐴 ∩ Fin) ∖ {∅}) ≼ ω) → (fi‘𝐴) ≼ ω)
56	54, 47, 55	syl2anc 595	. . . . . . 7 ⊢ (((𝐴 ∈ 𝐵 ∧ ω ∈ V) ∧ 𝑓:𝐴–1-1→ω) → (fi‘𝐴) ≼ ω)
57	56	ex 417	. . . . . 6 ⊢ ((𝐴 ∈ 𝐵 ∧ ω ∈ V) → (𝑓:𝐴–1-1→ω → (fi‘𝐴) ≼ ω))
58	57	exlimdv 1963	. . . . 5 ⊢ ((𝐴 ∈ 𝐵 ∧ ω ∈ V) → (∃𝑓 𝑓:𝐴–1-1→ω → (fi‘𝐴) ≼ ω))
59	4, 58	sylan2 604	. . . 4 ⊢ ((𝐴 ∈ 𝐵 ∧ 𝐴 ≼ ω) → (∃𝑓 𝑓:𝐴–1-1→ω → (fi‘𝐴) ≼ ω))
60	2, 59	mpd 16	. . 3 ⊢ ((𝐴 ∈ 𝐵 ∧ 𝐴 ≼ ω) → (fi‘𝐴) ≼ ω)
61	60	ex 417	. 2 ⊢ (𝐴 ∈ 𝐵 → (𝐴 ≼ ω → (fi‘𝐴) ≼ ω))
62		fvex 6896	. . . 4 ⊢ (fi‘𝐴) ∈ V
63		ssfii 9380	. . . 4 ⊢ (𝐴 ∈ 𝐵 → 𝐴 ⊆ (fi‘𝐴))
64		ssdomg 8998	. . . 4 ⊢ ((fi‘𝐴) ∈ V → (𝐴 ⊆ (fi‘𝐴) → 𝐴 ≼ (fi‘𝐴)))
65	62, 63, 64	mpsyl 69	. . 3 ⊢ (𝐴 ∈ 𝐵 → 𝐴 ≼ (fi‘𝐴))
66		domtr 9005	. . . 4 ⊢ ((𝐴 ≼ (fi‘𝐴) ∧ (fi‘𝐴) ≼ ω) → 𝐴 ≼ ω)
67	66	ex 417	. . 3 ⊢ (𝐴 ≼ (fi‘𝐴) → ((fi‘𝐴) ≼ ω → 𝐴 ≼ ω))
68	65, 67	syl 18	. 2 ⊢ (𝐴 ∈ 𝐵 → ((fi‘𝐴) ≼ ω → 𝐴 ≼ ω))
69	61, 68	impbid 215	1 ⊢ (𝐴 ∈ 𝐵 → (𝐴 ≼ ω ↔ (fi‘𝐴) ≼ ω))

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 400  ∃wex 1809   ∈ wcel 2143  Vcvv 3455   ∖ cdif 3903   ∩ cin 3905   ⊆ wss 3906  ∅c0 4287  𝒫 cpw 4563  {csn 4590  ∩ cint 4913  ∪ ciun 4957   class class class wbr 5110   ↦ cmpt 5193   × cxp 5661  dom cdm 5663  ran crn 5664   “ cima 5666  Oncon0 6362  –1-1→wf1 6535  –onto→wfo 6536  –1-1-onto→wf1o 6537  ‘cfv 6538  ωcom 7863   ≈ cen 8941   ≼ cdom 8942  Fincfn 8944  ficfi 9371  cardccrd 9922

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-rep 5239  ax-sep 5258  ax-nul 5270  ax-pow 5338  ax-pr 5406  ax-un 7734

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3746  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-pss 3926  df-nul 4288  df-if 4489  df-pw 4565  df-sn 4591  df-pr 4593  df-op 4597  df-uni 4874  df-int 4914  df-iun 4959  df-br 5111  df-opab 5175  df-mpt 5194  df-tr 5220  df-id 5558  df-eprel 5563  df-po 5571  df-so 5572  df-fr 5616  df-se 5617  df-we 5618  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-pred 6304  df-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-isom 6547  df-riota 7369  df-ov 7415  df-oprab 7416  df-mpo 7417  df-om 7864  df-1st 7987  df-2nd 7988  df-frecs 8279  df-wrecs 8310  df-recs 8359  df-rdg 8398  df-1o 8454  df-2o 8455  df-oadd 8458  df-er 8695  df-map 8827  df-en 8945  df-dom 8946  df-sdom 8947  df-fin 8948  df-fi 9372  df-dju 9888  df-card 9926  df-acn 9929

This theorem is referenced by:  2ndcsb  23587