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

Theorem fin1ai 10362
Description: Property of a Ia-finite set. (Contributed by Stefan O'Rear, 16-May-2015.)
Assertion
Ref Expression
fin1ai ((𝐴 ∈ FinIa𝑋𝐴) → (𝑋 ∈ Fin ∨ (𝐴𝑋) ∈ Fin))

Proof of Theorem fin1ai
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 eleq1 2832 . . 3 (𝑥 = 𝑋 → (𝑥 ∈ Fin ↔ 𝑋 ∈ Fin))
2 difeq2 4143 . . . 4 (𝑥 = 𝑋 → (𝐴𝑥) = (𝐴𝑋))
32eleq1d 2829 . . 3 (𝑥 = 𝑋 → ((𝐴𝑥) ∈ Fin ↔ (𝐴𝑋) ∈ Fin))
41, 3orbi12d 917 . 2 (𝑥 = 𝑋 → ((𝑥 ∈ Fin ∨ (𝐴𝑥) ∈ Fin) ↔ (𝑋 ∈ Fin ∨ (𝐴𝑋) ∈ Fin)))
5 isfin1a 10361 . . . 4 (𝐴 ∈ FinIa → (𝐴 ∈ FinIa ↔ ∀𝑥 ∈ 𝒫 𝐴(𝑥 ∈ Fin ∨ (𝐴𝑥) ∈ Fin)))
65ibi 267 . . 3 (𝐴 ∈ FinIa → ∀𝑥 ∈ 𝒫 𝐴(𝑥 ∈ Fin ∨ (𝐴𝑥) ∈ Fin))
76adantr 480 . 2 ((𝐴 ∈ FinIa𝑋𝐴) → ∀𝑥 ∈ 𝒫 𝐴(𝑥 ∈ Fin ∨ (𝐴𝑥) ∈ Fin))
8 elpw2g 5351 . . 3 (𝐴 ∈ FinIa → (𝑋 ∈ 𝒫 𝐴𝑋𝐴))
98biimpar 477 . 2 ((𝐴 ∈ FinIa𝑋𝐴) → 𝑋 ∈ 𝒫 𝐴)
104, 7, 9rspcdva 3636 1 ((𝐴 ∈ FinIa𝑋𝐴) → (𝑋 ∈ Fin ∨ (𝐴𝑋) ∈ Fin))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  wo 846   = wceq 1537  wcel 2108  wral 3067  cdif 3973  wss 3976  𝒫 cpw 4622  Fincfn 9003  FinIacfin1a 10347
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-ext 2711  ax-sep 5317
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-ex 1778  df-sb 2065  df-clab 2718  df-cleq 2732  df-clel 2819  df-ral 3068  df-rab 3444  df-v 3490  df-dif 3979  df-in 3983  df-ss 3993  df-pw 4624  df-fin1a 10354
This theorem is referenced by:  enfin1ai  10453  fin1a2  10484  fin1aufil  23961
  Copyright terms: Public domain W3C validator