Theorem fnfi 9206

Description: A version of fnex 7229 for finite sets that does not require Replacement or Power Sets. (Contributed by Mario Carneiro, 16-Nov-2014.) (Revised by Mario Carneiro, 24-Jun-2015.)

Assertion

Ref	Expression
fnfi	⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ Fin) → 𝐹 ∈ Fin)

Proof of Theorem fnfi

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

Step	Hyp	Ref	Expression
1		fnresdm 6674	. . 3 ⊢ (𝐹 Fn 𝐴 → (𝐹 ↾ 𝐴) = 𝐹)
2	1	adantr 480	. 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ Fin) → (𝐹 ↾ 𝐴) = 𝐹)
3		reseq2 5980	. . . . . 6 ⊢ (𝑥 = ∅ → (𝐹 ↾ 𝑥) = (𝐹 ↾ ∅))
4	3	eleq1d 2814	. . . . 5 ⊢ (𝑥 = ∅ → ((𝐹 ↾ 𝑥) ∈ Fin ↔ (𝐹 ↾ ∅) ∈ Fin))
5	4	imbi2d 340	. . . 4 ⊢ (𝑥 = ∅ → (((𝐹 Fn 𝐴 ∧ 𝐴 ∈ Fin) → (𝐹 ↾ 𝑥) ∈ Fin) ↔ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ Fin) → (𝐹 ↾ ∅) ∈ Fin)))
6		reseq2 5980	. . . . . 6 ⊢ (𝑥 = 𝑦 → (𝐹 ↾ 𝑥) = (𝐹 ↾ 𝑦))
7	6	eleq1d 2814	. . . . 5 ⊢ (𝑥 = 𝑦 → ((𝐹 ↾ 𝑥) ∈ Fin ↔ (𝐹 ↾ 𝑦) ∈ Fin))
8	7	imbi2d 340	. . . 4 ⊢ (𝑥 = 𝑦 → (((𝐹 Fn 𝐴 ∧ 𝐴 ∈ Fin) → (𝐹 ↾ 𝑥) ∈ Fin) ↔ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ Fin) → (𝐹 ↾ 𝑦) ∈ Fin)))
9		reseq2 5980	. . . . . 6 ⊢ (𝑥 = (𝑦 ∪ {𝑧}) → (𝐹 ↾ 𝑥) = (𝐹 ↾ (𝑦 ∪ {𝑧})))
10	9	eleq1d 2814	. . . . 5 ⊢ (𝑥 = (𝑦 ∪ {𝑧}) → ((𝐹 ↾ 𝑥) ∈ Fin ↔ (𝐹 ↾ (𝑦 ∪ {𝑧})) ∈ Fin))
11	10	imbi2d 340	. . . 4 ⊢ (𝑥 = (𝑦 ∪ {𝑧}) → (((𝐹 Fn 𝐴 ∧ 𝐴 ∈ Fin) → (𝐹 ↾ 𝑥) ∈ Fin) ↔ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ Fin) → (𝐹 ↾ (𝑦 ∪ {𝑧})) ∈ Fin)))
12		reseq2 5980	. . . . . 6 ⊢ (𝑥 = 𝐴 → (𝐹 ↾ 𝑥) = (𝐹 ↾ 𝐴))
13	12	eleq1d 2814	. . . . 5 ⊢ (𝑥 = 𝐴 → ((𝐹 ↾ 𝑥) ∈ Fin ↔ (𝐹 ↾ 𝐴) ∈ Fin))
14	13	imbi2d 340	. . . 4 ⊢ (𝑥 = 𝐴 → (((𝐹 Fn 𝐴 ∧ 𝐴 ∈ Fin) → (𝐹 ↾ 𝑥) ∈ Fin) ↔ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ Fin) → (𝐹 ↾ 𝐴) ∈ Fin)))
15		res0 5989	. . . . . 6 ⊢ (𝐹 ↾ ∅) = ∅
16		0fin 9196	. . . . . 6 ⊢ ∅ ∈ Fin
17	15, 16	eqeltri 2825	. . . . 5 ⊢ (𝐹 ↾ ∅) ∈ Fin
18	17	a1i 11	. . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ Fin) → (𝐹 ↾ ∅) ∈ Fin)
19		resundi 5999	. . . . . . . 8 ⊢ (𝐹 ↾ (𝑦 ∪ {𝑧})) = ((𝐹 ↾ 𝑦) ∪ (𝐹 ↾ {𝑧}))
20		snfi 9069	. . . . . . . . . 10 ⊢ {⟨𝑧, (𝐹‘𝑧)⟩} ∈ Fin
21		fnfun 6654	. . . . . . . . . . . 12 ⊢ (𝐹 Fn 𝐴 → Fun 𝐹)
22		funressn 7168	. . . . . . . . . . . 12 ⊢ (Fun 𝐹 → (𝐹 ↾ {𝑧}) ⊆ {⟨𝑧, (𝐹‘𝑧)⟩})
23	21, 22	syl 17	. . . . . . . . . . 11 ⊢ (𝐹 Fn 𝐴 → (𝐹 ↾ {𝑧}) ⊆ {⟨𝑧, (𝐹‘𝑧)⟩})
24	23	adantr 480	. . . . . . . . . 10 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ Fin) → (𝐹 ↾ {𝑧}) ⊆ {⟨𝑧, (𝐹‘𝑧)⟩})
25		ssfi 9198	. . . . . . . . . 10 ⊢ (({⟨𝑧, (𝐹‘𝑧)⟩} ∈ Fin ∧ (𝐹 ↾ {𝑧}) ⊆ {⟨𝑧, (𝐹‘𝑧)⟩}) → (𝐹 ↾ {𝑧}) ∈ Fin)
26	20, 24, 25	sylancr 586	. . . . . . . . 9 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ Fin) → (𝐹 ↾ {𝑧}) ∈ Fin)
27		unfi 9197	. . . . . . . . 9 ⊢ (((𝐹 ↾ 𝑦) ∈ Fin ∧ (𝐹 ↾ {𝑧}) ∈ Fin) → ((𝐹 ↾ 𝑦) ∪ (𝐹 ↾ {𝑧})) ∈ Fin)
28	26, 27	sylan2 592	. . . . . . . 8 ⊢ (((𝐹 ↾ 𝑦) ∈ Fin ∧ (𝐹 Fn 𝐴 ∧ 𝐴 ∈ Fin)) → ((𝐹 ↾ 𝑦) ∪ (𝐹 ↾ {𝑧})) ∈ Fin)
29	19, 28	eqeltrid 2833	. . . . . . 7 ⊢ (((𝐹 ↾ 𝑦) ∈ Fin ∧ (𝐹 Fn 𝐴 ∧ 𝐴 ∈ Fin)) → (𝐹 ↾ (𝑦 ∪ {𝑧})) ∈ Fin)
30	29	expcom 413	. . . . . 6 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ Fin) → ((𝐹 ↾ 𝑦) ∈ Fin → (𝐹 ↾ (𝑦 ∪ {𝑧})) ∈ Fin))
31	30	a2i 14	. . . . 5 ⊢ (((𝐹 Fn 𝐴 ∧ 𝐴 ∈ Fin) → (𝐹 ↾ 𝑦) ∈ Fin) → ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ Fin) → (𝐹 ↾ (𝑦 ∪ {𝑧})) ∈ Fin))
32	31	a1i 11	. . . 4 ⊢ (𝑦 ∈ Fin → (((𝐹 Fn 𝐴 ∧ 𝐴 ∈ Fin) → (𝐹 ↾ 𝑦) ∈ Fin) → ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ Fin) → (𝐹 ↾ (𝑦 ∪ {𝑧})) ∈ Fin)))
33	5, 8, 11, 14, 18, 32	findcard2 9189	. . 3 ⊢ (𝐴 ∈ Fin → ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ Fin) → (𝐹 ↾ 𝐴) ∈ Fin))
34	33	anabsi7 670	. 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ Fin) → (𝐹 ↾ 𝐴) ∈ Fin)
35	2, 34	eqeltrrd 2830	1 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ Fin) → 𝐹 ∈ Fin)

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1534   ∈ wcel 2099   ∪ cun 3945   ⊆ wss 3947  ∅c0 4323  {csn 4629  ⟨cop 4635   ↾ cres 5680  Fun wfun 6542   Fn wfn 6543  ‘cfv 6548  Fincfn 8964

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1906  ax-6 1964  ax-7 2004  ax-8 2101  ax-9 2109  ax-10 2130  ax-11 2147  ax-12 2167  ax-ext 2699  ax-sep 5299  ax-nul 5306  ax-pr 5429  ax-un 7740

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 847  df-3or 1086  df-3an 1087  df-tru 1537  df-fal 1547  df-ex 1775  df-nf 1779  df-sb 2061  df-mo 2530  df-eu 2559  df-clab 2706  df-cleq 2720  df-clel 2806  df-nfc 2881  df-ne 2938  df-ral 3059  df-rex 3068  df-reu 3374  df-rab 3430  df-v 3473  df-sbc 3777  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-pss 3966  df-nul 4324  df-if 4530  df-pw 4605  df-sn 4630  df-pr 4632  df-op 4636  df-uni 4909  df-br 5149  df-opab 5211  df-tr 5266  df-id 5576  df-eprel 5582  df-po 5590  df-so 5591  df-fr 5633  df-we 5635  df-xp 5684  df-rel 5685  df-cnv 5686  df-co 5687  df-dm 5688  df-rn 5689  df-res 5690  df-ima 5691  df-ord 6372  df-on 6373  df-lim 6374  df-suc 6375  df-iota 6500  df-fun 6550  df-fn 6551  df-f 6552  df-f1 6553  df-fo 6554  df-f1o 6555  df-fv 6556  df-om 7871  df-1o 8487  df-en 8965  df-fin 8968

This theorem is referenced by:  f1oenfi  9207  f1oenfirn  9208  f1domfi  9209  f1domfi2  9210  sbthfilem  9226  fundmfibi  9356  resfnfinfin  9357  unirnffid  9369  mptfi  9376  seqf1olem2  14040  seqf1o  14041  wrdfin  14515  isstruct2  17118  xpsfrnel  17544  cmpcref  33451  carsggect  33938  ptrecube  37093  ftc1anclem3  37168  sstotbnd2  37247  prdstotbnd  37267  cantnfub  42750  cantnfub2  42751  ffi  44546  stoweidlem59  45447  fourierdlem42  45537  fourierdlem54  45548

Otomatik - 173.255.232.114 CloudFlare DNS Türk Telekom DNS Google DNS Open DNS

OSZAR »