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

Theorem isfin2-2 10260
Description: FinII expressed in terms of minimal elements. (Contributed by Stefan O'Rear, 2-Nov-2014.) (Proof shortened by Mario Carneiro, 16-May-2015.)
Assertion
Ref Expression
isfin2-2 (𝐴𝑉 → (𝐴 ∈ FinII ↔ ∀𝑦 ∈ 𝒫 𝒫 𝐴((𝑦 ≠ ∅ ∧ [] Or 𝑦) → 𝑦𝑦)))
Distinct variable group:   𝑦,𝐴
Allowed substitution hint:   𝑉(𝑦)

Proof of Theorem isfin2-2
Dummy variables 𝑏 𝑐 𝑚 𝑛 𝑤 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 elpwi 4568 . . . 4 (𝑦 ∈ 𝒫 𝒫 𝐴𝑦 ⊆ 𝒫 𝐴)
2 fin2i2 10259 . . . . 5 (((𝐴 ∈ FinII𝑦 ⊆ 𝒫 𝐴) ∧ (𝑦 ≠ ∅ ∧ [] Or 𝑦)) → 𝑦𝑦)
32ex 414 . . . 4 ((𝐴 ∈ FinII𝑦 ⊆ 𝒫 𝐴) → ((𝑦 ≠ ∅ ∧ [] Or 𝑦) → 𝑦𝑦))
41, 3sylan2 594 . . 3 ((𝐴 ∈ FinII𝑦 ∈ 𝒫 𝒫 𝐴) → ((𝑦 ≠ ∅ ∧ [] Or 𝑦) → 𝑦𝑦))
54ralrimiva 3140 . 2 (𝐴 ∈ FinII → ∀𝑦 ∈ 𝒫 𝒫 𝐴((𝑦 ≠ ∅ ∧ [] Or 𝑦) → 𝑦𝑦))
6 elpwi 4568 . . . . 5 (𝑏 ∈ 𝒫 𝒫 𝐴𝑏 ⊆ 𝒫 𝐴)
7 simp1r 1199 . . . . . . . 8 (((𝐴𝑉𝑏 ⊆ 𝒫 𝐴) ∧ ∀𝑦 ∈ 𝒫 𝒫 𝐴((𝑦 ≠ ∅ ∧ [] Or 𝑦) → 𝑦𝑦) ∧ (𝑏 ≠ ∅ ∧ [] Or 𝑏)) → 𝑏 ⊆ 𝒫 𝐴)
8 simp1l 1198 . . . . . . . . . . 11 (((𝐴𝑉𝑏 ⊆ 𝒫 𝐴) ∧ ∀𝑦 ∈ 𝒫 𝒫 𝐴((𝑦 ≠ ∅ ∧ [] Or 𝑦) → 𝑦𝑦) ∧ (𝑏 ≠ ∅ ∧ [] Or 𝑏)) → 𝐴𝑉)
9 simp3l 1202 . . . . . . . . . . 11 (((𝐴𝑉𝑏 ⊆ 𝒫 𝐴) ∧ ∀𝑦 ∈ 𝒫 𝒫 𝐴((𝑦 ≠ ∅ ∧ [] Or 𝑦) → 𝑦𝑦) ∧ (𝑏 ≠ ∅ ∧ [] Or 𝑏)) → 𝑏 ≠ ∅)
10 fin23lem7 10257 . . . . . . . . . . 11 ((𝐴𝑉𝑏 ⊆ 𝒫 𝐴𝑏 ≠ ∅) → {𝑐 ∈ 𝒫 𝐴 ∣ (𝐴𝑐) ∈ 𝑏} ≠ ∅)
118, 7, 9, 10syl3anc 1372 . . . . . . . . . 10 (((𝐴𝑉𝑏 ⊆ 𝒫 𝐴) ∧ ∀𝑦 ∈ 𝒫 𝒫 𝐴((𝑦 ≠ ∅ ∧ [] Or 𝑦) → 𝑦𝑦) ∧ (𝑏 ≠ ∅ ∧ [] Or 𝑏)) → {𝑐 ∈ 𝒫 𝐴 ∣ (𝐴𝑐) ∈ 𝑏} ≠ ∅)
12 sorpsscmpl 7672 . . . . . . . . . . . 12 ( [] Or 𝑏 → [] Or {𝑐 ∈ 𝒫 𝐴 ∣ (𝐴𝑐) ∈ 𝑏})
1312adantl 483 . . . . . . . . . . 11 ((𝑏 ≠ ∅ ∧ [] Or 𝑏) → [] Or {𝑐 ∈ 𝒫 𝐴 ∣ (𝐴𝑐) ∈ 𝑏})
14133ad2ant3 1136 . . . . . . . . . 10 (((𝐴𝑉𝑏 ⊆ 𝒫 𝐴) ∧ ∀𝑦 ∈ 𝒫 𝒫 𝐴((𝑦 ≠ ∅ ∧ [] Or 𝑦) → 𝑦𝑦) ∧ (𝑏 ≠ ∅ ∧ [] Or 𝑏)) → [] Or {𝑐 ∈ 𝒫 𝐴 ∣ (𝐴𝑐) ∈ 𝑏})
15 neeq1 3003 . . . . . . . . . . . . 13 (𝑦 = {𝑐 ∈ 𝒫 𝐴 ∣ (𝐴𝑐) ∈ 𝑏} → (𝑦 ≠ ∅ ↔ {𝑐 ∈ 𝒫 𝐴 ∣ (𝐴𝑐) ∈ 𝑏} ≠ ∅))
16 soeq2 5568 . . . . . . . . . . . . 13 (𝑦 = {𝑐 ∈ 𝒫 𝐴 ∣ (𝐴𝑐) ∈ 𝑏} → ( [] Or 𝑦 ↔ [] Or {𝑐 ∈ 𝒫 𝐴 ∣ (𝐴𝑐) ∈ 𝑏}))
1715, 16anbi12d 632 . . . . . . . . . . . 12 (𝑦 = {𝑐 ∈ 𝒫 𝐴 ∣ (𝐴𝑐) ∈ 𝑏} → ((𝑦 ≠ ∅ ∧ [] Or 𝑦) ↔ ({𝑐 ∈ 𝒫 𝐴 ∣ (𝐴𝑐) ∈ 𝑏} ≠ ∅ ∧ [] Or {𝑐 ∈ 𝒫 𝐴 ∣ (𝐴𝑐) ∈ 𝑏})))
18 inteq 4911 . . . . . . . . . . . . 13 (𝑦 = {𝑐 ∈ 𝒫 𝐴 ∣ (𝐴𝑐) ∈ 𝑏} → 𝑦 = {𝑐 ∈ 𝒫 𝐴 ∣ (𝐴𝑐) ∈ 𝑏})
19 id 22 . . . . . . . . . . . . 13 (𝑦 = {𝑐 ∈ 𝒫 𝐴 ∣ (𝐴𝑐) ∈ 𝑏} → 𝑦 = {𝑐 ∈ 𝒫 𝐴 ∣ (𝐴𝑐) ∈ 𝑏})
2018, 19eleq12d 2828 . . . . . . . . . . . 12 (𝑦 = {𝑐 ∈ 𝒫 𝐴 ∣ (𝐴𝑐) ∈ 𝑏} → ( 𝑦𝑦 {𝑐 ∈ 𝒫 𝐴 ∣ (𝐴𝑐) ∈ 𝑏} ∈ {𝑐 ∈ 𝒫 𝐴 ∣ (𝐴𝑐) ∈ 𝑏}))
2117, 20imbi12d 345 . . . . . . . . . . 11 (𝑦 = {𝑐 ∈ 𝒫 𝐴 ∣ (𝐴𝑐) ∈ 𝑏} → (((𝑦 ≠ ∅ ∧ [] Or 𝑦) → 𝑦𝑦) ↔ (({𝑐 ∈ 𝒫 𝐴 ∣ (𝐴𝑐) ∈ 𝑏} ≠ ∅ ∧ [] Or {𝑐 ∈ 𝒫 𝐴 ∣ (𝐴𝑐) ∈ 𝑏}) → {𝑐 ∈ 𝒫 𝐴 ∣ (𝐴𝑐) ∈ 𝑏} ∈ {𝑐 ∈ 𝒫 𝐴 ∣ (𝐴𝑐) ∈ 𝑏})))
22 simp2 1138 . . . . . . . . . . 11 (((𝐴𝑉𝑏 ⊆ 𝒫 𝐴) ∧ ∀𝑦 ∈ 𝒫 𝒫 𝐴((𝑦 ≠ ∅ ∧ [] Or 𝑦) → 𝑦𝑦) ∧ (𝑏 ≠ ∅ ∧ [] Or 𝑏)) → ∀𝑦 ∈ 𝒫 𝒫 𝐴((𝑦 ≠ ∅ ∧ [] Or 𝑦) → 𝑦𝑦))
23 ssrab2 4038 . . . . . . . . . . . 12 {𝑐 ∈ 𝒫 𝐴 ∣ (𝐴𝑐) ∈ 𝑏} ⊆ 𝒫 𝐴
24 pwexg 5334 . . . . . . . . . . . . 13 (𝐴𝑉 → 𝒫 𝐴 ∈ V)
25 elpw2g 5302 . . . . . . . . . . . . 13 (𝒫 𝐴 ∈ V → ({𝑐 ∈ 𝒫 𝐴 ∣ (𝐴𝑐) ∈ 𝑏} ∈ 𝒫 𝒫 𝐴 ↔ {𝑐 ∈ 𝒫 𝐴 ∣ (𝐴𝑐) ∈ 𝑏} ⊆ 𝒫 𝐴))
268, 24, 253syl 18 . . . . . . . . . . . 12 (((𝐴𝑉𝑏 ⊆ 𝒫 𝐴) ∧ ∀𝑦 ∈ 𝒫 𝒫 𝐴((𝑦 ≠ ∅ ∧ [] Or 𝑦) → 𝑦𝑦) ∧ (𝑏 ≠ ∅ ∧ [] Or 𝑏)) → ({𝑐 ∈ 𝒫 𝐴 ∣ (𝐴𝑐) ∈ 𝑏} ∈ 𝒫 𝒫 𝐴 ↔ {𝑐 ∈ 𝒫 𝐴 ∣ (𝐴𝑐) ∈ 𝑏} ⊆ 𝒫 𝐴))
2723, 26mpbiri 258 . . . . . . . . . . 11 (((𝐴𝑉𝑏 ⊆ 𝒫 𝐴) ∧ ∀𝑦 ∈ 𝒫 𝒫 𝐴((𝑦 ≠ ∅ ∧ [] Or 𝑦) → 𝑦𝑦) ∧ (𝑏 ≠ ∅ ∧ [] Or 𝑏)) → {𝑐 ∈ 𝒫 𝐴 ∣ (𝐴𝑐) ∈ 𝑏} ∈ 𝒫 𝒫 𝐴)
2821, 22, 27rspcdva 3581 . . . . . . . . . 10 (((𝐴𝑉𝑏 ⊆ 𝒫 𝐴) ∧ ∀𝑦 ∈ 𝒫 𝒫 𝐴((𝑦 ≠ ∅ ∧ [] Or 𝑦) → 𝑦𝑦) ∧ (𝑏 ≠ ∅ ∧ [] Or 𝑏)) → (({𝑐 ∈ 𝒫 𝐴 ∣ (𝐴𝑐) ∈ 𝑏} ≠ ∅ ∧ [] Or {𝑐 ∈ 𝒫 𝐴 ∣ (𝐴𝑐) ∈ 𝑏}) → {𝑐 ∈ 𝒫 𝐴 ∣ (𝐴𝑐) ∈ 𝑏} ∈ {𝑐 ∈ 𝒫 𝐴 ∣ (𝐴𝑐) ∈ 𝑏}))
2911, 14, 28mp2and 698 . . . . . . . . 9 (((𝐴𝑉𝑏 ⊆ 𝒫 𝐴) ∧ ∀𝑦 ∈ 𝒫 𝒫 𝐴((𝑦 ≠ ∅ ∧ [] Or 𝑦) → 𝑦𝑦) ∧ (𝑏 ≠ ∅ ∧ [] Or 𝑏)) → {𝑐 ∈ 𝒫 𝐴 ∣ (𝐴𝑐) ∈ 𝑏} ∈ {𝑐 ∈ 𝒫 𝐴 ∣ (𝐴𝑐) ∈ 𝑏})
30 sorpssint 7671 . . . . . . . . . 10 ( [] Or {𝑐 ∈ 𝒫 𝐴 ∣ (𝐴𝑐) ∈ 𝑏} → (∃𝑧 ∈ {𝑐 ∈ 𝒫 𝐴 ∣ (𝐴𝑐) ∈ 𝑏}∀𝑤 ∈ {𝑐 ∈ 𝒫 𝐴 ∣ (𝐴𝑐) ∈ 𝑏} ¬ 𝑤𝑧 {𝑐 ∈ 𝒫 𝐴 ∣ (𝐴𝑐) ∈ 𝑏} ∈ {𝑐 ∈ 𝒫 𝐴 ∣ (𝐴𝑐) ∈ 𝑏}))
3114, 30syl 17 . . . . . . . . 9 (((𝐴𝑉𝑏 ⊆ 𝒫 𝐴) ∧ ∀𝑦 ∈ 𝒫 𝒫 𝐴((𝑦 ≠ ∅ ∧ [] Or 𝑦) → 𝑦𝑦) ∧ (𝑏 ≠ ∅ ∧ [] Or 𝑏)) → (∃𝑧 ∈ {𝑐 ∈ 𝒫 𝐴 ∣ (𝐴𝑐) ∈ 𝑏}∀𝑤 ∈ {𝑐 ∈ 𝒫 𝐴 ∣ (𝐴𝑐) ∈ 𝑏} ¬ 𝑤𝑧 {𝑐 ∈ 𝒫 𝐴 ∣ (𝐴𝑐) ∈ 𝑏} ∈ {𝑐 ∈ 𝒫 𝐴 ∣ (𝐴𝑐) ∈ 𝑏}))
3229, 31mpbird 257 . . . . . . . 8 (((𝐴𝑉𝑏 ⊆ 𝒫 𝐴) ∧ ∀𝑦 ∈ 𝒫 𝒫 𝐴((𝑦 ≠ ∅ ∧ [] Or 𝑦) → 𝑦𝑦) ∧ (𝑏 ≠ ∅ ∧ [] Or 𝑏)) → ∃𝑧 ∈ {𝑐 ∈ 𝒫 𝐴 ∣ (𝐴𝑐) ∈ 𝑏}∀𝑤 ∈ {𝑐 ∈ 𝒫 𝐴 ∣ (𝐴𝑐) ∈ 𝑏} ¬ 𝑤𝑧)
33 psseq1 4048 . . . . . . . . 9 (𝑚 = (𝐴𝑧) → (𝑚𝑛 ↔ (𝐴𝑧) ⊊ 𝑛))
34 psseq1 4048 . . . . . . . . 9 (𝑤 = (𝐴𝑛) → (𝑤𝑧 ↔ (𝐴𝑛) ⊊ 𝑧))
35 pssdifcom1 4448 . . . . . . . . 9 ((𝑧𝐴𝑛𝐴) → ((𝐴𝑧) ⊊ 𝑛 ↔ (𝐴𝑛) ⊊ 𝑧))
3633, 34, 35fin23lem11 10258 . . . . . . . 8 (𝑏 ⊆ 𝒫 𝐴 → (∃𝑧 ∈ {𝑐 ∈ 𝒫 𝐴 ∣ (𝐴𝑐) ∈ 𝑏}∀𝑤 ∈ {𝑐 ∈ 𝒫 𝐴 ∣ (𝐴𝑐) ∈ 𝑏} ¬ 𝑤𝑧 → ∃𝑚𝑏𝑛𝑏 ¬ 𝑚𝑛))
377, 32, 36sylc 65 . . . . . . 7 (((𝐴𝑉𝑏 ⊆ 𝒫 𝐴) ∧ ∀𝑦 ∈ 𝒫 𝒫 𝐴((𝑦 ≠ ∅ ∧ [] Or 𝑦) → 𝑦𝑦) ∧ (𝑏 ≠ ∅ ∧ [] Or 𝑏)) → ∃𝑚𝑏𝑛𝑏 ¬ 𝑚𝑛)
38 simp3r 1203 . . . . . . . 8 (((𝐴𝑉𝑏 ⊆ 𝒫 𝐴) ∧ ∀𝑦 ∈ 𝒫 𝒫 𝐴((𝑦 ≠ ∅ ∧ [] Or 𝑦) → 𝑦𝑦) ∧ (𝑏 ≠ ∅ ∧ [] Or 𝑏)) → [] Or 𝑏)
39 sorpssuni 7670 . . . . . . . 8 ( [] Or 𝑏 → (∃𝑚𝑏𝑛𝑏 ¬ 𝑚𝑛 𝑏𝑏))
4038, 39syl 17 . . . . . . 7 (((𝐴𝑉𝑏 ⊆ 𝒫 𝐴) ∧ ∀𝑦 ∈ 𝒫 𝒫 𝐴((𝑦 ≠ ∅ ∧ [] Or 𝑦) → 𝑦𝑦) ∧ (𝑏 ≠ ∅ ∧ [] Or 𝑏)) → (∃𝑚𝑏𝑛𝑏 ¬ 𝑚𝑛 𝑏𝑏))
4137, 40mpbid 231 . . . . . 6 (((𝐴𝑉𝑏 ⊆ 𝒫 𝐴) ∧ ∀𝑦 ∈ 𝒫 𝒫 𝐴((𝑦 ≠ ∅ ∧ [] Or 𝑦) → 𝑦𝑦) ∧ (𝑏 ≠ ∅ ∧ [] Or 𝑏)) → 𝑏𝑏)
42413exp 1120 . . . . 5 ((𝐴𝑉𝑏 ⊆ 𝒫 𝐴) → (∀𝑦 ∈ 𝒫 𝒫 𝐴((𝑦 ≠ ∅ ∧ [] Or 𝑦) → 𝑦𝑦) → ((𝑏 ≠ ∅ ∧ [] Or 𝑏) → 𝑏𝑏)))
436, 42sylan2 594 . . . 4 ((𝐴𝑉𝑏 ∈ 𝒫 𝒫 𝐴) → (∀𝑦 ∈ 𝒫 𝒫 𝐴((𝑦 ≠ ∅ ∧ [] Or 𝑦) → 𝑦𝑦) → ((𝑏 ≠ ∅ ∧ [] Or 𝑏) → 𝑏𝑏)))
4443ralrimdva 3148 . . 3 (𝐴𝑉 → (∀𝑦 ∈ 𝒫 𝒫 𝐴((𝑦 ≠ ∅ ∧ [] Or 𝑦) → 𝑦𝑦) → ∀𝑏 ∈ 𝒫 𝒫 𝐴((𝑏 ≠ ∅ ∧ [] Or 𝑏) → 𝑏𝑏)))
45 isfin2 10235 . . 3 (𝐴𝑉 → (𝐴 ∈ FinII ↔ ∀𝑏 ∈ 𝒫 𝒫 𝐴((𝑏 ≠ ∅ ∧ [] Or 𝑏) → 𝑏𝑏)))
4644, 45sylibrd 259 . 2 (𝐴𝑉 → (∀𝑦 ∈ 𝒫 𝒫 𝐴((𝑦 ≠ ∅ ∧ [] Or 𝑦) → 𝑦𝑦) → 𝐴 ∈ FinII))
475, 46impbid2 225 1 (𝐴𝑉 → (𝐴 ∈ FinII ↔ ∀𝑦 ∈ 𝒫 𝒫 𝐴((𝑦 ≠ ∅ ∧ [] Or 𝑦) → 𝑦𝑦)))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 205  wa 397  w3a 1088   = wceq 1542  wcel 2107  wne 2940  wral 3061  wrex 3070  {crab 3406  Vcvv 3444  cdif 3908  wss 3911  wpss 3912  c0 4283  𝒫 cpw 4561   cuni 4866   cint 4908   Or wor 5545   [] crpss 7660  FinIIcfin2 10220
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-10 2138  ax-11 2155  ax-12 2172  ax-ext 2704  ax-sep 5257  ax-nul 5264  ax-pow 5321  ax-pr 5385  ax-un 7673
This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-3or 1089  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1783  df-nf 1787  df-sb 2069  df-clab 2711  df-cleq 2725  df-clel 2811  df-ne 2941  df-ral 3062  df-rex 3071  df-rab 3407  df-v 3446  df-dif 3914  df-un 3916  df-in 3918  df-ss 3928  df-pss 3930  df-nul 4284  df-if 4488  df-pw 4563  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4867  df-int 4909  df-br 5107  df-opab 5169  df-po 5546  df-so 5547  df-xp 5640  df-rel 5641  df-rpss 7661  df-fin2 10227
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator