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

Theorem bnj910 31325
Description: Technical lemma for bnj69 31385. 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
bnj910.1 (𝜑 ↔ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅))
bnj910.2 (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))
bnj910.3 (𝜒 ↔ (𝑛𝐷𝑓 Fn 𝑛𝜑𝜓))
bnj910.4 (𝜑′[𝑝 / 𝑛]𝜑)
bnj910.5 (𝜓′[𝑝 / 𝑛]𝜓)
bnj910.6 (𝜒′[𝑝 / 𝑛]𝜒)
bnj910.7 (𝜑″[𝐺 / 𝑓]𝜑′)
bnj910.8 (𝜓″[𝐺 / 𝑓]𝜓′)
bnj910.9 (𝜒″[𝐺 / 𝑓]𝜒′)
bnj910.10 𝐷 = (ω ∖ {∅})
bnj910.11 𝐵 = {𝑓 ∣ ∃𝑛𝐷 (𝑓 Fn 𝑛𝜑𝜓)}
bnj910.12 𝐶 = 𝑦 ∈ (𝑓𝑚) pred(𝑦, 𝐴, 𝑅)
bnj910.13 𝐺 = (𝑓 ∪ {⟨𝑛, 𝐶⟩})
bnj910.14 (𝜏 ↔ (𝑓 Fn 𝑛𝜑𝜓))
bnj910.15 (𝜎 ↔ (𝑛𝐷𝑝 = suc 𝑛𝑚𝑛))
Assertion
Ref Expression
bnj910 (((𝑅 FrSe 𝐴𝑋𝐴) ∧ (𝜒𝑛 = suc 𝑚𝑝 = suc 𝑛)) → 𝜒″)
Distinct variable groups:   𝐴,𝑓,𝑖,𝑚,𝑛,𝑦   𝐷,𝑓,𝑖,𝑛   𝑖,𝐺   𝑅,𝑓,𝑖,𝑚,𝑛,𝑦   𝑓,𝑋,𝑖,𝑛   𝑓,𝑝,𝑖,𝑛   𝜑,𝑖
Allowed substitution hints:   𝜑(𝑦,𝑓,𝑚,𝑛,𝑝)   𝜓(𝑦,𝑓,𝑖,𝑚,𝑛,𝑝)   𝜒(𝑦,𝑓,𝑖,𝑚,𝑛,𝑝)   𝜏(𝑦,𝑓,𝑖,𝑚,𝑛,𝑝)   𝜎(𝑦,𝑓,𝑖,𝑚,𝑛,𝑝)   𝐴(𝑝)   𝐵(𝑦,𝑓,𝑖,𝑚,𝑛,𝑝)   𝐶(𝑦,𝑓,𝑖,𝑚,𝑛,𝑝)   𝐷(𝑦,𝑚,𝑝)   𝑅(𝑝)   𝐺(𝑦,𝑓,𝑚,𝑛,𝑝)   𝑋(𝑦,𝑚,𝑝)   𝜑′(𝑦,𝑓,𝑖,𝑚,𝑛,𝑝)   𝜓′(𝑦,𝑓,𝑖,𝑚,𝑛,𝑝)   𝜒′(𝑦,𝑓,𝑖,𝑚,𝑛,𝑝)   𝜑″(𝑦,𝑓,𝑖,𝑚,𝑛,𝑝)   𝜓″(𝑦,𝑓,𝑖,𝑚,𝑛,𝑝)   𝜒″(𝑦,𝑓,𝑖,𝑚,𝑛,𝑝)

