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 35170
Description: Technical lemma for bnj150 35173. 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 3802 . 2 ([𝐹 / 𝑓]𝜓′[𝐹 / 𝑓][1o / 𝑛]𝜓)
4 bnj126.1 . . 3 (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))
5 bnj126.4 . . . 4 𝐹 = {⟨∅, pred(𝑥, 𝐴, 𝑅)⟩}
65bnj95 35161 . . 3 𝐹 ∈ V
74, 6bnj106 35165 . 2 ([𝐹 / 𝑓][1o / 𝑛]𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 1o → (𝐹‘suc 𝑖) = 𝑦 ∈ (𝐹𝑖) pred(𝑦, 𝐴, 𝑅)))
81, 3, 73bitri 299 1 (𝜓″ ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 1o → (𝐹‘suc 𝑖) = 𝑦 ∈ (𝐹𝑖) pred(𝑦, 𝐴, 𝑅)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208   = wceq 1562  wcel 2144  wral 3078  [wsbc 3746  c0 4287  {csn 4584  cop 4590   ciun 4951  suc csuc 6350  cfv 6523  ωcom 7848  1oc1o 8432   predc-bnj14 34986
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1817  ax-4 1831  ax-5 1932  ax-6 1989  ax-7 2030  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2214  ax-ext 2736  ax-sep 5248  ax-nul 5258  ax-pow 5324  ax-pr 5392
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-tru 1565  df-fal 1575  df-ex 1802  df-nf 1806  df-sb 2093  df-clab 2743  df-cleq 2756  df-clel 2839  df-nfc 2913  df-ral 3079  df-rex 3089  df-v 3458  df-sbc 3747  df-dif 3909  df-un 3911  df-ss 3923  df-nul 4288  df-pw 4559  df-sn 4585  df-pr 4587  df-uni 4868  df-iun 4953  df-br 5103  df-suc 6354  df-iota 6479  df-fv 6531  df-1o 8439
This theorem is referenced by:  bnj150  35173  bnj153  35177
  Copyright terms: Public domain W3C validator