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

Theorem bnj155 31287
 Description: Technical lemma for bnj153 31288. 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
bnj155.1 (𝜓1[𝑔 / 𝑓]𝜓′)
bnj155.2 (𝜓′ ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 1𝑜 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))
Assertion
Ref Expression
bnj155 (𝜓1 ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 1𝑜 → (𝑔‘suc 𝑖) = 𝑦 ∈ (𝑔𝑖) pred(𝑦, 𝐴, 𝑅)))
Distinct variable groups:   𝐴,𝑓   𝑅,𝑓   𝑓,𝑔,𝑖,𝑦
Allowed substitution hints:   𝐴(𝑦,𝑔,𝑖)   𝑅(𝑦,𝑔,𝑖)   𝜓′(𝑦,𝑓,𝑔,𝑖)   𝜓1(𝑦,𝑓,𝑔,𝑖)

Proof of Theorem bnj155
StepHypRef Expression
1 bnj155.1 . 2 (𝜓1[𝑔 / 𝑓]𝜓′)
2 bnj155.2 . . 3 (𝜓′ ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 1𝑜 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))
32sbcbii 3643 . 2 ([𝑔 / 𝑓]𝜓′[𝑔 / 𝑓]𝑖 ∈ ω (suc 𝑖 ∈ 1𝑜 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))
4 vex 3354 . . 3 𝑔 ∈ V
5 fveq1 6331 . . . . . 6 (𝑓 = 𝑔 → (𝑓‘suc 𝑖) = (𝑔‘suc 𝑖))
6 fveq1 6331 . . . . . . 7 (𝑓 = 𝑔 → (𝑓𝑖) = (𝑔𝑖))
76iuneq1d 4679 . . . . . 6 (𝑓 = 𝑔 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅) = 𝑦 ∈ (𝑔𝑖) pred(𝑦, 𝐴, 𝑅))
85, 7eqeq12d 2786 . . . . 5 (𝑓 = 𝑔 → ((𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅) ↔ (𝑔‘suc 𝑖) = 𝑦 ∈ (𝑔𝑖) pred(𝑦, 𝐴, 𝑅)))
98imbi2d 329 . . . 4 (𝑓 = 𝑔 → ((suc 𝑖 ∈ 1𝑜 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)) ↔ (suc 𝑖 ∈ 1𝑜 → (𝑔‘suc 𝑖) = 𝑦 ∈ (𝑔𝑖) pred(𝑦, 𝐴, 𝑅))))
109ralbidv 3135 . . 3 (𝑓 = 𝑔 → (∀𝑖 ∈ ω (suc 𝑖 ∈ 1𝑜 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)) ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 1𝑜 → (𝑔‘suc 𝑖) = 𝑦 ∈ (𝑔𝑖) pred(𝑦, 𝐴, 𝑅))))
114, 10sbcie 3622 . 2 ([𝑔 / 𝑓]𝑖 ∈ ω (suc 𝑖 ∈ 1𝑜 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)) ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 1𝑜 → (𝑔‘suc 𝑖) = 𝑦 ∈ (𝑔𝑖) pred(𝑦, 𝐴, 𝑅)))
121, 3, 113bitri 286 1 (𝜓1 ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 1𝑜 → (𝑔‘suc 𝑖) = 𝑦 ∈ (𝑔𝑖) pred(𝑦, 𝐴, 𝑅)))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 196   = wceq 1631   ∈ wcel 2145  ∀wral 3061  [wsbc 3587  ∪ ciun 4654  suc csuc 5868  ‘cfv 6031  ωcom 7212  1𝑜c1o 7706   predc-bnj14 31094 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1870  ax-4 1885  ax-5 1991  ax-6 2057  ax-7 2093  ax-9 2154  ax-10 2174  ax-11 2190  ax-12 2203  ax-13 2408  ax-ext 2751 This theorem depends on definitions:  df-bi 197  df-an 383  df-or 837  df-3an 1073  df-tru 1634  df-ex 1853  df-nf 1858  df-sb 2050  df-clab 2758  df-cleq 2764  df-clel 2767  df-nfc 2902  df-ral 3066  df-rex 3067  df-v 3353  df-sbc 3588  df-in 3730  df-ss 3737  df-uni 4575  df-iun 4656  df-br 4787  df-iota 5994  df-fv 6039 This theorem is referenced by:  bnj153  31288
 Copyright terms: Public domain W3C validator