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

Theorem enfiALT 9152
Description: Shorter proof of enfi 9151 using ax-pow 5320. (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 9081 . . 3 (𝐴𝐵 → (𝐴𝑥𝐵𝑥))
21rexbidv 3157 . 2 (𝐴𝐵 → (∃𝑥 ∈ ω 𝐴𝑥 ↔ ∃𝑥 ∈ ω 𝐵𝑥))
3 isfi 8947 . 2 (𝐴 ∈ Fin ↔ ∃𝑥 ∈ ω 𝐴𝑥)
4 isfi 8947 . 2 (𝐵 ∈ Fin ↔ ∃𝑥 ∈ ω 𝐵𝑥)
52, 3, 43bitr4g 314 1 (𝐴𝐵 → (𝐴 ∈ Fin ↔ 𝐵 ∈ Fin))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wcel 2109  wrex 3053   class class class wbr 5107  ωcom 7842  cen 8915  Fincfn 8918
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-sep 5251  ax-nul 5261  ax-pow 5320  ax-pr 5387  ax-un 7711
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ral 3045  df-rex 3054  df-rab 3406  df-v 3449  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-nul 4297  df-if 4489  df-pw 4565  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-br 5108  df-opab 5170  df-id 5533  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-res 5650  df-ima 5651  df-fun 6513  df-fn 6514  df-f 6515  df-f1 6516  df-fo 6517  df-f1o 6518  df-er 8671  df-en 8919  df-fin 8922
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator