Theorem fictb 10284

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 8999	. . . . 5 ⊢ (𝐴 ≼ ω → ∃𝑓 𝑓:𝐴–1-1→ω)
2	1	adantl 481	. . . 4 ⊢ ((𝐴 ∈ 𝐵 ∧ 𝐴 ≼ ω) → ∃𝑓 𝑓:𝐴–1-1→ω)
3		reldom 8991	. . . . . 6 ⊢ Rel ≼
4	3	brrelex2i 5742	. . . . 5 ⊢ (𝐴 ≼ ω → ω ∈ V)
5		omelon2 7900	. . . . . . . . . . 11 ⊢ (ω ∈ V → ω ∈ On)
6	5	ad2antlr 727	. . . . . . . . . 10 ⊢ (((𝐴 ∈ 𝐵 ∧ ω ∈ V) ∧ 𝑓:𝐴–1-1→ω) → ω ∈ On)
7		pwexg 5378	. . . . . . . . . . . . . 14 ⊢ (𝐴 ∈ 𝐵 → 𝒫 𝐴 ∈ V)
8	7	ad2antrr 726	. . . . . . . . . . . . 13 ⊢ (((𝐴 ∈ 𝐵 ∧ ω ∈ V) ∧ 𝑓:𝐴–1-1→ω) → 𝒫 𝐴 ∈ V)
9		inex1g 5319	. . . . . . . . . . . . 13 ⊢ (𝒫 𝐴 ∈ V → (𝒫 𝐴 ∩ Fin) ∈ V)
10	8, 9	syl 17	. . . . . . . . . . . 12 ⊢ (((𝐴 ∈ 𝐵 ∧ ω ∈ V) ∧ 𝑓:𝐴–1-1→ω) → (𝒫 𝐴 ∩ Fin) ∈ V)
11		difss 4136	. . . . . . . . . . . 12 ⊢ ((𝒫 𝐴 ∩ Fin) ∖ {∅}) ⊆ (𝒫 𝐴 ∩ Fin)
12		ssdomg 9040	. . . . . . . . . . . 12 ⊢ ((𝒫 𝐴 ∩ Fin) ∈ V → (((𝒫 𝐴 ∩ Fin) ∖ {∅}) ⊆ (𝒫 𝐴 ∩ Fin) → ((𝒫 𝐴 ∩ Fin) ∖ {∅}) ≼ (𝒫 𝐴 ∩ Fin)))
13	10, 11, 12	mpisyl 21	. . . . . . . . . . 11 ⊢ (((𝐴 ∈ 𝐵 ∧ ω ∈ V) ∧ 𝑓:𝐴–1-1→ω) → ((𝒫 𝐴 ∩ Fin) ∖ {∅}) ≼ (𝒫 𝐴 ∩ Fin))
14		f1f1orn 6859	. . . . . . . . . . . . . . 15 ⊢ (𝑓:𝐴–1-1→ω → 𝑓:𝐴–1-1-onto→ran 𝑓)
15	14	adantl 481	. . . . . . . . . . . . . 14 ⊢ (((𝐴 ∈ 𝐵 ∧ ω ∈ V) ∧ 𝑓:𝐴–1-1→ω) → 𝑓:𝐴–1-1-onto→ran 𝑓)
16		f1opwfi 9396	. . . . . . . . . . . . . 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 9011	. . . . . . . . . . . . 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 5378	. . . . . . . . . . . . . . . 16 ⊢ (ω ∈ V → 𝒫 ω ∈ V)
21	20	ad2antlr 727	. . . . . . . . . . . . . . 15 ⊢ (((𝐴 ∈ 𝐵 ∧ ω ∈ V) ∧ 𝑓:𝐴–1-1→ω) → 𝒫 ω ∈ V)
22		inex1g 5319	. . . . . . . . . . . . . . 15 ⊢ (𝒫 ω ∈ V → (𝒫 ω ∩ Fin) ∈ V)
23	21, 22	syl 17	. . . . . . . . . . . . . 14 ⊢ (((𝐴 ∈ 𝐵 ∧ ω ∈ V) ∧ 𝑓:𝐴–1-1→ω) → (𝒫 ω ∩ Fin) ∈ V)
24		f1f 6804	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑓:𝐴–1-1→ω → 𝑓:𝐴⟶ω)
25	24	frnd 6744	. . . . . . . . . . . . . . . . 17 ⊢ (𝑓:𝐴–1-1→ω → ran 𝑓 ⊆ ω)
26	25	adantl 481	. . . . . . . . . . . . . . . 16 ⊢ (((𝐴 ∈ 𝐵 ∧ ω ∈ V) ∧ 𝑓:𝐴–1-1→ω) → ran 𝑓 ⊆ ω)
27	26	sspwd 4613	. . . . . . . . . . . . . . 15 ⊢ (((𝐴 ∈ 𝐵 ∧ ω ∈ V) ∧ 𝑓:𝐴–1-1→ω) → 𝒫 ran 𝑓 ⊆ 𝒫 ω)
28	27	ssrind 4244	. . . . . . . . . . . . . 14 ⊢ (((𝐴 ∈ 𝐵 ∧ ω ∈ V) ∧ 𝑓:𝐴–1-1→ω) → (𝒫 ran 𝑓 ∩ Fin) ⊆ (𝒫 ω ∩ Fin))
29		ssdomg 9040	. . . . . . . . . . . . . 14 ⊢ ((𝒫 ω ∩ Fin) ∈ V → ((𝒫 ran 𝑓 ∩ Fin) ⊆ (𝒫 ω ∩ Fin) → (𝒫 ran 𝑓 ∩ Fin) ≼ (𝒫 ω ∩ Fin)))
30	23, 28, 29	sylc 65	. . . . . . . . . . . . 13 ⊢ (((𝐴 ∈ 𝐵 ∧ ω ∈ V) ∧ 𝑓:𝐴–1-1→ω) → (𝒫 ran 𝑓 ∩ Fin) ≼ (𝒫 ω ∩ Fin))
31		sneq 4636	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑓 = 𝑧 → {𝑓} = {𝑧})
32		pweq 4614	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑓 = 𝑧 → 𝒫 𝑓 = 𝒫 𝑧)
33	31, 32	xpeq12d 5716	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑓 = 𝑧 → ({𝑓} × 𝒫 𝑓) = ({𝑧} × 𝒫 𝑧))
34	33	cbviunv 5040	. . . . . . . . . . . . . . . . . 18 ⊢ ∪ 𝑓 ∈ 𝑥 ({𝑓} × 𝒫 𝑓) = ∪ 𝑧 ∈ 𝑥 ({𝑧} × 𝒫 𝑧)
35		iuneq1 5008	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑥 = 𝑦 → ∪ 𝑧 ∈ 𝑥 ({𝑧} × 𝒫 𝑧) = ∪ 𝑧 ∈ 𝑦 ({𝑧} × 𝒫 𝑧))
36	34, 35	eqtrid 2789	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 = 𝑦 → ∪ 𝑓 ∈ 𝑥 ({𝑓} × 𝒫 𝑓) = ∪ 𝑧 ∈ 𝑦 ({𝑧} × 𝒫 𝑧))
37	36	fveq2d 6910	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 = 𝑦 → (card‘∪ 𝑓 ∈ 𝑥 ({𝑓} × 𝒫 𝑓)) = (card‘∪ 𝑧 ∈ 𝑦 ({𝑧} × 𝒫 𝑧)))
38	37	cbvmptv 5255	. . . . . . . . . . . . . . 15 ⊢ (𝑥 ∈ (𝒫 ω ∩ Fin) ↦ (card‘∪ 𝑓 ∈ 𝑥 ({𝑓} × 𝒫 𝑓))) = (𝑦 ∈ (𝒫 ω ∩ Fin) ↦ (card‘∪ 𝑧 ∈ 𝑦 ({𝑧} × 𝒫 𝑧)))
39	38	ackbij1 10277	. . . . . . . . . . . . . 14 ⊢ (𝑥 ∈ (𝒫 ω ∩ Fin) ↦ (card‘∪ 𝑓 ∈ 𝑥 ({𝑓} × 𝒫 𝑓))):(𝒫 ω ∩ Fin)–1-1-onto→ω
40		f1oeng 9011	. . . . . . . . . . . . . 14 ⊢ (((𝒫 ω ∩ Fin) ∈ V ∧ (𝑥 ∈ (𝒫 ω ∩ Fin) ↦ (card‘∪ 𝑓 ∈ 𝑥 ({𝑓} × 𝒫 𝑓))):(𝒫 ω ∩ Fin)–1-1-onto→ω) → (𝒫 ω ∩ Fin) ≈ ω)
41	23, 39, 40	sylancl 586	. . . . . . . . . . . . 13 ⊢ (((𝐴 ∈ 𝐵 ∧ ω ∈ V) ∧ 𝑓:𝐴–1-1→ω) → (𝒫 ω ∩ Fin) ≈ ω)
42		domentr 9053	. . . . . . . . . . . . 13 ⊢ (((𝒫 ran 𝑓 ∩ Fin) ≼ (𝒫 ω ∩ Fin) ∧ (𝒫 ω ∩ Fin) ≈ ω) → (𝒫 ran 𝑓 ∩ Fin) ≼ ω)
43	30, 41, 42	syl2anc 584	. . . . . . . . . . . 12 ⊢ (((𝐴 ∈ 𝐵 ∧ ω ∈ V) ∧ 𝑓:𝐴–1-1→ω) → (𝒫 ran 𝑓 ∩ Fin) ≼ ω)
44		endomtr 9052	. . . . . . . . . . . 12 ⊢ (((𝒫 𝐴 ∩ Fin) ≈ (𝒫 ran 𝑓 ∩ Fin) ∧ (𝒫 ran 𝑓 ∩ Fin) ≼ ω) → (𝒫 𝐴 ∩ Fin) ≼ ω)
45	19, 43, 44	syl2anc 584	. . . . . . . . . . 11 ⊢ (((𝐴 ∈ 𝐵 ∧ ω ∈ V) ∧ 𝑓:𝐴–1-1→ω) → (𝒫 𝐴 ∩ Fin) ≼ ω)
46		domtr 9047	. . . . . . . . . . 11 ⊢ ((((𝒫 𝐴 ∩ Fin) ∖ {∅}) ≼ (𝒫 𝐴 ∩ Fin) ∧ (𝒫 𝐴 ∩ Fin) ≼ ω) → ((𝒫 𝐴 ∩ Fin) ∖ {∅}) ≼ ω)
47	13, 45, 46	syl2anc 584	. . . . . . . . . 10 ⊢ (((𝐴 ∈ 𝐵 ∧ ω ∈ V) ∧ 𝑓:𝐴–1-1→ω) → ((𝒫 𝐴 ∩ Fin) ∖ {∅}) ≼ ω)
48		ondomen 10077	. . . . . . . . . 10 ⊢ ((ω ∈ On ∧ ((𝒫 𝐴 ∩ Fin) ∖ {∅}) ≼ ω) → ((𝒫 𝐴 ∩ Fin) ∖ {∅}) ∈ dom card)
49	6, 47, 48	syl2anc 584	. . . . . . . . 9 ⊢ (((𝐴 ∈ 𝐵 ∧ ω ∈ V) ∧ 𝑓:𝐴–1-1→ω) → ((𝒫 𝐴 ∩ Fin) ∖ {∅}) ∈ dom card)
50		eqid 2737	. . . . . . . . . . 11 ⊢ (𝑦 ∈ ((𝒫 𝐴 ∩ Fin) ∖ {∅}) ↦ ∩ 𝑦) = (𝑦 ∈ ((𝒫 𝐴 ∩ Fin) ∖ {∅}) ↦ ∩ 𝑦)
51	50	fifo 9472	. . . . . . . . . 10 ⊢ (𝐴 ∈ 𝐵 → (𝑦 ∈ ((𝒫 𝐴 ∩ Fin) ∖ {∅}) ↦ ∩ 𝑦):((𝒫 𝐴 ∩ Fin) ∖ {∅})–onto→(fi‘𝐴))
52	51	ad2antrr 726	. . . . . . . . 9 ⊢ (((𝐴 ∈ 𝐵 ∧ ω ∈ V) ∧ 𝑓:𝐴–1-1→ω) → (𝑦 ∈ ((𝒫 𝐴 ∩ Fin) ∖ {∅}) ↦ ∩ 𝑦):((𝒫 𝐴 ∩ Fin) ∖ {∅})–onto→(fi‘𝐴))
53		fodomnum 10097	. . . . . . . . 9 ⊢ (((𝒫 𝐴 ∩ Fin) ∖ {∅}) ∈ dom card → ((𝑦 ∈ ((𝒫 𝐴 ∩ Fin) ∖ {∅}) ↦ ∩ 𝑦):((𝒫 𝐴 ∩ Fin) ∖ {∅})–onto→(fi‘𝐴) → (fi‘𝐴) ≼ ((𝒫 𝐴 ∩ Fin) ∖ {∅})))
54	49, 52, 53	sylc 65	. . . . . . . 8 ⊢ (((𝐴 ∈ 𝐵 ∧ ω ∈ V) ∧ 𝑓:𝐴–1-1→ω) → (fi‘𝐴) ≼ ((𝒫 𝐴 ∩ Fin) ∖ {∅}))
55		domtr 9047	. . . . . . . 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 6919	. . . 4 ⊢ (fi‘𝐴) ∈ V
63		ssfii 9459	. . . 4 ⊢ (𝐴 ∈ 𝐵 → 𝐴 ⊆ (fi‘𝐴))
64		ssdomg 9040	. . . 4 ⊢ ((fi‘𝐴) ∈ V → (𝐴 ⊆ (fi‘𝐴) → 𝐴 ≼ (fi‘𝐴)))
65	62, 63, 64	mpsyl 68	. . 3 ⊢ (𝐴 ∈ 𝐵 → 𝐴 ≼ (fi‘𝐴))
66		domtr 9047	. . . 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 3480   ∖ cdif 3948   ∩ cin 3950   ⊆ wss 3951  ∅c0 4333  𝒫 cpw 4600  {csn 4626  ∩ cint 4946  ∪ ciun 4991   class class class wbr 5143   ↦ cmpt 5225   × cxp 5683  dom cdm 5685  ran crn 5686   “ cima 5688  Oncon0 6384  –1-1→wf1 6558  –onto→wfo 6559  –1-1-onto→wf1o 6560  ‘cfv 6561  ωcom 7887   ≈ cen 8982   ≼ cdom 8983  Fincfn 8985  ficfi 9450  cardccrd 9975

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 2708  ax-rep 5279  ax-sep 5296  ax-nul 5306  ax-pow 5365  ax-pr 5432  ax-un 7755

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2540  df-eu 2569  df-clab 2715  df-cleq 2729  df-clel 2816  df-nfc 2892  df-ne 2941  df-ral 3062  df-rex 3071  df-rmo 3380  df-reu 3381  df-rab 3437  df-v 3482  df-sbc 3789  df-csb 3900  df-dif 3954  df-un 3956  df-in 3958  df-ss 3968  df-pss 3971  df-nul 4334  df-if 4526  df-pw 4602  df-sn 4627  df-pr 4629  df-op 4633  df-uni 4908  df-int 4947  df-iun 4993  df-br 5144  df-opab 5206  df-mpt 5226  df-tr 5260  df-id 5578  df-eprel 5584  df-po 5592  df-so 5593  df-fr 5637  df-se 5638  df-we 5639  df-xp 5691  df-rel 5692  df-cnv 5693  df-co 5694  df-dm 5695  df-rn 5696  df-res 5697  df-ima 5698  df-pred 6321  df-ord 6387  df-on 6388  df-lim 6389  df-suc 6390  df-iota 6514  df-fun 6563  df-fn 6564  df-f 6565  df-f1 6566  df-fo 6567  df-f1o 6568  df-fv 6569  df-isom 6570  df-riota 7388  df-ov 7434  df-oprab 7435  df-mpo 7436  df-om 7888  df-1st 8014  df-2nd 8015  df-frecs 8306  df-wrecs 8337  df-recs 8411  df-rdg 8450  df-1o 8506  df-2o 8507  df-oadd 8510  df-er 8745  df-map 8868  df-en 8986  df-dom 8987  df-sdom 8988  df-fin 8989  df-fi 9451  df-dju 9941  df-card 9979  df-acn 9982

This theorem is referenced by:  2ndcsb  23457