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

Theorem cnvfi 9228
Description: If a set is finite, its converse is as well. (Contributed by Mario Carneiro, 28-Dec-2014.) Avoid ax-pow 5333. (Revised by BTernaryTau, 9-Sep-2024.)
Assertion
Ref Expression
cnvfi (𝐴 ∈ Fin → ◡𝐴 ∈ Fin)

Proof of Theorem cnvfi
Dummy variables 𝑥 𝑦 𝑧 𝑣 𝑢 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 cnveq 5862 . . 3 (𝑥 = ∅ → ◡𝑥 = ◡∅)
21eleq1d 2852 . 2 (𝑥 = ∅ → (◡𝑥 ∈ Fin ↔ ◡∅ ∈ Fin))
3 cnveq 5862 . . 3 (𝑥 = 𝑦 → ◡𝑥 = ◡𝑦)
43eleq1d 2852 . 2 (𝑥 = 𝑦 → (◡𝑥 ∈ Fin ↔ ◡𝑦 ∈ Fin))
5 cnveq 5862 . . 3 (𝑥 = (𝑦 ∪ {𝑧}) → ◡𝑥 = ◡(𝑦 ∪ {𝑧}))
65eleq1d 2852 . 2 (𝑥 = (𝑦 ∪ {𝑧}) → (◡𝑥 ∈ Fin ↔ ◡(𝑦 ∪ {𝑧}) ∈ Fin))
7 cnveq 5862 . . 3 (𝑥 = 𝐴 → ◡𝑥 = ◡𝐴)
87eleq1d 2852 . 2 (𝑥 = 𝐴 → (◡𝑥 ∈ Fin ↔ ◡𝐴 ∈ Fin))
9 cnv0 5872 . . 3 ◡∅ = ∅
10 0fi 9107 . . 3 ∅ ∈ Fin
119, 10eqeltri 2863 . 2 ◡∅ ∈ Fin
12 cnvun 6150 . . . 4 ◡(𝑦 ∪ {𝑧}) = (◡𝑦 ∪ ◡{𝑧})
13 elvv 5732 . . . . . . 7 (𝑧 ∈ (V × V) ↔ ∃𝑢∃𝑣 𝑧 = ⟨𝑢, 𝑣⟩)
14 sneq 4593 . . . . . . . . . 10 (𝑧 = ⟨𝑢, 𝑣⟩ → {𝑧} = {⟨𝑢, 𝑣⟩})
15 cnveq 5862 . . . . . . . . . . 11 ({𝑧} = {⟨𝑢, 𝑣⟩} → ◡{𝑧} = ◡{⟨𝑢, 𝑣⟩})
16 vex 3457 . . . . . . . . . . . 12 𝑢 ∈ V
17 vex 3457 . . . . . . . . . . . 12 𝑣 ∈ V
1816, 17cnvsn 6245 . . . . . . . . . . 11 ◡{⟨𝑢, 𝑣⟩} = {⟨𝑣, 𝑢⟩}
1915, 18eqtrdi 2817 . . . . . . . . . 10 ({𝑧} = {⟨𝑢, 𝑣⟩} → ◡{𝑧} = {⟨𝑣, 𝑢⟩})
2014, 19syl 18 . . . . . . . . 9 (𝑧 = ⟨𝑢, 𝑣⟩ → ◡{𝑧} = {⟨𝑣, 𝑢⟩})
21 snfi 9108 . . . . . . . . 9 {⟨𝑣, 𝑢⟩} ∈ Fin
2220, 21eqeltrdi 2875 . . . . . . . 8 (𝑧 = ⟨𝑢, 𝑣⟩ → ◡{𝑧} ∈ Fin)
2322exlimivv 1969 . . . . . . 7 (∃𝑢∃𝑣 𝑧 = ⟨𝑢, 𝑣⟩ → ◡{𝑧} ∈ Fin)
2413, 23sylbi 220 . . . . . 6 (𝑧 ∈ (V × V) → ◡{𝑧} ∈ Fin)
25 dfdm4 5888 . . . . . . . . 9 dom {𝑧} = ran ◡{𝑧}
26 dmsnn0 6226 . . . . . . . . . . 11 (𝑧 ∈ (V × V) ↔ dom {𝑧} ≠ ∅)
2726biimpri 231 . . . . . . . . . 10 (dom {𝑧} ≠ ∅ → 𝑧 ∈ (V × V))
2827necon1bi 2990 . . . . . . . . 9 (¬ 𝑧 ∈ (V × V) → dom {𝑧} = ∅)
2925, 28eqtr3id 2815 . . . . . . . 8 (¬ 𝑧 ∈ (V × V) → ran ◡{𝑧} = ∅)
30 relcnv 6117 . . . . . . . . 9 Rel ◡{𝑧}
31 relrn0 5966 . . . . . . . . 9 (Rel ◡{𝑧} → (◡{𝑧} = ∅ ↔ ran ◡{𝑧} = ∅))
3230, 31ax-mp 5 . . . . . . . 8 (◡{𝑧} = ∅ ↔ ran ◡{𝑧} = ∅)
3329, 32sylibr 237 . . . . . . 7 (¬ 𝑧 ∈ (V × V) → ◡{𝑧} = ∅)
3433, 10eqeltrdi 2875 . . . . . 6 (¬ 𝑧 ∈ (V × V) → ◡{𝑧} ∈ Fin)
3524, 34pm2.61i 184 . . . . 5 ◡{𝑧} ∈ Fin
36 unfi 9223 . . . . 5 ((◡𝑦 ∈ Fin ∧ ◡{𝑧} ∈ Fin) → (◡𝑦 ∪ ◡{𝑧}) ∈ Fin)
3735, 36mpan2 704 . . . 4 (◡𝑦 ∈ Fin → (◡𝑦 ∪ ◡{𝑧}) ∈ Fin)
3812, 37eqeltrid 2871 . . 3 (◡𝑦 ∈ Fin → ◡(𝑦 ∪ {𝑧}) ∈ Fin)
3938a1i 11 . 2 (𝑦 ∈ Fin → (◡𝑦 ∈ Fin → ◡(𝑦 ∪ {𝑧}) ∈ Fin))
402, 4, 6, 8, 11, 39findcard2 9217 1 (𝐴 ∈ Fin → ◡𝐴 ∈ Fin)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   = wceq 1572  ∃wex 1814   ∈ wcel 2150   ≠ wne 2962  Vcvv 3453   ∪ cun 4151  ∅c0 4280  {csn 4587  ⟨cop 4839   × cxp 5655  ◡ccnv 5656  dom cdm 5657  ran crn 5658  Rel wrel 5662  Fincfn 9010
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-10 2183  ax-11 2200  ax-12 2219  ax-ext 2738  ax-sep 5254  ax-nul 5265  ax-pr 5397  ax-un 7782
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1105  df-3an 1106  df-tru 1575  df-fal 1585  df-ex 1815  df-nf 1819  df-sb 2104  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2842  df-nfc 2916  df-ne 2963  df-ral 3084  df-rex 3094  df-reu 3369  df-rab 3416  df-v 3455  df-sbc 3742  df-ss 3900  df-pss 4016  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-op 4840  df-uni 4872  df-br 5108  df-opab 5173  df-tr 5218  df-id 5552  df-eprel 5557  df-po 5565  df-so 5566  df-fr 5610  df-we 5612  df-xp 5663  df-rel 5664  df-cnv 5665  df-co 5666  df-dm 5667  df-rn 5668  df-res 5669  df-ima 5670  df-ord 6390  df-on 6391  df-lim 6392  df-suc 6393  df-iota 6519  df-fun 6567  df-fn 6568  df-f 6569  df-f1 6570  df-fo 6571  df-f1o 6572  df-fv 6573  df-om 7911  df-1o 8513  df-en 9011  df-fin 9014
This theorem is used by:  f1oenfirn  9232  f1domfi  9233  sbthfilem  9250  fodomfir  9356  rnfi  9366  fsumcnv  15982  fprodcnv  16193  gsumcom3  20245  gsummpt2co  33709  gsumhashmul  33728
  Copyright terms: Public domain W3C validator