Proof of Theorem bnj910
StepHypRef Expression
1 bnj910.3 . . . 4 (𝜒 ↔ (𝑛𝐷𝑓 Fn 𝑛𝜑𝜓))
2 bnj910.10 . . . 4 𝐷 = (ω ∖ {∅})
31, 2bnj970 31324 . . 3 (((𝑅 FrSe 𝐴𝑋𝐴) ∧ (𝜒𝑛 = suc 𝑚𝑝 = suc 𝑛)) → 𝑝𝐷)
4 bnj910.1 . . . . 5 (𝜑 ↔ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅))
5 bnj910.2 . . . . 5 (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))
6 bnj910.12 . . . . 5 𝐶 = 𝑦 ∈ (𝑓𝑚) pred(𝑦, 𝐴, 𝑅)
7 bnj910.14 . . . . 5 (𝜏 ↔ (𝑓 Fn 𝑛𝜑𝜓))
8 bnj910.15 . . . . 5 (𝜎 ↔ (𝑛𝐷𝑝 = suc 𝑛𝑚𝑛))
94, 5, 1, 2, 6, 7, 8bnj969 31323 . . . 4 (((𝑅 FrSe 𝐴𝑋𝐴) ∧ (𝜒𝑛 = suc 𝑚𝑝 = suc 𝑛)) → 𝐶 ∈ V)
10 simpr3 1238 . . . 4 (((𝑅 FrSe 𝐴𝑋𝐴) ∧ (𝜒𝑛 = suc 𝑚𝑝 = suc 𝑛)) → 𝑝 = suc 𝑛)
111bnj1235 31182 . . . . . 6 (𝜒𝑓 Fn 𝑛)
12113ad2ant1 1128 . . . . 5 ((𝜒𝑛 = suc 𝑚𝑝 = suc 𝑛) → 𝑓 Fn 𝑛)
1312adantl 473 . . . 4 (((𝑅 FrSe 𝐴𝑋𝐴) ∧ (𝜒𝑛 = suc 𝑚𝑝 = suc 𝑛)) → 𝑓 Fn 𝑛)
14 bnj910.13 . . . . . 6 𝐺 = (𝑓 ∪ {⟨𝑛, 𝐶⟩})
1514bnj941 31150 . . . . 5 (𝐶 ∈ V → ((𝑝 = suc 𝑛𝑓 Fn 𝑛) → 𝐺 Fn 𝑝))
16153impib 1109 . . . 4 ((𝐶 ∈ V ∧ 𝑝 = suc 𝑛𝑓 Fn 𝑛) → 𝐺 Fn 𝑝)
179, 10, 13, 16syl3anc 1477 . . 3 (((𝑅 FrSe 𝐴𝑋𝐴) ∧ (𝜒𝑛 = suc 𝑚𝑝 = suc 𝑛)) → 𝐺 Fn 𝑝)
18 bnj910.4 . . . 4 (𝜑′[𝑝 / 𝑛]𝜑)
19 bnj910.7 . . . 4 (𝜑″[𝐺 / 𝑓]𝜑′)
204, 5, 1, 18, 19, 2, 6, 14, 7, 8bnj944 31315 . . 3 (((𝑅 FrSe 𝐴𝑋𝐴) ∧ (𝜒𝑛 = suc 𝑚𝑝 = suc 𝑛)) → 𝜑″)
21 bnj910.5 . . . 4 (𝜓′[𝑝 / 𝑛]𝜓)
22 bnj910.8 . . . 4 (𝜓″[𝐺 / 𝑓]𝜓′)
235, 1, 2, 6, 14, 9bnj967 31322 . . . 4 (((𝑅 FrSe 𝐴𝑋𝐴) ∧ (𝜒𝑛 = suc 𝑚𝑝 = suc 𝑛) ∧ (𝑖 ∈ ω ∧ suc 𝑖𝑝 ∧ suc 𝑖𝑛)) → (𝐺‘suc 𝑖) = 𝑦 ∈ (𝐺𝑖) pred(𝑦, 𝐴, 𝑅))
241, 2, 6, 14, 9, 17bnj966 31321 . . . 4 (((𝑅 FrSe 𝐴𝑋𝐴) ∧ (𝜒𝑛 = suc 𝑚𝑝 = suc 𝑛) ∧ (𝑖 ∈ ω ∧ suc 𝑖𝑝𝑛 = suc 𝑖)) → (𝐺‘suc 𝑖) = 𝑦 ∈ (𝐺𝑖) pred(𝑦, 𝐴, 𝑅))
255, 1, 21, 22, 6, 14, 23, 24bnj964 31320 . . 3 (((𝑅 FrSe 𝐴𝑋𝐴) ∧ (𝜒𝑛 = suc 𝑚𝑝 = suc 𝑛)) → 𝜓″)
263, 17, 20, 25bnj951 31153 . 2 (((𝑅 FrSe 𝐴𝑋𝐴) ∧ (𝜒𝑛 = suc 𝑚𝑝 = suc 𝑛)) → (𝑝𝐷𝐺 Fn 𝑝𝜑″𝜓″))
27 bnj910.6 . . . 4 (𝜒′[𝑝 / 𝑛]𝜒)
28 vex 3343 . . . 4 𝑝 ∈ V
291, 18, 21, 27, 28bnj919 31144 . . 3 (𝜒′ ↔ (𝑝𝐷𝑓 Fn 𝑝𝜑′𝜓′))
30 bnj910.9 . . 3 (𝜒″[𝐺 / 𝑓]𝜒′)
3114bnj918 31143 . . 3 𝐺 ∈ V
3229, 19, 22, 30, 31bnj976 31155 . 2 (𝜒″ ↔ (𝑝𝐷𝐺 Fn 𝑝𝜑″𝜓″))
3326, 32sylibr 224 1 (((𝑅 FrSe 𝐴𝑋𝐴) ∧ (𝜒𝑛 = suc 𝑚𝑝 = suc 𝑛)) → 𝜒″)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 196  wa 383  w3a 1072   = wceq 1632  wcel 2139  {cab 2746  wral 3050  wrex 3051  Vcvv 3340  [wsbc 3576  cdif 3712  cun 3713  c0 4058  {csn 4321  cop 4327   ciun 4672  suc csuc 5886   Fn wfn 6044  cfv 6049  ωcom 7230  w-bnj17 31061   predc-bnj14 31063   FrSe w-bnj15 31067
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1871  ax-4 1886  ax-5 1988  ax-6 2054  ax-7 2090  ax-8 2141  ax-9 2148  ax-10 2168  ax-11 2183  ax-12 2196  ax-13 2391  ax-ext 2740  ax-rep 4923  ax-sep 4933  ax-nul 4941  ax-pr 5055  ax-un 7114  ax-reg 8662
This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3or 1073  df-3an 1074  df-tru 1635  df-ex 1854  df-nf 1859  df-sb 2047  df-eu 2611  df-mo 2612  df-clab 2747  df-cleq 2753  df-clel 2756  df-nfc 2891  df-ne 2933  df-ral 3055  df-rex 3056  df-reu 3057  df-rab 3059  df-v 3342  df-sbc 3577  df-csb 3675  df-dif 3718  df-un 3720  df-in 3722  df-ss 3729  df-pss 3731  df-nul 4059  df-if 4231  df-pw 4304  df-sn 4322  df-pr 4324  df-tp 4326  df-op 4328  df-uni 4589  df-iun 4674  df-br 4805  df-opab 4865  df-mpt 4882  df-tr 4905  df-id 5174  df-eprel 5179  df-po 5187  df-so 5188  df-fr 5225  df-we 5227  df-xp 5272  df-rel 5273  df-cnv 5274  df-co 5275  df-dm 5276  df-rn 5277  df-res 5278  df-ima 5279  df-ord 5887  df-on 5888  df-lim 5889  df-suc 5890  df-iota 6012  df-fun 6051  df-fn 6052  df-f 6053  df-f1 6054  df-fo 6055  df-f1o 6056  df-fv 6057  df-om 7231  df-bnj17 31062  df-bnj14 31064  df-bnj13 31066  df-bnj15 31068
This theorem is referenced by:  bnj998  31333
  Copyright terms: Public domain W3C validator