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

Theorem isfin3ds 10445
Description: Property of a III-finite set (descending sequence version). (Contributed by Mario Carneiro, 16-May-2015.)
Hypothesis
Ref Expression
isfin3ds.f 𝐹 = {𝑔 ∣ ∀𝑎 ∈ (𝒫 𝑔 ↑m ω)(∀𝑏 ∈ ω (𝑎‘suc 𝑏) ⊆ (𝑎‘𝑏) → ∩ ran 𝑎 ∈ ran 𝑎)}
Assertion
Ref Expression
isfin3ds (𝐴 ∈ 𝑉 → (𝐴 ∈ 𝐹 ↔ ∀𝑓 ∈ (𝒫 𝐴 ↑m ω)(∀𝑥 ∈ ω (𝑓‘suc 𝑥) ⊆ (𝑓‘𝑥) → ∩ ran 𝑓 ∈ ran 𝑓)))
Distinct variable group:   𝑎,𝑏,𝑓,𝑔,𝑥,𝐴
Allowed substitution hints:   𝐹(𝑥, 𝑓, 𝑔, 𝑎, 𝑏)   𝑉(𝑥, 𝑓, 𝑔, 𝑎, 𝑏)

Proof of Theorem isfin3ds
StepHypRef Expression
1 suceq 6456 . . . . . . . . 9 (𝑏 = 𝑥 → suc 𝑏 = suc 𝑥)
21fveq2d 6919 . . . . . . . 8 (𝑏 = 𝑥 → (𝑎‘suc 𝑏) = (𝑎‘suc 𝑥))
3 fveq2 6915 . . . . . . . 8 (𝑏 = 𝑥 → (𝑎‘𝑏) = (𝑎‘𝑥))
42, 3sseq12d 3945 . . . . . . 7 (𝑏 = 𝑥 → ((𝑎‘suc 𝑏) ⊆ (𝑎‘𝑏) ↔ (𝑎‘suc 𝑥) ⊆ (𝑎‘𝑥)))
54cbvralvw 3244 . . . . . 6 (∀𝑏 ∈ ω (𝑎‘suc 𝑏) ⊆ (𝑎‘𝑏) ↔ ∀𝑥 ∈ ω (𝑎‘suc 𝑥) ⊆ (𝑎‘𝑥))
6 fveq1 6914 . . . . . . . 8 (𝑎 = 𝑓 → (𝑎‘suc 𝑥) = (𝑓‘suc 𝑥))
7 fveq1 6914 . . . . . . . 8 (𝑎 = 𝑓 → (𝑎‘𝑥) = (𝑓‘𝑥))
86, 7sseq12d 3945 . . . . . . 7 (𝑎 = 𝑓 → ((𝑎‘suc 𝑥) ⊆ (𝑎‘𝑥) ↔ (𝑓‘suc 𝑥) ⊆ (𝑓‘𝑥)))
98ralbidv 3192 . . . . . 6 (𝑎 = 𝑓 → (∀𝑥 ∈ ω (𝑎‘suc 𝑥) ⊆ (𝑎‘𝑥) ↔ ∀𝑥 ∈ ω (𝑓‘suc 𝑥) ⊆ (𝑓‘𝑥)))
105, 9bitrid 286 . . . . 5 (𝑎 = 𝑓 → (∀𝑏 ∈ ω (𝑎‘suc 𝑏) ⊆ (𝑎‘𝑏) ↔ ∀𝑥 ∈ ω (𝑓‘suc 𝑥) ⊆ (𝑓‘𝑥)))
11 rneq 5929 . . . . . . 7 (𝑎 = 𝑓 → ran 𝑎 = ran 𝑓)
1211inteqd 4916 . . . . . 6 (𝑎 = 𝑓 → ∩ ran 𝑎 = ∩ ran 𝑓)
1312, 11eleq12d 2861 . . . . 5 (𝑎 = 𝑓 → (∩ ran 𝑎 ∈ ran 𝑎 ↔ ∩ ran 𝑓 ∈ ran 𝑓))
1410, 13imbi12d 347 . . . 4 (𝑎 = 𝑓 → ((∀𝑏 ∈ ω (𝑎‘suc 𝑏) ⊆ (𝑎‘𝑏) → ∩ ran 𝑎 ∈ ran 𝑎) ↔ (∀𝑥 ∈ ω (𝑓‘suc 𝑥) ⊆ (𝑓‘𝑥) → ∩ ran 𝑓 ∈ ran 𝑓)))
1514cbvralvw 3244 . . 3 (∀𝑎 ∈ (𝒫 𝑔 ↑m ω)(∀𝑏 ∈ ω (𝑎‘suc 𝑏) ⊆ (𝑎‘𝑏) → ∩ ran 𝑎 ∈ ran 𝑎) ↔ ∀𝑓 ∈ (𝒫 𝑔 ↑m ω)(∀𝑥 ∈ ω (𝑓‘suc 𝑥) ⊆ (𝑓‘𝑥) → ∩ ran 𝑓 ∈ ran 𝑓))
16 pweq 4573 . . . . 5 (𝑔 = 𝐴 → 𝒫 𝑔 = 𝒫 𝐴)
1716oveq1d 7465 . . . 4 (𝑔 = 𝐴 → (𝒫 𝑔 ↑m ω) = (𝒫 𝐴 ↑m ω))
1817raleqdv 3323 . . 3 (𝑔 = 𝐴 → (∀𝑓 ∈ (𝒫 𝑔 ↑m ω)(∀𝑥 ∈ ω (𝑓‘suc 𝑥) ⊆ (𝑓‘𝑥) → ∩ ran 𝑓 ∈ ran 𝑓) ↔ ∀𝑓 ∈ (𝒫 𝐴 ↑m ω)(∀𝑥 ∈ ω (𝑓‘suc 𝑥) ⊆ (𝑓‘𝑥) → ∩ ran 𝑓 ∈ ran 𝑓)))
1915, 18bitrid 286 . 2 (𝑔 = 𝐴 → (∀𝑎 ∈ (𝒫 𝑔 ↑m ω)(∀𝑏 ∈ ω (𝑎‘suc 𝑏) ⊆ (𝑎‘𝑏) → ∩ ran 𝑎 ∈ ran 𝑎) ↔ ∀𝑓 ∈ (𝒫 𝐴 ↑m ω)(∀𝑥 ∈ ω (𝑓‘suc 𝑥) ⊆ (𝑓‘𝑥) → ∩ ran 𝑓 ∈ ran 𝑓)))
20 isfin3ds.f . 2 𝐹 = {𝑔 ∣ ∀𝑎 ∈ (𝒫 𝑔 ↑m ω)(∀𝑏 ∈ ω (𝑎‘suc 𝑏) ⊆ (𝑎‘𝑏) → ∩ ran 𝑎 ∈ ran 𝑎)}
2119, 20elab2g 3636 1 (𝐴 ∈ 𝑉 → (𝐴 ∈ 𝐹 ↔ ∀𝑓 ∈ (𝒫 𝐴 ↑m ω)(∀𝑥 ∈ ω (𝑓‘suc 𝑥) ⊆ (𝑓‘𝑥) → ∩ ran 𝑓 ∈ ran 𝑓)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   = wceq 1572   ∈ wcel 2150  {cab 2744  ∀wral 3083   ⊆ wss 3899  𝒫 cpw 4559  ∩ cint 4911  ran crn 5658  suc csuc 6389  ‘cfv 6565  (class class class)co 7450  ωcom 7910   ↑m cmap 8884
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-ext 2738
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1106  df-tru 1575  df-fal 1585  df-ex 1815  df-sb 2104  df-clab 2745  df-cleq 2758  df-clel 2842  df-ral 3084  df-rex 3094  df-rab 3416  df-v 3455  df-ss 3900  df-dif 4049  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-op 4840  df-uni 4872  df-int 4912  df-br 5108  df-opab 5173  df-cnv 5665  df-dm 5667  df-rn 5668  df-suc 6393  df-iota 6519  df-fv 6573  df-ov 7453
This theorem is used by:  ssfin3ds  10446  fin23lem17  10454  fin23lem39  10466  fin23lem40  10467  isf32lem12  10480  isfin3-3  10484
  Copyright terms: Public domain W3C validator