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

Theorem ssfin2 10233
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 772 . . . 4 (((𝐴 ∈ FinII𝐵𝐴) ∧ 𝑥 ∈ 𝒫 𝒫 𝐵) → 𝐴 ∈ FinII)
2 elpwi 4536 . . . . . 6 (𝑥 ∈ 𝒫 𝒫 𝐵𝑥 ⊆ 𝒫 𝐵)
32adantl 482 . . . . 5 (((𝐴 ∈ FinII𝐵𝐴) ∧ 𝑥 ∈ 𝒫 𝒫 𝐵) → 𝑥 ⊆ 𝒫 𝐵)
4 simplr 774 . . . . . 6 (((𝐴 ∈ FinII𝐵𝐴) ∧ 𝑥 ∈ 𝒫 𝒫 𝐵) → 𝐵𝐴)
54sspwd 4542 . . . . 5 (((𝐴 ∈ FinII𝐵𝐴) ∧ 𝑥 ∈ 𝒫 𝒫 𝐵) → 𝒫 𝐵 ⊆ 𝒫 𝐴)
63, 5sstrd 3925 . . . 4 (((𝐴 ∈ FinII𝐵𝐴) ∧ 𝑥 ∈ 𝒫 𝒫 𝐵) → 𝑥 ⊆ 𝒫 𝐴)
7 fin2i 10208 . . . . 5 (((𝐴 ∈ FinII𝑥 ⊆ 𝒫 𝐴) ∧ (𝑥 ≠ ∅ ∧ [] Or 𝑥)) → 𝑥𝑥)
87ex 413 . . . 4 ((𝐴 ∈ FinII𝑥 ⊆ 𝒫 𝐴) → ((𝑥 ≠ ∅ ∧ [] Or 𝑥) → 𝑥𝑥))
91, 6, 8syl2anc 590 . . 3 (((𝐴 ∈ FinII𝐵𝐴) ∧ 𝑥 ∈ 𝒫 𝒫 𝐵) → ((𝑥 ≠ ∅ ∧ [] Or 𝑥) → 𝑥𝑥))
109ralrimiva 3131 . 2 ((𝐴 ∈ FinII𝐵𝐴) → ∀𝑥 ∈ 𝒫 𝒫 𝐵((𝑥 ≠ ∅ ∧ [] Or 𝑥) → 𝑥𝑥))
11 ssexg 5251 . . . 4 ((𝐵𝐴𝐴 ∈ FinII) → 𝐵 ∈ V)
1211ancoms 459 . . 3 ((𝐴 ∈ FinII𝐵𝐴) → 𝐵 ∈ V)
13 isfin2 10207 . . 3 (𝐵 ∈ V → (𝐵 ∈ FinII ↔ ∀𝑥 ∈ 𝒫 𝒫 𝐵((𝑥 ≠ ∅ ∧ [] Or 𝑥) → 𝑥𝑥)))
1412, 13syl 17 . 2 ((𝐴 ∈ FinII𝐵𝐴) → (𝐵 ∈ FinII ↔ ∀𝑥 ∈ 𝒫 𝒫 𝐵((𝑥 ≠ ∅ ∧ [] Or 𝑥) → 𝑥𝑥)))
1510, 14mpbird 258 1 ((𝐴 ∈ FinII𝐵𝐴) → 𝐵 ∈ FinII)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 207  wa 396  wcel 2119  wne 2934  wral 3053  Vcvv 3431  wss 3883  c0 4261  𝒫 cpw 4529   cuni 4838   Or wor 5525   [] crpss 7665  FinIIcfin2 10192
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-ext 2711  ax-sep 5218  ax-pow 5294
This theorem depends on definitions:  df-bi 208  df-an 397  df-3an 1094  df-tru 1550  df-ex 1787  df-sb 2074  df-clab 2718  df-cleq 2731  df-clel 2814  df-ne 2935  df-ral 3054  df-rex 3064  df-rab 3392  df-v 3433  df-in 3890  df-ss 3900  df-pw 4531  df-uni 4839  df-po 5526  df-so 5527  df-fin2 10199
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator