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

Theorem enfiALT 9168
Description: Shorter proof of enfi 9167 using ax-pow 5334. (Contributed by NM, 22-Aug-2008.) (Proof modification is discouraged.) (New usage is discouraged.)
Assertion
Ref Expression
enfiALT (𝐴𝐵 → (𝐴 ∈ Fin ↔ 𝐵 ∈ Fin))

Proof of Theorem enfiALT
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 enen1 9101 . . 3 (𝐴𝐵 → (𝐴𝑥𝐵𝑥))
21rexbidv 3195 . 2 (𝐴𝐵 → (∃𝑥 ∈ ω 𝐴𝑥 ↔ ∃𝑥 ∈ ω 𝐵𝑥))
3 isfi 8968 . 2 (𝐴 ∈ Fin ↔ ∃𝑥 ∈ ω 𝐴𝑥)
4 isfi 8968 . 2 (𝐵 ∈ Fin ↔ ∃𝑥 ∈ ω 𝐵𝑥)
52, 3, 43bitr4g 317 1 (𝐴𝐵 → (𝐴 ∈ Fin ↔ 𝐵 ∈ Fin))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wcel 2149  wrex 3095   class class class wbr 5110  ωcom 7858  cen 8936  Fincfn 8939
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-sep 5258  ax-pow 5334  ax-pr 5402  ax-un 7730
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ral 3086  df-rex 3096  df-rab 3424  df-v 3465  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4874  df-br 5111  df-opab 5175  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-er 8690  df-en 8940  df-fin 8943
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator