MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  fnfi Structured version   Visualization version   GIF version

Theorem fnfi 9177
Description: A version of fnex 7215 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.
StepHypRef Expression
1 fnresdm 6666 . . 3 (𝐹 Fn 𝐴 → (𝐹𝐴) = 𝐹)
21adantr 481 . 2 ((𝐹 Fn 𝐴𝐴 ∈ Fin) → (𝐹𝐴) = 𝐹)
3 reseq2 5974 . . . . . 6 (𝑥 = ∅ → (𝐹𝑥) = (𝐹 ↾ ∅))
43eleq1d 2818 . . . . 5 (𝑥 = ∅ → ((𝐹𝑥) ∈ Fin ↔ (𝐹 ↾ ∅) ∈ Fin))
54imbi2d 340 . . . 4 (𝑥 = ∅ → (((𝐹 Fn 𝐴𝐴 ∈ Fin) → (𝐹𝑥) ∈ Fin) ↔ ((𝐹 Fn 𝐴𝐴 ∈ Fin) → (𝐹 ↾ ∅) ∈ Fin)))
6 reseq2 5974 . . . . . 6 (𝑥 = 𝑦 → (𝐹𝑥) = (𝐹𝑦))
76eleq1d 2818 . . . . 5 (𝑥 = 𝑦 → ((𝐹𝑥) ∈ Fin ↔ (𝐹𝑦) ∈ Fin))
87imbi2d 340 . . . 4 (𝑥 = 𝑦 → (((𝐹 Fn 𝐴𝐴 ∈ Fin) → (𝐹𝑥) ∈ Fin) ↔ ((𝐹 Fn 𝐴𝐴 ∈ Fin) → (𝐹𝑦) ∈ Fin)))
9 reseq2 5974 . . . . . 6 (𝑥 = (𝑦 ∪ {𝑧}) → (𝐹𝑥) = (𝐹 ↾ (𝑦 ∪ {𝑧})))
109eleq1d 2818 . . . . 5 (𝑥 = (𝑦 ∪ {𝑧}) → ((𝐹𝑥) ∈ Fin ↔ (𝐹 ↾ (𝑦 ∪ {𝑧})) ∈ Fin))
1110imbi2d 340 . . . 4 (𝑥 = (𝑦 ∪ {𝑧}) → (((𝐹 Fn 𝐴𝐴 ∈ Fin) → (𝐹𝑥) ∈ Fin) ↔ ((𝐹 Fn 𝐴𝐴 ∈ Fin) → (𝐹 ↾ (𝑦 ∪ {𝑧})) ∈ Fin)))
12 reseq2 5974 . . . . . 6 (𝑥 = 𝐴 → (𝐹𝑥) = (𝐹𝐴))
1312eleq1d 2818 . . . . 5 (𝑥 = 𝐴 → ((𝐹𝑥) ∈ Fin ↔ (𝐹𝐴) ∈ Fin))
1413imbi2d 340 . . . 4 (𝑥 = 𝐴 → (((𝐹 Fn 𝐴𝐴 ∈ Fin) → (𝐹𝑥) ∈ Fin) ↔ ((𝐹 Fn 𝐴𝐴 ∈ Fin) → (𝐹𝐴) ∈ Fin)))
15 res0 5983 . . . . . 6 (𝐹 ↾ ∅) = ∅
16 0fin 9167 . . . . . 6 ∅ ∈ Fin
1715, 16eqeltri 2829 . . . . 5 (𝐹 ↾ ∅) ∈ Fin
1817a1i 11 . . . 4 ((𝐹 Fn 𝐴𝐴 ∈ Fin) → (𝐹 ↾ ∅) ∈ Fin)
19 resundi 5993 . . . . . . . 8 (𝐹 ↾ (𝑦 ∪ {𝑧})) = ((𝐹𝑦) ∪ (𝐹 ↾ {𝑧}))
20 snfi 9040 . . . . . . . . . 10 {⟨𝑧, (𝐹𝑧)⟩} ∈ Fin
21 fnfun 6646 . . . . . . . . . . . 12 (𝐹 Fn 𝐴 → Fun 𝐹)
22 funressn 7153 . . . . . . . . . . . 12 (Fun 𝐹 → (𝐹 ↾ {𝑧}) ⊆ {⟨𝑧, (𝐹𝑧)⟩})
2321, 22syl 17 . . . . . . . . . . 11 (𝐹 Fn 𝐴 → (𝐹 ↾ {𝑧}) ⊆ {⟨𝑧, (𝐹𝑧)⟩})
2423adantr 481 . . . . . . . . . 10 ((𝐹 Fn 𝐴𝐴 ∈ Fin) → (𝐹 ↾ {𝑧}) ⊆ {⟨𝑧, (𝐹𝑧)⟩})
25 ssfi 9169 . . . . . . . . . 10 (({⟨𝑧, (𝐹𝑧)⟩} ∈ Fin ∧ (𝐹 ↾ {𝑧}) ⊆ {⟨𝑧, (𝐹𝑧)⟩}) → (𝐹 ↾ {𝑧}) ∈ Fin)
2620, 24, 25sylancr 587 . . . . . . . . 9 ((𝐹 Fn 𝐴𝐴 ∈ Fin) → (𝐹 ↾ {𝑧}) ∈ Fin)
27 unfi 9168 . . . . . . . . 9 (((𝐹𝑦) ∈ Fin ∧ (𝐹 ↾ {𝑧}) ∈ Fin) → ((𝐹𝑦) ∪ (𝐹 ↾ {𝑧})) ∈ Fin)
2826, 27sylan2 593 . . . . . . . 8 (((𝐹𝑦) ∈ Fin ∧ (𝐹 Fn 𝐴𝐴 ∈ Fin)) → ((𝐹𝑦) ∪ (𝐹 ↾ {𝑧})) ∈ Fin)
2919, 28eqeltrid 2837 . . . . . . 7 (((𝐹𝑦) ∈ Fin ∧ (𝐹 Fn 𝐴𝐴 ∈ Fin)) → (𝐹 ↾ (𝑦 ∪ {𝑧})) ∈ Fin)
3029expcom 414 . . . . . 6 ((𝐹 Fn 𝐴𝐴 ∈ Fin) → ((𝐹𝑦) ∈ Fin → (𝐹 ↾ (𝑦 ∪ {𝑧})) ∈ Fin))
3130a2i 14 . . . . 5 (((𝐹 Fn 𝐴𝐴 ∈ Fin) → (𝐹𝑦) ∈ Fin) → ((𝐹 Fn 𝐴𝐴 ∈ Fin) → (𝐹 ↾ (𝑦 ∪ {𝑧})) ∈ Fin))
3231a1i 11 . . . 4 (𝑦 ∈ Fin → (((𝐹 Fn 𝐴𝐴 ∈ Fin) → (𝐹𝑦) ∈ Fin) → ((𝐹 Fn 𝐴𝐴 ∈ Fin) → (𝐹 ↾ (𝑦 ∪ {𝑧})) ∈ Fin)))
335, 8, 11, 14, 18, 32findcard2 9160 . . 3 (𝐴 ∈ Fin → ((𝐹 Fn 𝐴𝐴 ∈ Fin) → (𝐹𝐴) ∈ Fin))
3433anabsi7 669 . 2 ((𝐹 Fn 𝐴𝐴 ∈ Fin) → (𝐹𝐴) ∈ Fin)
352, 34eqeltrrd 2834 1 ((𝐹 Fn 𝐴𝐴 ∈ Fin) → 𝐹 ∈ Fin)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 396   = wceq 1541  wcel 2106  cun 3945  wss 3947  c0 4321  {csn 4627  cop 4633  cres 5677  Fun wfun 6534   Fn wfn 6535  cfv 6540  Fincfn 8935
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2703  ax-sep 5298  ax-nul 5305  ax-pr 5426  ax-un 7721
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3or 1088  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2534  df-eu 2563  df-clab 2710  df-cleq 2724  df-clel 2810  df-nfc 2885  df-ne 2941  df-ral 3062  df-rex 3071  df-reu 3377  df-rab 3433  df-v 3476  df-sbc 3777  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-pss 3966  df-nul 4322  df-if 4528  df-pw 4603  df-sn 4628  df-pr 4630  df-op 4634  df-uni 4908  df-br 5148  df-opab 5210  df-tr 5265  df-id 5573  df-eprel 5579  df-po 5587  df-so 5588  df-fr 5630  df-we 5632  df-xp 5681  df-rel 5682  df-cnv 5683  df-co 5684  df-dm 5685  df-rn 5686  df-res 5687  df-ima 5688  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6492  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-om 7852  df-1o 8462  df-en 8936  df-fin 8939
This theorem is referenced by:  f1oenfi  9178  f1oenfirn  9179  f1domfi  9180  f1domfi2  9181  sbthfilem  9197  fundmfibi  9327  resfnfinfin  9328  unirnffid  9340  mptfi  9347  seqf1olem2  14004  seqf1o  14005  wrdfin  14478  isstruct2  17078  xpsfrnel  17504  cmpcref  32818  carsggect  33305  ptrecube  36476  ftc1anclem3  36551  sstotbnd2  36630  prdstotbnd  36650  cantnfub  42056  cantnfub2  42057  ffi  43854  stoweidlem59  44761  fourierdlem42  44851  fourierdlem54  44862
  Copyright terms: Public domain W3C validator