Users' Mathboxes 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 34876
Description: Technical lemma for bnj153 34877. 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 𝑖 ∈ 1o → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))
Assertion
Ref Expression
bnj155 (𝜓1 ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 1o → (𝑔‘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 𝑖 ∈ 1o → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))
32sbcbii 3813 . 2 ([𝑔 / 𝑓]𝜓′[𝑔 / 𝑓]𝑖 ∈ ω (suc 𝑖 ∈ 1o → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))
4 vex 3454 . . 3 𝑔 ∈ V
5 fveq1 6860 . . . . . 6 (𝑓 = 𝑔 → (𝑓‘suc 𝑖) = (𝑔‘suc 𝑖))
6 fveq1 6860 . . . . . . 7 (𝑓 = 𝑔 → (𝑓𝑖) = (𝑔𝑖))
76iuneq1d 4986 . . . . . 6 (𝑓 = 𝑔 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅) = 𝑦 ∈ (𝑔𝑖) pred(𝑦, 𝐴, 𝑅))
85, 7eqeq12d 2746 . . . . 5 (𝑓 = 𝑔 → ((𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅) ↔ (𝑔‘suc 𝑖) = 𝑦 ∈ (𝑔𝑖) pred(𝑦, 𝐴, 𝑅)))
98imbi2d 340 . . . 4 (𝑓 = 𝑔 → ((suc 𝑖 ∈ 1o → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)) ↔ (suc 𝑖 ∈ 1o → (𝑔‘suc 𝑖) = 𝑦 ∈ (𝑔𝑖) pred(𝑦, 𝐴, 𝑅))))
109ralbidv 3157 . . 3 (𝑓 = 𝑔 → (∀𝑖 ∈ ω (suc 𝑖 ∈ 1o → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)) ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 1o → (𝑔‘suc 𝑖) = 𝑦 ∈ (𝑔𝑖) pred(𝑦, 𝐴, 𝑅))))
114, 10sbcie 3798 . 2 ([𝑔 / 𝑓]𝑖 ∈ ω (suc 𝑖 ∈ 1o → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)) ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 1o → (𝑔‘suc 𝑖) = 𝑦 ∈ (𝑔𝑖) pred(𝑦, 𝐴, 𝑅)))
121, 3, 113bitri 297 1 (𝜓1 ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 1o → (𝑔‘suc 𝑖) = 𝑦 ∈ (𝑔𝑖) pred(𝑦, 𝐴, 𝑅)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206   = wceq 1540  wcel 2109  wral 3045  [wsbc 3756   ciun 4958  suc csuc 6337  cfv 6514  ωcom 7845  1oc1o 8430   predc-bnj14 34685
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-ext 2702
This theorem depends on definitions:  df-bi 207  df-an 396  df-tru 1543  df-ex 1780  df-sb 2066  df-clab 2709  df-cleq 2722  df-clel 2804  df-ral 3046  df-rex 3055  df-v 3452  df-sbc 3757  df-ss 3934  df-uni 4875  df-iun 4960  df-br 5111  df-iota 6467  df-fv 6522
This theorem is referenced by:  bnj153  34877
  Copyright terms: Public domain W3C validator