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

Theorem isfin1a 10297
Description: Definition of a Ia-finite set. (Contributed by Stefan O'Rear, 16-May-2015.)
Assertion
Ref Expression
isfin1a (𝐴𝑉 → (𝐴 ∈ FinIa ↔ ∀𝑦 ∈ 𝒫 𝐴(𝑦 ∈ Fin ∨ (𝐴𝑦) ∈ Fin)))
Distinct variable group:   𝑦,𝐴
Allowed substitution hint:   𝑉(𝑦)

Proof of Theorem isfin1a
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 pweq 4571 . . 3 (𝑥 = 𝐴 → 𝒫 𝑥 = 𝒫 𝐴)
2 difeq1 4067 . . . . 5 (𝑥 = 𝐴 → (𝑥𝑦) = (𝐴𝑦))
32eleq1d 2845 . . . 4 (𝑥 = 𝐴 → ((𝑥𝑦) ∈ Fin ↔ (𝐴𝑦) ∈ Fin))
43orbi2d 929 . . 3 (𝑥 = 𝐴 → ((𝑦 ∈ Fin ∨ (𝑥𝑦) ∈ Fin) ↔ (𝑦 ∈ Fin ∨ (𝐴𝑦) ∈ Fin)))
51, 4raleqbidv 3334 . 2 (𝑥 = 𝐴 → (∀𝑦 ∈ 𝒫 𝑥(𝑦 ∈ Fin ∨ (𝑥𝑦) ∈ Fin) ↔ ∀𝑦 ∈ 𝒫 𝐴(𝑦 ∈ Fin ∨ (𝐴𝑦) ∈ Fin)))
6 df-fin1a 10290 . 2 FinIa = {𝑥 ∣ ∀𝑦 ∈ 𝒫 𝑥(𝑦 ∈ Fin ∨ (𝑥𝑦) ∈ Fin)}
75, 6elab2g 3634 1 (𝐴𝑉 → (𝐴 ∈ FinIa ↔ ∀𝑦 ∈ 𝒫 𝐴(𝑦 ∈ Fin ∨ (𝐴𝑦) ∈ Fin)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wb 209  wo 861   = wceq 1570  wcel 2145  wral 3076  cdif 3896  𝒫 cpw 4557  Fincfn 8955  FinIacfin1a 10283
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-ext 2732
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-rab 3413  df-v 3452  df-dif 3902  df-ss 3916  df-pw 4559  df-fin1a 10290
This theorem is used by:  fin1ai  10298  fin11a  10388  enfin1ai  10389
  Copyright terms: Public domain W3C validator