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

Theorem ssfin2 10391
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 779 . . . 4 (((𝐴 ∈ FinII ∧ 𝐵 ⊆ 𝐴) ∧ 𝑥 ∈ 𝒫 𝒫 𝐵) → 𝐴 ∈ FinII)
2 elpwi 4564 . . . . . 6 (𝑥 ∈ 𝒫 𝒫 𝐵 → 𝑥 ⊆ 𝒫 𝐵)
32adantl 487 . . . . 5 (((𝐴 ∈ FinII ∧ 𝐵 ⊆ 𝐴) ∧ 𝑥 ∈ 𝒫 𝒫 𝐵) → 𝑥 ⊆ 𝒫 𝐵)
4 simplr 781 . . . . . 6 (((𝐴 ∈ FinII ∧ 𝐵 ⊆ 𝐴) ∧ 𝑥 ∈ 𝒫 𝒫 𝐵) → 𝐵 ⊆ 𝐴)
54sspwd 4570 . . . . 5 (((𝐴 ∈ FinII ∧ 𝐵 ⊆ 𝐴) ∧ 𝑥 ∈ 𝒫 𝒫 𝐵) → 𝒫 𝐵 ⊆ 𝒫 𝐴)
63, 5sstrd 3941 . . . 4 (((𝐴 ∈ FinII ∧ 𝐵 ⊆ 𝐴) ∧ 𝑥 ∈ 𝒫 𝒫 𝐵) → 𝑥 ⊆ 𝒫 𝐴)
7 fin2i 10366 . . . . 5 (((𝐴 ∈ FinII ∧ 𝑥 ⊆ 𝒫 𝐴) ∧ (𝑥 ≠ ∅ ∧ [⊊] Or 𝑥)) → ∪ 𝑥 ∈ 𝑥)
87ex 418 . . . 4 ((𝐴 ∈ FinII ∧ 𝑥 ⊆ 𝒫 𝐴) → ((𝑥 ≠ ∅ ∧ [⊊] Or 𝑥) → ∪ 𝑥 ∈ 𝑥))
91, 6, 8syl2anc 596 . . 3 (((𝐴 ∈ FinII ∧ 𝐵 ⊆ 𝐴) ∧ 𝑥 ∈ 𝒫 𝒫 𝐵) → ((𝑥 ≠ ∅ ∧ [⊊] Or 𝑥) → ∪ 𝑥 ∈ 𝑥))
109ralrimiva 3155 . 2 ((𝐴 ∈ FinII ∧ 𝐵 ⊆ 𝐴) → ∀𝑥 ∈ 𝒫 𝒫 𝐵((𝑥 ≠ ∅ ∧ [⊊] Or 𝑥) → ∪ 𝑥 ∈ 𝑥))
11 ssexg 5281 . . . 4 ((𝐵 ⊆ 𝐴 ∧ 𝐴 ∈ FinII) → 𝐵 ∈ V)
1211ancoms 464 . . 3 ((𝐴 ∈ FinII ∧ 𝐵 ⊆ 𝐴) → 𝐵 ∈ V)
13 isfin2 10365 . . 3 (𝐵 ∈ V → (𝐵 ∈ FinII ↔ ∀𝑥 ∈ 𝒫 𝒫 𝐵((𝑥 ≠ ∅ ∧ [⊊] Or 𝑥) → ∪ 𝑥 ∈ 𝑥)))
1412, 13syl 18 . 2 ((𝐴 ∈ FinII ∧ 𝐵 ⊆ 𝐴) → (𝐵 ∈ FinII ↔ ∀𝑥 ∈ 𝒫 𝒫 𝐵((𝑥 ≠ ∅ ∧ [⊊] Or 𝑥) → ∪ 𝑥 ∈ 𝑥)))
1510, 14mpbird 260 1 ((𝐴 ∈ FinII ∧ 𝐵 ⊆ 𝐴) → 𝐵 ∈ FinII)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∈ wcel 2145   ≠ wne 2956  ∀wral 3077  Vcvv 3451   ⊆ wss 3899  ∅c0 4279  𝒫 cpw 4557  ∪ cuni 4867   Or wor 5558   [⊊] crpss 7736  FinIIcfin2 10350
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 2733  ax-sep 5249  ax-pow 5327
This proof depends on definitions:  df-bi 210  df-an 402  df-3an 1105  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-in 3906  df-ss 3916  df-pw 4559  df-uni 4868  df-po 5559  df-so 5560  df-fin2 10357
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator