Theorem enfin1ai 10379

Description: Ia-finiteness is a cardinal property. (Contributed by Mario Carneiro, 18-May-2015.)

Assertion

Ref	Expression
enfin1ai	⊢ (𝐴 ≈ 𝐵 → (𝐴 ∈ FinIa → 𝐵 ∈ FinIa))

Proof of Theorem enfin1ai

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

Step	Hyp	Ref	Expression
1		ensym 8999	. . 3 ⊢ (𝐴 ≈ 𝐵 → 𝐵 ≈ 𝐴)
2		bren 8949	. . 3 ⊢ (𝐵 ≈ 𝐴 ↔ ∃𝑓 𝑓:𝐵–1-1-onto→𝐴)
3	1, 2	sylib 217	. 2 ⊢ (𝐴 ≈ 𝐵 → ∃𝑓 𝑓:𝐵–1-1-onto→𝐴)
4		elpwi 4610	. . . . . . 7 ⊢ (𝑥 ∈ 𝒫 𝐵 → 𝑥 ⊆ 𝐵)
5		simplr 768	. . . . . . . . 9 ⊢ (((𝑓:𝐵–1-1-onto→𝐴 ∧ 𝐴 ∈ FinIa) ∧ 𝑥 ⊆ 𝐵) → 𝐴 ∈ FinIa)
6		imassrn 6071	. . . . . . . . . 10 ⊢ (𝑓 “ 𝑥) ⊆ ran 𝑓
7		f1of 6834	. . . . . . . . . . . 12 ⊢ (𝑓:𝐵–1-1-onto→𝐴 → 𝑓:𝐵⟶𝐴)
8	7	ad2antrr 725	. . . . . . . . . . 11 ⊢ (((𝑓:𝐵–1-1-onto→𝐴 ∧ 𝐴 ∈ FinIa) ∧ 𝑥 ⊆ 𝐵) → 𝑓:𝐵⟶𝐴)
9	8	frnd 6726	. . . . . . . . . 10 ⊢ (((𝑓:𝐵–1-1-onto→𝐴 ∧ 𝐴 ∈ FinIa) ∧ 𝑥 ⊆ 𝐵) → ran 𝑓 ⊆ 𝐴)
10	6, 9	sstrid 3994	. . . . . . . . 9 ⊢ (((𝑓:𝐵–1-1-onto→𝐴 ∧ 𝐴 ∈ FinIa) ∧ 𝑥 ⊆ 𝐵) → (𝑓 “ 𝑥) ⊆ 𝐴)
11		fin1ai 10288	. . . . . . . . 9 ⊢ ((𝐴 ∈ FinIa ∧ (𝑓 “ 𝑥) ⊆ 𝐴) → ((𝑓 “ 𝑥) ∈ Fin ∨ (𝐴 ∖ (𝑓 “ 𝑥)) ∈ Fin))
12	5, 10, 11	syl2anc 585	. . . . . . . 8 ⊢ (((𝑓:𝐵–1-1-onto→𝐴 ∧ 𝐴 ∈ FinIa) ∧ 𝑥 ⊆ 𝐵) → ((𝑓 “ 𝑥) ∈ Fin ∨ (𝐴 ∖ (𝑓 “ 𝑥)) ∈ Fin))
13		f1of1 6833	. . . . . . . . . . . 12 ⊢ (𝑓:𝐵–1-1-onto→𝐴 → 𝑓:𝐵–1-1→𝐴)
14	13	ad2antrr 725	. . . . . . . . . . 11 ⊢ (((𝑓:𝐵–1-1-onto→𝐴 ∧ 𝐴 ∈ FinIa) ∧ 𝑥 ⊆ 𝐵) → 𝑓:𝐵–1-1→𝐴)
15		simpr 486	. . . . . . . . . . 11 ⊢ (((𝑓:𝐵–1-1-onto→𝐴 ∧ 𝐴 ∈ FinIa) ∧ 𝑥 ⊆ 𝐵) → 𝑥 ⊆ 𝐵)
16		vex 3479	. . . . . . . . . . . 12 ⊢ 𝑥 ∈ V
17	16	a1i 11	. . . . . . . . . . 11 ⊢ (((𝑓:𝐵–1-1-onto→𝐴 ∧ 𝐴 ∈ FinIa) ∧ 𝑥 ⊆ 𝐵) → 𝑥 ∈ V)
18		f1imaeng 9010	. . . . . . . . . . 11 ⊢ ((𝑓:𝐵–1-1→𝐴 ∧ 𝑥 ⊆ 𝐵 ∧ 𝑥 ∈ V) → (𝑓 “ 𝑥) ≈ 𝑥)
19	14, 15, 17, 18	syl3anc 1372	. . . . . . . . . 10 ⊢ (((𝑓:𝐵–1-1-onto→𝐴 ∧ 𝐴 ∈ FinIa) ∧ 𝑥 ⊆ 𝐵) → (𝑓 “ 𝑥) ≈ 𝑥)
20		enfi 9190	. . . . . . . . . 10 ⊢ ((𝑓 “ 𝑥) ≈ 𝑥 → ((𝑓 “ 𝑥) ∈ Fin ↔ 𝑥 ∈ Fin))
21	19, 20	syl 17	. . . . . . . . 9 ⊢ (((𝑓:𝐵–1-1-onto→𝐴 ∧ 𝐴 ∈ FinIa) ∧ 𝑥 ⊆ 𝐵) → ((𝑓 “ 𝑥) ∈ Fin ↔ 𝑥 ∈ Fin))
22		df-f1 6549	. . . . . . . . . . . . . 14 ⊢ (𝑓:𝐵–1-1→𝐴 ↔ (𝑓:𝐵⟶𝐴 ∧ Fun ◡𝑓))
23	22	simprbi 498	. . . . . . . . . . . . 13 ⊢ (𝑓:𝐵–1-1→𝐴 → Fun ◡𝑓)
24		imadif 6633	. . . . . . . . . . . . 13 ⊢ (Fun ◡𝑓 → (𝑓 “ (𝐵 ∖ 𝑥)) = ((𝑓 “ 𝐵) ∖ (𝑓 “ 𝑥)))
25	14, 23, 24	3syl 18	. . . . . . . . . . . 12 ⊢ (((𝑓:𝐵–1-1-onto→𝐴 ∧ 𝐴 ∈ FinIa) ∧ 𝑥 ⊆ 𝐵) → (𝑓 “ (𝐵 ∖ 𝑥)) = ((𝑓 “ 𝐵) ∖ (𝑓 “ 𝑥)))
26		f1ofo 6841	. . . . . . . . . . . . . . 15 ⊢ (𝑓:𝐵–1-1-onto→𝐴 → 𝑓:𝐵–onto→𝐴)
27		foima 6811	. . . . . . . . . . . . . . 15 ⊢ (𝑓:𝐵–onto→𝐴 → (𝑓 “ 𝐵) = 𝐴)
28	26, 27	syl 17	. . . . . . . . . . . . . 14 ⊢ (𝑓:𝐵–1-1-onto→𝐴 → (𝑓 “ 𝐵) = 𝐴)
29	28	ad2antrr 725	. . . . . . . . . . . . 13 ⊢ (((𝑓:𝐵–1-1-onto→𝐴 ∧ 𝐴 ∈ FinIa) ∧ 𝑥 ⊆ 𝐵) → (𝑓 “ 𝐵) = 𝐴)
30	29	difeq1d 4122	. . . . . . . . . . . 12 ⊢ (((𝑓:𝐵–1-1-onto→𝐴 ∧ 𝐴 ∈ FinIa) ∧ 𝑥 ⊆ 𝐵) → ((𝑓 “ 𝐵) ∖ (𝑓 “ 𝑥)) = (𝐴 ∖ (𝑓 “ 𝑥)))
31	25, 30	eqtrd 2773	. . . . . . . . . . 11 ⊢ (((𝑓:𝐵–1-1-onto→𝐴 ∧ 𝐴 ∈ FinIa) ∧ 𝑥 ⊆ 𝐵) → (𝑓 “ (𝐵 ∖ 𝑥)) = (𝐴 ∖ (𝑓 “ 𝑥)))
32		difssd 4133	. . . . . . . . . . . 12 ⊢ (((𝑓:𝐵–1-1-onto→𝐴 ∧ 𝐴 ∈ FinIa) ∧ 𝑥 ⊆ 𝐵) → (𝐵 ∖ 𝑥) ⊆ 𝐵)
33		vex 3479	. . . . . . . . . . . . . . 15 ⊢ 𝑓 ∈ V
34	7	adantr 482	. . . . . . . . . . . . . . 15 ⊢ ((𝑓:𝐵–1-1-onto→𝐴 ∧ 𝐴 ∈ FinIa) → 𝑓:𝐵⟶𝐴)
35		dmfex 7898	. . . . . . . . . . . . . . 15 ⊢ ((𝑓 ∈ V ∧ 𝑓:𝐵⟶𝐴) → 𝐵 ∈ V)
36	33, 34, 35	sylancr 588	. . . . . . . . . . . . . 14 ⊢ ((𝑓:𝐵–1-1-onto→𝐴 ∧ 𝐴 ∈ FinIa) → 𝐵 ∈ V)
37	36	adantr 482	. . . . . . . . . . . . 13 ⊢ (((𝑓:𝐵–1-1-onto→𝐴 ∧ 𝐴 ∈ FinIa) ∧ 𝑥 ⊆ 𝐵) → 𝐵 ∈ V)
38	37	difexd 5330	. . . . . . . . . . . 12 ⊢ (((𝑓:𝐵–1-1-onto→𝐴 ∧ 𝐴 ∈ FinIa) ∧ 𝑥 ⊆ 𝐵) → (𝐵 ∖ 𝑥) ∈ V)
39		f1imaeng 9010	. . . . . . . . . . . 12 ⊢ ((𝑓:𝐵–1-1→𝐴 ∧ (𝐵 ∖ 𝑥) ⊆ 𝐵 ∧ (𝐵 ∖ 𝑥) ∈ V) → (𝑓 “ (𝐵 ∖ 𝑥)) ≈ (𝐵 ∖ 𝑥))
40	14, 32, 38, 39	syl3anc 1372	. . . . . . . . . . 11 ⊢ (((𝑓:𝐵–1-1-onto→𝐴 ∧ 𝐴 ∈ FinIa) ∧ 𝑥 ⊆ 𝐵) → (𝑓 “ (𝐵 ∖ 𝑥)) ≈ (𝐵 ∖ 𝑥))
41	31, 40	eqbrtrrd 5173	. . . . . . . . . 10 ⊢ (((𝑓:𝐵–1-1-onto→𝐴 ∧ 𝐴 ∈ FinIa) ∧ 𝑥 ⊆ 𝐵) → (𝐴 ∖ (𝑓 “ 𝑥)) ≈ (𝐵 ∖ 𝑥))
42		enfi 9190	. . . . . . . . . 10 ⊢ ((𝐴 ∖ (𝑓 “ 𝑥)) ≈ (𝐵 ∖ 𝑥) → ((𝐴 ∖ (𝑓 “ 𝑥)) ∈ Fin ↔ (𝐵 ∖ 𝑥) ∈ Fin))
43	41, 42	syl 17	. . . . . . . . 9 ⊢ (((𝑓:𝐵–1-1-onto→𝐴 ∧ 𝐴 ∈ FinIa) ∧ 𝑥 ⊆ 𝐵) → ((𝐴 ∖ (𝑓 “ 𝑥)) ∈ Fin ↔ (𝐵 ∖ 𝑥) ∈ Fin))
44	21, 43	orbi12d 918	. . . . . . . 8 ⊢ (((𝑓:𝐵–1-1-onto→𝐴 ∧ 𝐴 ∈ FinIa) ∧ 𝑥 ⊆ 𝐵) → (((𝑓 “ 𝑥) ∈ Fin ∨ (𝐴 ∖ (𝑓 “ 𝑥)) ∈ Fin) ↔ (𝑥 ∈ Fin ∨ (𝐵 ∖ 𝑥) ∈ Fin)))
45	12, 44	mpbid 231	. . . . . . 7 ⊢ (((𝑓:𝐵–1-1-onto→𝐴 ∧ 𝐴 ∈ FinIa) ∧ 𝑥 ⊆ 𝐵) → (𝑥 ∈ Fin ∨ (𝐵 ∖ 𝑥) ∈ Fin))
46	4, 45	sylan2 594	. . . . . 6 ⊢ (((𝑓:𝐵–1-1-onto→𝐴 ∧ 𝐴 ∈ FinIa) ∧ 𝑥 ∈ 𝒫 𝐵) → (𝑥 ∈ Fin ∨ (𝐵 ∖ 𝑥) ∈ Fin))
47	46	ralrimiva 3147	. . . . 5 ⊢ ((𝑓:𝐵–1-1-onto→𝐴 ∧ 𝐴 ∈ FinIa) → ∀𝑥 ∈ 𝒫 𝐵(𝑥 ∈ Fin ∨ (𝐵 ∖ 𝑥) ∈ Fin))
48		isfin1a 10287	. . . . . 6 ⊢ (𝐵 ∈ V → (𝐵 ∈ FinIa ↔ ∀𝑥 ∈ 𝒫 𝐵(𝑥 ∈ Fin ∨ (𝐵 ∖ 𝑥) ∈ Fin)))
49	36, 48	syl 17	. . . . 5 ⊢ ((𝑓:𝐵–1-1-onto→𝐴 ∧ 𝐴 ∈ FinIa) → (𝐵 ∈ FinIa ↔ ∀𝑥 ∈ 𝒫 𝐵(𝑥 ∈ Fin ∨ (𝐵 ∖ 𝑥) ∈ Fin)))
50	47, 49	mpbird 257	. . . 4 ⊢ ((𝑓:𝐵–1-1-onto→𝐴 ∧ 𝐴 ∈ FinIa) → 𝐵 ∈ FinIa)
51	50	ex 414	. . 3 ⊢ (𝑓:𝐵–1-1-onto→𝐴 → (𝐴 ∈ FinIa → 𝐵 ∈ FinIa))
52	51	exlimiv 1934	. 2 ⊢ (∃𝑓 𝑓:𝐵–1-1-onto→𝐴 → (𝐴 ∈ FinIa → 𝐵 ∈ FinIa))
53	3, 52	syl 17	1 ⊢ (𝐴 ≈ 𝐵 → (𝐴 ∈ FinIa → 𝐵 ∈ FinIa))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 397   ∨ wo 846   = wceq 1542  ∃wex 1782   ∈ wcel 2107  ∀wral 3062  Vcvv 3475   ∖ cdif 3946   ⊆ wss 3949  𝒫 cpw 4603   class class class wbr 5149  ^◡ccnv 5676  ran crn 5678   “ cima 5680  Fun wfun 6538  ⟶wf 6540  –1-1→wf1 6541  –onto→wfo 6542  –1-1-onto→wf1o 6543   ≈ cen 8936  Fincfn 8939  Fin^Iacfin1a 10273

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 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-10 2138  ax-11 2155  ax-12 2172  ax-ext 2704  ax-rep 5286  ax-sep 5300  ax-nul 5307  ax-pow 5364  ax-pr 5428  ax-un 7725

This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-3or 1089  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1783  df-nf 1787  df-sb 2069  df-mo 2535  df-eu 2564  df-clab 2711  df-cleq 2725  df-clel 2811  df-nfc 2886  df-ne 2942  df-ral 3063  df-rex 3072  df-reu 3378  df-rab 3434  df-v 3477  df-sbc 3779  df-csb 3895  df-dif 3952  df-un 3954  df-in 3956  df-ss 3966  df-pss 3968  df-nul 4324  df-if 4530  df-pw 4605  df-sn 4630  df-pr 4632  df-op 4636  df-uni 4910  df-iun 5000  df-br 5150  df-opab 5212  df-mpt 5233  df-tr 5267  df-id 5575  df-eprel 5581  df-po 5589  df-so 5590  df-fr 5632  df-we 5634  df-xp 5683  df-rel 5684  df-cnv 5685  df-co 5686  df-dm 5687  df-rn 5688  df-res 5689  df-ima 5690  df-ord 6368  df-on 6369  df-lim 6370  df-suc 6371  df-iota 6496  df-fun 6546  df-fn 6547  df-f 6548  df-f1 6549  df-fo 6550  df-f1o 6551  df-fv 6552  df-om 7856  df-1o 8466  df-er 8703  df-en 8940  df-fin 8943  df-fin1a 10280

This theorem is referenced by: (None)