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

Theorem unblem3 9330
Description: Lemma for unbnn 9332. The value of the function 𝐹 is less than its value at a successor. (Contributed by NM, 3-Dec-2003.)
Hypothesis
Ref Expression
unblem.2 𝐹 = (rec((𝑥 ∈ V ↦ (𝐴 ∖ suc 𝑥)), 𝐴) ↾ ω)
Assertion
Ref Expression
unblem3 ((𝐴 ⊆ ω ∧ ∀𝑤 ∈ ω ∃𝑣𝐴 𝑤𝑣) → (𝑧 ∈ ω → (𝐹𝑧) ∈ (𝐹‘suc 𝑧)))
Distinct variable groups:   𝑤,𝑣,𝑥,𝑧,𝐴   𝑣,𝐹,𝑤,𝑧
Allowed substitution hint:   𝐹(𝑥)

Proof of Theorem unblem3
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 unblem.2 . . . . . . 7 𝐹 = (rec((𝑥 ∈ V ↦ (𝐴 ∖ suc 𝑥)), 𝐴) ↾ ω)
21unblem2 9329 . . . . . 6 ((𝐴 ⊆ ω ∧ ∀𝑤 ∈ ω ∃𝑣𝐴 𝑤𝑣) → (𝑧 ∈ ω → (𝐹𝑧) ∈ 𝐴))
32imp 406 . . . . 5 (((𝐴 ⊆ ω ∧ ∀𝑤 ∈ ω ∃𝑣𝐴 𝑤𝑣) ∧ 𝑧 ∈ ω) → (𝐹𝑧) ∈ 𝐴)
4 omsson 7891 . . . . . . . 8 ω ⊆ On
5 sstr 3992 . . . . . . . 8 ((𝐴 ⊆ ω ∧ ω ⊆ On) → 𝐴 ⊆ On)
64, 5mpan2 691 . . . . . . 7 (𝐴 ⊆ ω → 𝐴 ⊆ On)
7 ssel 3977 . . . . . . . 8 (𝐴 ⊆ On → ((𝐹𝑧) ∈ 𝐴 → (𝐹𝑧) ∈ On))
87anc2li 555 . . . . . . 7 (𝐴 ⊆ On → ((𝐹𝑧) ∈ 𝐴 → (𝐴 ⊆ On ∧ (𝐹𝑧) ∈ On)))
96, 8syl 17 . . . . . 6 (𝐴 ⊆ ω → ((𝐹𝑧) ∈ 𝐴 → (𝐴 ⊆ On ∧ (𝐹𝑧) ∈ On)))
109ad2antrr 726 . . . . 5 (((𝐴 ⊆ ω ∧ ∀𝑤 ∈ ω ∃𝑣𝐴 𝑤𝑣) ∧ 𝑧 ∈ ω) → ((𝐹𝑧) ∈ 𝐴 → (𝐴 ⊆ On ∧ (𝐹𝑧) ∈ On)))
113, 10mpd 15 . . . 4 (((𝐴 ⊆ ω ∧ ∀𝑤 ∈ ω ∃𝑣𝐴 𝑤𝑣) ∧ 𝑧 ∈ ω) → (𝐴 ⊆ On ∧ (𝐹𝑧) ∈ On))
12 onmindif 6476 . . . 4 ((𝐴 ⊆ On ∧ (𝐹𝑧) ∈ On) → (𝐹𝑧) ∈ (𝐴 ∖ suc (𝐹𝑧)))
1311, 12syl 17 . . 3 (((𝐴 ⊆ ω ∧ ∀𝑤 ∈ ω ∃𝑣𝐴 𝑤𝑣) ∧ 𝑧 ∈ ω) → (𝐹𝑧) ∈ (𝐴 ∖ suc (𝐹𝑧)))
14 unblem1 9328 . . . . . . 7 (((𝐴 ⊆ ω ∧ ∀𝑤 ∈ ω ∃𝑣𝐴 𝑤𝑣) ∧ (𝐹𝑧) ∈ 𝐴) → (𝐴 ∖ suc (𝐹𝑧)) ∈ 𝐴)
1514ex 412 . . . . . 6 ((𝐴 ⊆ ω ∧ ∀𝑤 ∈ ω ∃𝑣𝐴 𝑤𝑣) → ((𝐹𝑧) ∈ 𝐴 (𝐴 ∖ suc (𝐹𝑧)) ∈ 𝐴))
162, 15syld 47 . . . . 5 ((𝐴 ⊆ ω ∧ ∀𝑤 ∈ ω ∃𝑣𝐴 𝑤𝑣) → (𝑧 ∈ ω → (𝐴 ∖ suc (𝐹𝑧)) ∈ 𝐴))
17 suceq 6450 . . . . . . . . 9 (𝑦 = 𝑥 → suc 𝑦 = suc 𝑥)
1817difeq2d 4126 . . . . . . . 8 (𝑦 = 𝑥 → (𝐴 ∖ suc 𝑦) = (𝐴 ∖ suc 𝑥))
1918inteqd 4951 . . . . . . 7 (𝑦 = 𝑥 (𝐴 ∖ suc 𝑦) = (𝐴 ∖ suc 𝑥))
20 suceq 6450 . . . . . . . . 9 (𝑦 = (𝐹𝑧) → suc 𝑦 = suc (𝐹𝑧))
2120difeq2d 4126 . . . . . . . 8 (𝑦 = (𝐹𝑧) → (𝐴 ∖ suc 𝑦) = (𝐴 ∖ suc (𝐹𝑧)))
2221inteqd 4951 . . . . . . 7 (𝑦 = (𝐹𝑧) → (𝐴 ∖ suc 𝑦) = (𝐴 ∖ suc (𝐹𝑧)))
231, 19, 22frsucmpt2 8480 . . . . . 6 ((𝑧 ∈ ω ∧ (𝐴 ∖ suc (𝐹𝑧)) ∈ 𝐴) → (𝐹‘suc 𝑧) = (𝐴 ∖ suc (𝐹𝑧)))
2423ex 412 . . . . 5 (𝑧 ∈ ω → ( (𝐴 ∖ suc (𝐹𝑧)) ∈ 𝐴 → (𝐹‘suc 𝑧) = (𝐴 ∖ suc (𝐹𝑧))))
2516, 24sylcom 30 . . . 4 ((𝐴 ⊆ ω ∧ ∀𝑤 ∈ ω ∃𝑣𝐴 𝑤𝑣) → (𝑧 ∈ ω → (𝐹‘suc 𝑧) = (𝐴 ∖ suc (𝐹𝑧))))
2625imp 406 . . 3 (((𝐴 ⊆ ω ∧ ∀𝑤 ∈ ω ∃𝑣𝐴 𝑤𝑣) ∧ 𝑧 ∈ ω) → (𝐹‘suc 𝑧) = (𝐴 ∖ suc (𝐹𝑧)))
2713, 26eleqtrrd 2844 . 2 (((𝐴 ⊆ ω ∧ ∀𝑤 ∈ ω ∃𝑣𝐴 𝑤𝑣) ∧ 𝑧 ∈ ω) → (𝐹𝑧) ∈ (𝐹‘suc 𝑧))
2827ex 412 1 ((𝐴 ⊆ ω ∧ ∀𝑤 ∈ ω ∃𝑣𝐴 𝑤𝑣) → (𝑧 ∈ ω → (𝐹𝑧) ∈ (𝐹‘suc 𝑧)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1540  wcel 2108  wral 3061  wrex 3070  Vcvv 3480  cdif 3948  wss 3951   cint 4946  cmpt 5225  cres 5687  Oncon0 6384  suc csuc 6386  cfv 6561  ωcom 7887  reccrdg 8449
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2708  ax-sep 5296  ax-nul 5306  ax-pr 5432  ax-un 7755
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2540  df-eu 2569  df-clab 2715  df-cleq 2729  df-clel 2816  df-nfc 2892  df-ne 2941  df-ral 3062  df-rex 3071  df-reu 3381  df-rab 3437  df-v 3482  df-sbc 3789  df-csb 3900  df-dif 3954  df-un 3956  df-in 3958  df-ss 3968  df-pss 3971  df-nul 4334  df-if 4526  df-pw 4602  df-sn 4627  df-pr 4629  df-op 4633  df-uni 4908  df-int 4947  df-iun 4993  df-br 5144  df-opab 5206  df-mpt 5226  df-tr 5260  df-id 5578  df-eprel 5584  df-po 5592  df-so 5593  df-fr 5637  df-we 5639  df-xp 5691  df-rel 5692  df-cnv 5693  df-co 5694  df-dm 5695  df-rn 5696  df-res 5697  df-ima 5698  df-pred 6321  df-ord 6387  df-on 6388  df-lim 6389  df-suc 6390  df-iota 6514  df-fun 6563  df-fn 6564  df-f 6565  df-f1 6566  df-fo 6567  df-f1o 6568  df-fv 6569  df-ov 7434  df-om 7888  df-2nd 8015  df-frecs 8306  df-wrecs 8337  df-recs 8411  df-rdg 8450
This theorem is referenced by:  unblem4  9331
  Copyright terms: Public domain W3C validator