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

Theorem fin23lem41 10389
Description: Lemma for fin23 10426. A set which satisfies the descending sequence condition must be III-finite. (Contributed by Stefan O'Rear, 2-Nov-2014.)
Hypothesis
Ref Expression
fin23lem40.f 𝐹 = {𝑔 ∣ ∀𝑎 ∈ (𝒫 𝑔m ω)(∀𝑥 ∈ ω (𝑎‘suc 𝑥) ⊆ (𝑎𝑥) → ran 𝑎 ∈ ran 𝑎)}
Assertion
Ref Expression
fin23lem41 (𝐴𝐹𝐴 ∈ FinIII)
Distinct variable groups:   𝑔,𝑎,𝑥,𝐴   𝐹,𝑎
Allowed substitution hints:   𝐹(𝑥,𝑔)

Proof of Theorem fin23lem41
Dummy variables 𝑏 𝑐 𝑑 𝑒 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 brdomi 8997 . . . . 5 (ω ≼ 𝒫 𝐴 → ∃𝑏 𝑏:ω–1-1→𝒫 𝐴)
2 fin23lem40.f . . . . . . . . . 10 𝐹 = {𝑔 ∣ ∀𝑎 ∈ (𝒫 𝑔m ω)(∀𝑥 ∈ ω (𝑎‘suc 𝑥) ⊆ (𝑎𝑥) → ran 𝑎 ∈ ran 𝑎)}
32fin23lem33 10382 . . . . . . . . 9 (𝐴𝐹 → ∃𝑐𝑑((𝑑:ω–1-1→V ∧ ran 𝑑𝐴) → ((𝑐𝑑):ω–1-1→V ∧ ran (𝑐𝑑) ⊊ ran 𝑑)))
43adantl 481 . . . . . . . 8 ((𝑏:ω–1-1→𝒫 𝐴𝐴𝐹) → ∃𝑐𝑑((𝑑:ω–1-1→V ∧ ran 𝑑𝐴) → ((𝑐𝑑):ω–1-1→V ∧ ran (𝑐𝑑) ⊊ ran 𝑑)))
5 ssv 4019 . . . . . . . . . . 11 𝒫 𝐴 ⊆ V
6 f1ss 6809 . . . . . . . . . . 11 ((𝑏:ω–1-1→𝒫 𝐴 ∧ 𝒫 𝐴 ⊆ V) → 𝑏:ω–1-1→V)
75, 6mpan2 691 . . . . . . . . . 10 (𝑏:ω–1-1→𝒫 𝐴𝑏:ω–1-1→V)
87ad2antrr 726 . . . . . . . . 9 (((𝑏:ω–1-1→𝒫 𝐴𝐴𝐹) ∧ ∀𝑑((𝑑:ω–1-1→V ∧ ran 𝑑𝐴) → ((𝑐𝑑):ω–1-1→V ∧ ran (𝑐𝑑) ⊊ ran 𝑑))) → 𝑏:ω–1-1→V)
9 f1f 6804 . . . . . . . . . . . 12 (𝑏:ω–1-1→𝒫 𝐴𝑏:ω⟶𝒫 𝐴)
10 frn 6743 . . . . . . . . . . . 12 (𝑏:ω⟶𝒫 𝐴 → ran 𝑏 ⊆ 𝒫 𝐴)
11 uniss 4919 . . . . . . . . . . . 12 (ran 𝑏 ⊆ 𝒫 𝐴 ran 𝑏 𝒫 𝐴)
129, 10, 113syl 18 . . . . . . . . . . 11 (𝑏:ω–1-1→𝒫 𝐴 ran 𝑏 𝒫 𝐴)
13 unipw 5460 . . . . . . . . . . 11 𝒫 𝐴 = 𝐴
1412, 13sseqtrdi 4045 . . . . . . . . . 10 (𝑏:ω–1-1→𝒫 𝐴 ran 𝑏𝐴)
1514ad2antrr 726 . . . . . . . . 9 (((𝑏:ω–1-1→𝒫 𝐴𝐴𝐹) ∧ ∀𝑑((𝑑:ω–1-1→V ∧ ran 𝑑𝐴) → ((𝑐𝑑):ω–1-1→V ∧ ran (𝑐𝑑) ⊊ ran 𝑑))) → ran 𝑏𝐴)
16 f1eq1 6799 . . . . . . . . . . . . . 14 (𝑑 = 𝑒 → (𝑑:ω–1-1→V ↔ 𝑒:ω–1-1→V))
17 rneq 5949 . . . . . . . . . . . . . . . 16 (𝑑 = 𝑒 → ran 𝑑 = ran 𝑒)
1817unieqd 4924 . . . . . . . . . . . . . . 15 (𝑑 = 𝑒 ran 𝑑 = ran 𝑒)
1918sseq1d 4026 . . . . . . . . . . . . . 14 (𝑑 = 𝑒 → ( ran 𝑑𝐴 ran 𝑒𝐴))
2016, 19anbi12d 632 . . . . . . . . . . . . 13 (𝑑 = 𝑒 → ((𝑑:ω–1-1→V ∧ ran 𝑑𝐴) ↔ (𝑒:ω–1-1→V ∧ ran 𝑒𝐴)))
21 fveq2 6906 . . . . . . . . . . . . . . 15 (𝑑 = 𝑒 → (𝑐𝑑) = (𝑐𝑒))
22 f1eq1 6799 . . . . . . . . . . . . . . 15 ((𝑐𝑑) = (𝑐𝑒) → ((𝑐𝑑):ω–1-1→V ↔ (𝑐𝑒):ω–1-1→V))
2321, 22syl 17 . . . . . . . . . . . . . 14 (𝑑 = 𝑒 → ((𝑐𝑑):ω–1-1→V ↔ (𝑐𝑒):ω–1-1→V))
2421rneqd 5951 . . . . . . . . . . . . . . . 16 (𝑑 = 𝑒 → ran (𝑐𝑑) = ran (𝑐𝑒))
2524unieqd 4924 . . . . . . . . . . . . . . 15 (𝑑 = 𝑒 ran (𝑐𝑑) = ran (𝑐𝑒))
2625, 18psseq12d 4106 . . . . . . . . . . . . . 14 (𝑑 = 𝑒 → ( ran (𝑐𝑑) ⊊ ran 𝑑 ran (𝑐𝑒) ⊊ ran 𝑒))
2723, 26anbi12d 632 . . . . . . . . . . . . 13 (𝑑 = 𝑒 → (((𝑐𝑑):ω–1-1→V ∧ ran (𝑐𝑑) ⊊ ran 𝑑) ↔ ((𝑐𝑒):ω–1-1→V ∧ ran (𝑐𝑒) ⊊ ran 𝑒)))
2820, 27imbi12d 344 . . . . . . . . . . . 12 (𝑑 = 𝑒 → (((𝑑:ω–1-1→V ∧ ran 𝑑𝐴) → ((𝑐𝑑):ω–1-1→V ∧ ran (𝑐𝑑) ⊊ ran 𝑑)) ↔ ((𝑒:ω–1-1→V ∧ ran 𝑒𝐴) → ((𝑐𝑒):ω–1-1→V ∧ ran (𝑐𝑒) ⊊ ran 𝑒))))
2928cbvalvw 2032 . . . . . . . . . . 11 (∀𝑑((𝑑:ω–1-1→V ∧ ran 𝑑𝐴) → ((𝑐𝑑):ω–1-1→V ∧ ran (𝑐𝑑) ⊊ ran 𝑑)) ↔ ∀𝑒((𝑒:ω–1-1→V ∧ ran 𝑒𝐴) → ((𝑐𝑒):ω–1-1→V ∧ ran (𝑐𝑒) ⊊ ran 𝑒)))
3029biimpi 216 . . . . . . . . . 10 (∀𝑑((𝑑:ω–1-1→V ∧ ran 𝑑𝐴) → ((𝑐𝑑):ω–1-1→V ∧ ran (𝑐𝑑) ⊊ ran 𝑑)) → ∀𝑒((𝑒:ω–1-1→V ∧ ran 𝑒𝐴) → ((𝑐𝑒):ω–1-1→V ∧ ran (𝑐𝑒) ⊊ ran 𝑒)))
3130adantl 481 . . . . . . . . 9 (((𝑏:ω–1-1→𝒫 𝐴𝐴𝐹) ∧ ∀𝑑((𝑑:ω–1-1→V ∧ ran 𝑑𝐴) → ((𝑐𝑑):ω–1-1→V ∧ ran (𝑐𝑑) ⊊ ran 𝑑))) → ∀𝑒((𝑒:ω–1-1→V ∧ ran 𝑒𝐴) → ((𝑐𝑒):ω–1-1→V ∧ ran (𝑐𝑒) ⊊ ran 𝑒)))
32 eqid 2734 . . . . . . . . 9 (rec(𝑐, 𝑏) ↾ ω) = (rec(𝑐, 𝑏) ↾ ω)
332, 8, 15, 31, 32fin23lem39 10387 . . . . . . . 8 (((𝑏:ω–1-1→𝒫 𝐴𝐴𝐹) ∧ ∀𝑑((𝑑:ω–1-1→V ∧ ran 𝑑𝐴) → ((𝑐𝑑):ω–1-1→V ∧ ran (𝑐𝑑) ⊊ ran 𝑑))) → ¬ 𝐴𝐹)
344, 33exlimddv 1932 . . . . . . 7 ((𝑏:ω–1-1→𝒫 𝐴𝐴𝐹) → ¬ 𝐴𝐹)
3534pm2.01da 799 . . . . . 6 (𝑏:ω–1-1→𝒫 𝐴 → ¬ 𝐴𝐹)
3635exlimiv 1927 . . . . 5 (∃𝑏 𝑏:ω–1-1→𝒫 𝐴 → ¬ 𝐴𝐹)
371, 36syl 17 . . . 4 (ω ≼ 𝒫 𝐴 → ¬ 𝐴𝐹)
3837con2i 139 . . 3 (𝐴𝐹 → ¬ ω ≼ 𝒫 𝐴)
39 pwexg 5383 . . . 4 (𝐴𝐹 → 𝒫 𝐴 ∈ V)
40 isfin4-2 10351 . . . 4 (𝒫 𝐴 ∈ V → (𝒫 𝐴 ∈ FinIV ↔ ¬ ω ≼ 𝒫 𝐴))
4139, 40syl 17 . . 3 (𝐴𝐹 → (𝒫 𝐴 ∈ FinIV ↔ ¬ ω ≼ 𝒫 𝐴))
4238, 41mpbird 257 . 2 (𝐴𝐹 → 𝒫 𝐴 ∈ FinIV)
43 isfin3 10333 . 2 (𝐴 ∈ FinIII ↔ 𝒫 𝐴 ∈ FinIV)
4442, 43sylibr 234 1 (𝐴𝐹𝐴 ∈ FinIII)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 206  wa 395  wal 1534   = wceq 1536  wex 1775  wcel 2105  {cab 2711  wral 3058  Vcvv 3477  wss 3962  wpss 3963  𝒫 cpw 4604   cuni 4911   cint 4950   class class class wbr 5147  ran crn 5689  cres 5690  suc csuc 6387  wf 6558  1-1wf1 6559  cfv 6562  (class class class)co 7430  ωcom 7886  reccrdg 8447  m cmap 8864  cdom 8981  FinIVcfin4 10317  FinIIIcfin3 10318
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1791  ax-4 1805  ax-5 1907  ax-6 1964  ax-7 2004  ax-8 2107  ax-9 2115  ax-10 2138  ax-11 2154  ax-12 2174  ax-ext 2705  ax-rep 5284  ax-sep 5301  ax-nul 5311  ax-pow 5370  ax-pr 5437  ax-un 7753
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1539  df-fal 1549  df-ex 1776  df-nf 1780  df-sb 2062  df-mo 2537  df-eu 2566  df-clab 2712  df-cleq 2726  df-clel 2813  df-nfc 2889  df-ne 2938  df-ral 3059  df-rex 3068  df-rmo 3377  df-reu 3378  df-rab 3433  df-v 3479  df-sbc 3791  df-csb 3908  df-dif 3965  df-un 3967  df-in 3969  df-ss 3979  df-pss 3982  df-nul 4339  df-if 4531  df-pw 4606  df-sn 4631  df-pr 4633  df-op 4637  df-uni 4912  df-int 4951  df-iun 4997  df-br 5148  df-opab 5210  df-mpt 5231  df-tr 5265  df-id 5582  df-eprel 5588  df-po 5596  df-so 5597  df-fr 5640  df-se 5641  df-we 5642  df-xp 5694  df-rel 5695  df-cnv 5696  df-co 5697  df-dm 5698  df-rn 5699  df-res 5700  df-ima 5701  df-pred 6322  df-ord 6388  df-on 6389  df-lim 6390  df-suc 6391  df-iota 6515  df-fun 6564  df-fn 6565  df-f 6566  df-f1 6567  df-fo 6568  df-f1o 6569  df-fv 6570  df-isom 6571  df-riota 7387  df-ov 7433  df-oprab 7434  df-mpo 7435  df-om 7887  df-1st 8012  df-2nd 8013  df-frecs 8304  df-wrecs 8335  df-recs 8409  df-rdg 8448  df-seqom 8486  df-1o 8504  df-er 8743  df-map 8866  df-en 8984  df-dom 8985  df-sdom 8986  df-fin 8987  df-card 9976  df-fin4 10324  df-fin3 10325
This theorem is referenced by:  isf33lem  10403
  Copyright terms: Public domain W3C validator