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

Theorem bnj222 32150
Description: Technical lemma for bnj229 32151. 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.)
Hypothesis
Ref Expression
bnj222.1 (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖𝑁 → (𝐹‘suc 𝑖) = 𝑦 ∈ (𝐹𝑖) pred(𝑦, 𝐴, 𝑅)))
Assertion
Ref Expression
bnj222 (𝜓 ↔ ∀𝑚 ∈ ω (suc 𝑚𝑁 → (𝐹‘suc 𝑚) = 𝑦 ∈ (𝐹𝑚) pred(𝑦, 𝐴, 𝑅)))
Distinct variable groups:   𝐴,𝑖,𝑚   𝑖,𝐹,𝑚,𝑦   𝑖,𝑁,𝑚   𝑅,𝑖,𝑚
Allowed substitution hints:   𝜓(𝑦,𝑖,𝑚)   𝐴(𝑦)   𝑅(𝑦)   𝑁(𝑦)

Proof of Theorem bnj222
StepHypRef Expression
1 bnj222.1 . 2 (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖𝑁 → (𝐹‘suc 𝑖) = 𝑦 ∈ (𝐹𝑖) pred(𝑦, 𝐴, 𝑅)))
2 suceq 6251 . . . . 5 (𝑖 = 𝑚 → suc 𝑖 = suc 𝑚)
32eleq1d 2897 . . . 4 (𝑖 = 𝑚 → (suc 𝑖𝑁 ↔ suc 𝑚𝑁))
42fveq2d 6669 . . . . 5 (𝑖 = 𝑚 → (𝐹‘suc 𝑖) = (𝐹‘suc 𝑚))
5 fveq2 6665 . . . . . 6 (𝑖 = 𝑚 → (𝐹𝑖) = (𝐹𝑚))
65bnj1113 32052 . . . . 5 (𝑖 = 𝑚 𝑦 ∈ (𝐹𝑖) pred(𝑦, 𝐴, 𝑅) = 𝑦 ∈ (𝐹𝑚) pred(𝑦, 𝐴, 𝑅))
74, 6eqeq12d 2837 . . . 4 (𝑖 = 𝑚 → ((𝐹‘suc 𝑖) = 𝑦 ∈ (𝐹𝑖) pred(𝑦, 𝐴, 𝑅) ↔ (𝐹‘suc 𝑚) = 𝑦 ∈ (𝐹𝑚) pred(𝑦, 𝐴, 𝑅)))
83, 7imbi12d 347 . . 3 (𝑖 = 𝑚 → ((suc 𝑖𝑁 → (𝐹‘suc 𝑖) = 𝑦 ∈ (𝐹𝑖) pred(𝑦, 𝐴, 𝑅)) ↔ (suc 𝑚𝑁 → (𝐹‘suc 𝑚) = 𝑦 ∈ (𝐹𝑚) pred(𝑦, 𝐴, 𝑅))))
98cbvralvw 3450 . 2 (∀𝑖 ∈ ω (suc 𝑖𝑁 → (𝐹‘suc 𝑖) = 𝑦 ∈ (𝐹𝑖) pred(𝑦, 𝐴, 𝑅)) ↔ ∀𝑚 ∈ ω (suc 𝑚𝑁 → (𝐹‘suc 𝑚) = 𝑦 ∈ (𝐹𝑚) pred(𝑦, 𝐴, 𝑅)))
101, 9bitri 277 1 (𝜓 ↔ ∀𝑚 ∈ ω (suc 𝑚𝑁 → (𝐹‘suc 𝑚) = 𝑦 ∈ (𝐹𝑚) pred(𝑦, 𝐴, 𝑅)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208   = wceq 1533  wcel 2110  wral 3138   ciun 4912  suc csuc 6188  cfv 6350  ωcom 7574   predc-bnj14 31953
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2156  ax-12 2172  ax-ext 2793
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ral 3143  df-rex 3144  df-rab 3147  df-v 3497  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-nul 4292  df-if 4468  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4833  df-iun 4914  df-br 5060  df-suc 6192  df-iota 6309  df-fv 6358
This theorem is referenced by:  bnj229  32151  bnj589  32176
  Copyright terms: Public domain W3C validator