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

Theorem ssfin2 10315
Description: A subset of a II-finite set is II-finite. (Contributed by Stefan O'Rear, 2-Nov-2014.) (Revised by Mario Carneiro, 16-May-2015.)
Assertion
Ref Expression
ssfin2 ((𝐴 ∈ FinII𝐵𝐴) → 𝐵 ∈ FinII)

Proof of Theorem ssfin2
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 simpll 766 . . . 4 (((𝐴 ∈ FinII𝐵𝐴) ∧ 𝑥 ∈ 𝒫 𝒫 𝐵) → 𝐴 ∈ FinII)
2 elpwi 4610 . . . . . 6 (𝑥 ∈ 𝒫 𝒫 𝐵𝑥 ⊆ 𝒫 𝐵)
32adantl 483 . . . . 5 (((𝐴 ∈ FinII𝐵𝐴) ∧ 𝑥 ∈ 𝒫 𝒫 𝐵) → 𝑥 ⊆ 𝒫 𝐵)
4 simplr 768 . . . . . 6 (((𝐴 ∈ FinII𝐵𝐴) ∧ 𝑥 ∈ 𝒫 𝒫 𝐵) → 𝐵𝐴)
54sspwd 4616 . . . . 5 (((𝐴 ∈ FinII𝐵𝐴) ∧ 𝑥 ∈ 𝒫 𝒫 𝐵) → 𝒫 𝐵 ⊆ 𝒫 𝐴)
63, 5sstrd 3993 . . . 4 (((𝐴 ∈ FinII𝐵𝐴) ∧ 𝑥 ∈ 𝒫 𝒫 𝐵) → 𝑥 ⊆ 𝒫 𝐴)
7 fin2i 10290 . . . . 5 (((𝐴 ∈ FinII𝑥 ⊆ 𝒫 𝐴) ∧ (𝑥 ≠ ∅ ∧ [] Or 𝑥)) → 𝑥𝑥)
87ex 414 . . . 4 ((𝐴 ∈ FinII𝑥 ⊆ 𝒫 𝐴) → ((𝑥 ≠ ∅ ∧ [] Or 𝑥) → 𝑥𝑥))
91, 6, 8syl2anc 585 . . 3 (((𝐴 ∈ FinII𝐵𝐴) ∧ 𝑥 ∈ 𝒫 𝒫 𝐵) → ((𝑥 ≠ ∅ ∧ [] Or 𝑥) → 𝑥𝑥))
109ralrimiva 3147 . 2 ((𝐴 ∈ FinII𝐵𝐴) → ∀𝑥 ∈ 𝒫 𝒫 𝐵((𝑥 ≠ ∅ ∧ [] Or 𝑥) → 𝑥𝑥))
11 ssexg 5324 . . . 4 ((𝐵𝐴𝐴 ∈ FinII) → 𝐵 ∈ V)
1211ancoms 460 . . 3 ((𝐴 ∈ FinII𝐵𝐴) → 𝐵 ∈ V)
13 isfin2 10289 . . 3 (𝐵 ∈ V → (𝐵 ∈ FinII ↔ ∀𝑥 ∈ 𝒫 𝒫 𝐵((𝑥 ≠ ∅ ∧ [] Or 𝑥) → 𝑥𝑥)))
1412, 13syl 17 . 2 ((𝐴 ∈ FinII𝐵𝐴) → (𝐵 ∈ FinII ↔ ∀𝑥 ∈ 𝒫 𝒫 𝐵((𝑥 ≠ ∅ ∧ [] Or 𝑥) → 𝑥𝑥)))
1510, 14mpbird 257 1 ((𝐴 ∈ FinII𝐵𝐴) → 𝐵 ∈ FinII)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 397  wcel 2107  wne 2941  wral 3062  Vcvv 3475  wss 3949  c0 4323  𝒫 cpw 4603   cuni 4909   Or wor 5588   [] crpss 7712  FinIIcfin2 10274
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-ext 2704  ax-sep 5300  ax-pow 5364
This theorem depends on definitions:  df-bi 206  df-an 398  df-tru 1545  df-ex 1783  df-sb 2069  df-clab 2711  df-cleq 2725  df-clel 2811  df-ne 2942  df-ral 3063  df-rex 3072  df-rab 3434  df-v 3477  df-in 3956  df-ss 3966  df-pw 4605  df-uni 4910  df-po 5589  df-so 5590  df-fin2 10281
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator