Users' Mathboxes Mathbox for Jonathan Ben-Naim < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  bnj544 Structured version   Visualization version   GIF version

Theorem bnj544 32774
Description: Technical lemma for bnj852 32801. This lemma may no longer be used or have become an indirect lemma of the theorem in question (i.e. a lemma of a lemma... of the theorem). (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (New usage is discouraged.)
Hypotheses
Ref Expression
bnj544.1 (𝜑′ ↔ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅))
bnj544.2 (𝜓′ ↔ ∀𝑖 ∈ ω (suc 𝑖𝑚 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))
bnj544.3 𝐷 = (ω ∖ {∅})
bnj544.4 𝐺 = (𝑓 ∪ {⟨𝑚, 𝑦 ∈ (𝑓𝑝) pred(𝑦, 𝐴, 𝑅)⟩})
bnj544.5 (𝜏 ↔ (𝑓 Fn 𝑚𝜑′𝜓′))
bnj544.6 (𝜎 ↔ (𝑚𝐷𝑛 = suc 𝑚𝑝𝑚))
Assertion
Ref Expression
bnj544 ((𝑅 FrSe 𝐴𝜏𝜎) → 𝐺 Fn 𝑛)
Distinct variable groups:   𝐴,𝑖,𝑝,𝑦   𝑅,𝑖,𝑝,𝑦   𝑓,𝑖,𝑝,𝑦   𝑖,𝑚,𝑝   𝑝,𝜑′
Allowed substitution hints:   𝜏(𝑥,𝑦,𝑓,𝑖,𝑚,𝑛,𝑝)   𝜎(𝑥,𝑦,𝑓,𝑖,𝑚,𝑛,𝑝)   𝐴(𝑥,𝑓,𝑚,𝑛)   𝐷(𝑥,𝑦,𝑓,𝑖,𝑚,𝑛,𝑝)   𝑅(𝑥,𝑓,𝑚,𝑛)   𝐺(𝑥,𝑦,𝑓,𝑖,𝑚,𝑛,𝑝)   𝜑′(𝑥,𝑦,𝑓,𝑖,𝑚,𝑛)   𝜓′(𝑥,𝑦,𝑓,𝑖,𝑚,𝑛,𝑝)

Proof of Theorem bnj544
StepHypRef Expression
1 bnj544.6 . . 3 (𝜎 ↔ (𝑚𝐷𝑛 = suc 𝑚𝑝𝑚))
2 bnj544.3 . . . . 5 𝐷 = (ω ∖ {∅})
32bnj923 32648 . . . 4 (𝑚𝐷𝑚 ∈ ω)
433anim1i 1150 . . 3 ((𝑚𝐷𝑛 = suc 𝑚𝑝𝑚) → (𝑚 ∈ ω ∧ 𝑛 = suc 𝑚𝑝𝑚))
51, 4sylbi 216 . 2 (𝜎 → (𝑚 ∈ ω ∧ 𝑛 = suc 𝑚𝑝𝑚))
6 bnj544.1 . . 3 (𝜑′ ↔ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅))
7 bnj544.2 . . 3 (𝜓′ ↔ ∀𝑖 ∈ ω (suc 𝑖𝑚 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))
8 bnj544.4 . . 3 𝐺 = (𝑓 ∪ {⟨𝑚, 𝑦 ∈ (𝑓𝑝) pred(𝑦, 𝐴, 𝑅)⟩})
9 bnj544.5 . . 3 (𝜏 ↔ (𝑓 Fn 𝑚𝜑′𝜓′))
10 biid 260 . . 3 ((𝑚 ∈ ω ∧ 𝑛 = suc 𝑚𝑝𝑚) ↔ (𝑚 ∈ ω ∧ 𝑛 = suc 𝑚𝑝𝑚))
116, 7, 8, 9, 10bnj543 32773 . 2 ((𝑅 FrSe 𝐴𝜏 ∧ (𝑚 ∈ ω ∧ 𝑛 = suc 𝑚𝑝𝑚)) → 𝐺 Fn 𝑛)
125, 11syl3an3 1163 1 ((𝑅 FrSe 𝐴𝜏𝜎) → 𝐺 Fn 𝑛)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  w3a 1085   = wceq 1539  wcel 2108  wral 3063  cdif 3880  cun 3881  c0 4253  {csn 4558  cop 4564   ciun 4921  suc csuc 6253   Fn wfn 6413  cfv 6418  ωcom 7687   predc-bnj14 32567   FrSe w-bnj15 32571
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-rep 5205  ax-sep 5218  ax-nul 5225  ax-pr 5347  ax-un 7566  ax-reg 9281
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3or 1086  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-ral 3068  df-rex 3069  df-reu 3070  df-rab 3072  df-v 3424  df-sbc 3712  df-csb 3829  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-pss 3902  df-nul 4254  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-tp 4563  df-op 4565  df-uni 4837  df-iun 4923  df-br 5071  df-opab 5133  df-mpt 5154  df-tr 5188  df-id 5480  df-eprel 5486  df-po 5494  df-so 5495  df-fr 5535  df-we 5537  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-res 5592  df-ima 5593  df-ord 6254  df-on 6255  df-lim 6256  df-suc 6257  df-iota 6376  df-fun 6420  df-fn 6421  df-f 6422  df-f1 6423  df-fo 6424  df-f1o 6425  df-fv 6426  df-om 7688  df-bnj17 32566  df-bnj14 32568  df-bnj13 32570  df-bnj15 32572
This theorem is referenced by:  bnj600  32799  bnj908  32811
  Copyright terms: Public domain W3C validator