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

Theorem bnj126 34865
Description: Technical lemma for bnj150 34868. 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
bnj126.1 (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))
bnj126.2 (𝜓′[1o / 𝑛]𝜓)
bnj126.3 (𝜓″[𝐹 / 𝑓]𝜓′)
bnj126.4 𝐹 = {⟨∅, pred(𝑥, 𝐴, 𝑅)⟩}
Assertion
Ref Expression
bnj126 (𝜓″ ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 1o → (𝐹‘suc 𝑖) = 𝑦 ∈ (𝐹𝑖) pred(𝑦, 𝐴, 𝑅)))
Distinct variable groups:   𝐴,𝑓,𝑛   𝑓,𝐹,𝑖,𝑦   𝑅,𝑓,𝑛   𝑖,𝑛,𝑦
Allowed substitution hints:   𝜓(𝑥,𝑦,𝑓,𝑖,𝑛)   𝐴(𝑥,𝑦,𝑖)   𝑅(𝑥,𝑦,𝑖)   𝐹(𝑥,𝑛)   𝜓′(𝑥,𝑦,𝑓,𝑖,𝑛)   𝜓″(𝑥,𝑦,𝑓,𝑖,𝑛)

Proof of Theorem bnj126
StepHypRef Expression
1 bnj126.3 . 2 (𝜓″[𝐹 / 𝑓]𝜓′)
2 bnj126.2 . . 3 (𝜓′[1o / 𝑛]𝜓)
32sbcbii 3851 . 2 ([𝐹 / 𝑓]𝜓′[𝐹 / 𝑓][1o / 𝑛]𝜓)
4 bnj126.1 . . 3 (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))
5 bnj126.4 . . . 4 𝐹 = {⟨∅, pred(𝑥, 𝐴, 𝑅)⟩}
65bnj95 34856 . . 3 𝐹 ∈ V
74, 6bnj106 34860 . 2 ([𝐹 / 𝑓][1o / 𝑛]𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 1o → (𝐹‘suc 𝑖) = 𝑦 ∈ (𝐹𝑖) pred(𝑦, 𝐴, 𝑅)))
81, 3, 73bitri 297 1 (𝜓″ ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 1o → (𝐹‘suc 𝑖) = 𝑦 ∈ (𝐹𝑖) pred(𝑦, 𝐴, 𝑅)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206   = wceq 1536  wcel 2105  wral 3058  [wsbc 3790  c0 4338  {csn 4630  cop 4636   ciun 4995  suc csuc 6387  cfv 6562  ωcom 7886  1oc1o 8497   predc-bnj14 34680
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-sep 5301  ax-nul 5311  ax-pow 5370  ax-pr 5437
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-tru 1539  df-fal 1549  df-ex 1776  df-nf 1780  df-sb 2062  df-clab 2712  df-cleq 2726  df-clel 2813  df-nfc 2889  df-ral 3059  df-rex 3068  df-v 3479  df-sbc 3791  df-dif 3965  df-un 3967  df-ss 3979  df-nul 4339  df-pw 4606  df-sn 4631  df-pr 4633  df-uni 4912  df-iun 4997  df-br 5148  df-suc 6391  df-iota 6515  df-fv 6570  df-1o 8504
This theorem is referenced by:  bnj150  34868  bnj153  34872
  Copyright terms: Public domain W3C validator