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 34940
Description: Technical lemma for bnj69 35002. 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 34939 . . 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 34938 . . . 4 (((𝑅 FrSe 𝐴𝑋𝐴) ∧ (𝜒𝑛 = suc 𝑚𝑝 = suc 𝑛)) → 𝐶 ∈ V)
10 simpr3 1195 . . . 4 (((𝑅 FrSe 𝐴𝑋𝐴) ∧ (𝜒𝑛 = suc 𝑚𝑝 = suc 𝑛)) → 𝑝 = suc 𝑛)
111bnj1235 34796 . . . . . 6 (𝜒𝑓 Fn 𝑛)
12113ad2ant1 1132 . . . . 5 ((𝜒𝑛 = suc 𝑚𝑝 = suc 𝑛) → 𝑓 Fn 𝑛)
1312adantl 481 . . . 4 (((𝑅 FrSe 𝐴𝑋𝐴) ∧ (𝜒𝑛 = suc 𝑚𝑝 = suc 𝑛)) → 𝑓 Fn 𝑛)
14 bnj910.13 . . . . . 6 𝐺 = (𝑓 ∪ {⟨𝑛, 𝐶⟩})
1514bnj941 34764 . . . . 5 (𝐶 ∈ V → ((𝑝 = suc 𝑛𝑓 Fn 𝑛) → 𝐺 Fn 𝑝))
16153impib 1115 . . . 4 ((𝐶 ∈ V ∧ 𝑝 = suc 𝑛𝑓 Fn 𝑛) → 𝐺 Fn 𝑝)
179, 10, 13, 16syl3anc 1370 . . 3 (((𝑅 FrSe 𝐴𝑋𝐴) ∧ (𝜒𝑛 = suc 𝑚𝑝 = suc 𝑛)) → 𝐺 Fn 𝑝)
18 bnj910.4 . . . 4 (𝜑′[𝑝 / 𝑛]𝜑)
19 bnj910.7 . . . 4 (𝜑″[𝐺 / 𝑓]𝜑′)
204, 5, 1, 18, 19, 2, 6, 14, 7, 8bnj944 34930 . . 3 (((𝑅 FrSe 𝐴𝑋𝐴) ∧ (𝜒𝑛 = suc 𝑚𝑝 = suc 𝑛)) → 𝜑″)
21 bnj910.5 . . . 4 (𝜓′[𝑝 / 𝑛]𝜓)
22 bnj910.8 . . . 4 (𝜓″[𝐺 / 𝑓]𝜓′)
235, 1, 2, 6, 14, 9bnj967 34937 . . . 4 (((𝑅 FrSe 𝐴𝑋𝐴) ∧ (𝜒𝑛 = suc 𝑚𝑝 = suc 𝑛) ∧ (𝑖 ∈ ω ∧ suc 𝑖𝑝 ∧ suc 𝑖𝑛)) → (𝐺‘suc 𝑖) = 𝑦 ∈ (𝐺𝑖) pred(𝑦, 𝐴, 𝑅))
241, 2, 6, 14, 9, 17bnj966 34936 . . . 4 (((𝑅 FrSe 𝐴𝑋𝐴) ∧ (𝜒𝑛 = suc 𝑚𝑝 = suc 𝑛) ∧ (𝑖 ∈ ω ∧ suc 𝑖𝑝𝑛 = suc 𝑖)) → (𝐺‘suc 𝑖) = 𝑦 ∈ (𝐺𝑖) pred(𝑦, 𝐴, 𝑅))
255, 1, 21, 22, 6, 14, 23, 24bnj964 34935 . . 3 (((𝑅 FrSe 𝐴𝑋𝐴) ∧ (𝜒𝑛 = suc 𝑚𝑝 = suc 𝑛)) → 𝜓″)
263, 17, 20, 25bnj951 34767 . 2 (((𝑅 FrSe 𝐴𝑋𝐴) ∧ (𝜒𝑛 = suc 𝑚𝑝 = suc 𝑛)) → (𝑝𝐷𝐺 Fn 𝑝𝜑″𝜓″))
27 bnj910.6 . . . 4 (𝜒′[𝑝 / 𝑛]𝜒)
28 vex 3481 . . . 4 𝑝 ∈ V
291, 18, 21, 27, 28bnj919 34759 . . 3 (𝜒′ ↔ (𝑝𝐷𝑓 Fn 𝑝𝜑′𝜓′))
30 bnj910.9 . . 3 (𝜒″[𝐺 / 𝑓]𝜒′)
3114bnj918 34758 . . 3 𝐺 ∈ V
3229, 19, 22, 30, 31bnj976 34769 . 2 (𝜒″ ↔ (𝑝𝐷𝐺 Fn 𝑝𝜑″𝜓″))
3326, 32sylibr 234 1 (((𝑅 FrSe 𝐴𝑋𝐴) ∧ (𝜒𝑛 = suc 𝑚𝑝 = suc 𝑛)) → 𝜒″)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  w3a 1086   = wceq 1536  wcel 2105  {cab 2711  wral 3058  wrex 3067  Vcvv 3477  [wsbc 3790  cdif 3959  cun 3960  c0 4338  {csn 4630  cop 4636   ciun 4995  suc csuc 6387   Fn wfn 6557  cfv 6562  ωcom 7886  w-bnj17 34678   predc-bnj14 34680   FrSe w-bnj15 34684
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-pr 5437  ax-un 7753  ax-reg 9629
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-rab 3433  df-v 3479  df-sbc 3791  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-iun 4997  df-br 5148  df-opab 5210  df-tr 5265  df-id 5582  df-eprel 5588  df-po 5596  df-so 5597  df-fr 5640  df-we 5642  df-xp 5694  df-rel 5695  df-cnv 5696  df-co 5697  df-dm 5698  df-res 5700  df-ord 6388  df-on 6389  df-lim 6390  df-suc 6391  df-iota 6515  df-fun 6564  df-fn 6565  df-fv 6570  df-om 7887  df-bnj17 34679  df-bnj14 34681  df-bnj13 34683  df-bnj15 34685
This theorem is referenced by:  bnj998  34949
  Copyright terms: Public domain W3C validator