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

Theorem cnvfi 9192
Description: If a set is finite, its converse is as well. (Contributed by Mario Carneiro, 28-Dec-2014.) Avoid ax-pow 5327. (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 5851 . . 3 (𝑥 = ∅ → ◡𝑥 = ◡∅)
21eleq1d 2846 . 2 (𝑥 = ∅ → (◡𝑥 ∈ Fin ↔ ◡∅ ∈ Fin))
3 cnveq 5851 . . 3 (𝑥 = 𝑦 → ◡𝑥 = ◡𝑦)
43eleq1d 2846 . 2 (𝑥 = 𝑦 → (◡𝑥 ∈ Fin ↔ ◡𝑦 ∈ Fin))
5 cnveq 5851 . . 3 (𝑥 = (𝑦 ∪ {𝑧}) → ◡𝑥 = ◡(𝑦 ∪ {𝑧}))
65eleq1d 2846 . 2 (𝑥 = (𝑦 ∪ {𝑧}) → (◡𝑥 ∈ Fin ↔ ◡(𝑦 ∪ {𝑧}) ∈ Fin))
7 cnveq 5851 . . 3 (𝑥 = 𝐴 → ◡𝑥 = ◡𝐴)
87eleq1d 2846 . 2 (𝑥 = 𝐴 → (◡𝑥 ∈ Fin ↔ ◡𝐴 ∈ Fin))
9 cnv0 5861 . . 3 ◡∅ = ∅
10 0fi 9071 . . 3 ∅ ∈ Fin
119, 10eqeltri 2857 . 2 ◡∅ ∈ Fin
12 cnvun 6133 . . . 4 ◡(𝑦 ∪ {𝑧}) = (◡𝑦 ∪ ◡{𝑧})
13 elvv 5726 . . . . . . 7 (𝑧 ∈ (V × V) ↔ ∃𝑢∃𝑣 𝑧 = ⟨𝑢, 𝑣⟩)
14 sneq 4594 . . . . . . . . . 10 (𝑧 = ⟨𝑢, 𝑣⟩ → {𝑧} = {⟨𝑢, 𝑣⟩})
15 cnveq 5851 . . . . . . . . . . 11 ({𝑧} = {⟨𝑢, 𝑣⟩} → ◡{𝑧} = ◡{⟨𝑢, 𝑣⟩})
16 vex 3455 . . . . . . . . . . . 12 𝑢 ∈ V
17 vex 3455 . . . . . . . . . . . 12 𝑣 ∈ V
1816, 17cnvsn 6228 . . . . . . . . . . 11 ◡{⟨𝑢, 𝑣⟩} = {⟨𝑣, 𝑢⟩}
1915, 18eqtrdi 2812 . . . . . . . . . 10 ({𝑧} = {⟨𝑢, 𝑣⟩} → ◡{𝑧} = {⟨𝑣, 𝑢⟩})
2014, 19syl 18 . . . . . . . . 9 (𝑧 = ⟨𝑢, 𝑣⟩ → ◡{𝑧} = {⟨𝑣, 𝑢⟩})
21 snfi 9072 . . . . . . . . 9 {⟨𝑣, 𝑢⟩} ∈ Fin
2220, 21eqeltrdi 2869 . . . . . . . 8 (𝑧 = ⟨𝑢, 𝑣⟩ → ◡{𝑧} ∈ Fin)
2322exlimivv 1965 . . . . . . 7 (∃𝑢∃𝑣 𝑧 = ⟨𝑢, 𝑣⟩ → ◡{𝑧} ∈ Fin)
2413, 23sylbi 220 . . . . . 6 (𝑧 ∈ (V × V) → ◡{𝑧} ∈ Fin)
25 dfdm4 5877 . . . . . . . . 9 dom {𝑧} = ran ◡{𝑧}
26 dmsnn0 6209 . . . . . . . . . . 11 (𝑧 ∈ (V × V) ↔ dom {𝑧} ≠ ∅)
2726biimpri 231 . . . . . . . . . 10 (dom {𝑧} ≠ ∅ → 𝑧 ∈ (V × V))
2827necon1bi 2984 . . . . . . . . 9 (¬ 𝑧 ∈ (V × V) → dom {𝑧} = ∅)
2925, 28eqtr3id 2810 . . . . . . . 8 (¬ 𝑧 ∈ (V × V) → ran ◡{𝑧} = ∅)
30 relcnv 6100 . . . . . . . . 9 Rel ◡{𝑧}
31 relrn0 5955 . . . . . . . . 9 (Rel ◡{𝑧} → (◡{𝑧} = ∅ ↔ ran ◡{𝑧} = ∅))
3230, 31ax-mp 5 . . . . . . . 8 (◡{𝑧} = ∅ ↔ ran ◡{𝑧} = ∅)
3329, 32sylibr 237 . . . . . . 7 (¬ 𝑧 ∈ (V × V) → ◡{𝑧} = ∅)
3433, 10eqeltrdi 2869 . . . . . 6 (¬ 𝑧 ∈ (V × V) → ◡{𝑧} ∈ Fin)
3524, 34pm2.61i 184 . . . . 5 ◡{𝑧} ∈ Fin
36 unfi 9187 . . . . 5 ((◡𝑦 ∈ Fin ∧ ◡{𝑧} ∈ Fin) → (◡𝑦 ∪ ◡{𝑧}) ∈ Fin)
3735, 36mpan2 704 . . . 4 (◡𝑦 ∈ Fin → (◡𝑦 ∪ ◡{𝑧}) ∈ Fin)
3812, 37eqeltrid 2865 . . 3 (◡𝑦 ∈ Fin → ◡(𝑦 ∪ {𝑧}) ∈ Fin)
3938a1i 11 . 2 (𝑦 ∈ Fin → (◡𝑦 ∈ Fin → ◡(𝑦 ∪ {𝑧}) ∈ Fin))
402, 4, 6, 8, 11, 39findcard2 9181 1 (𝐴 ∈ Fin → ◡𝐴 ∈ Fin)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   = wceq 1570  ∃wex 1812   ∈ wcel 2145   ≠ wne 2956  Vcvv 3451   ∪ cun 3897  ∅c0 4279  {csn 4584  ⟨cop 4590   × cxp 5649  ◡ccnv 5650  dom cdm 5651  ran crn 5652  Rel wrel 5656  Fincfn 8974
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pr 5391  ax-un 7752
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-dif 3900  df-un 3902  df-in 3904  df-ss 3915  df-pss 4035  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-tr 5213  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-ord 6366  df-on 6367  df-lim 6368  df-suc 6369  df-iota 6495  df-fun 6541  df-fn 6542  df-f 6543  df-f1 6544  df-fo 6545  df-f1o 6546  df-fv 6547  df-om 7879  df-1o 8477  df-en 8975  df-fin 8978
This theorem is used by:  f1oenfirn  9196  f1domfi  9197  sbthfilem  9214  fodomfir  9320  rnfi  9330  fsumcnv  15940  fprodcnv  16151  gsumcom3  20193  gsummpt2co  33610  gsumhashmul  33629
  Copyright terms: Public domain W3C validator