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

Theorem bnj92 32039
 Description: First-order logic and set theory. (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (New usage is discouraged.)
Hypotheses
Ref Expression
bnj92.1 (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))
bnj92.2 𝑍 ∈ V
Assertion
Ref Expression
bnj92 ([𝑍 / 𝑛]𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖𝑍 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))
Distinct variable groups:   𝐴,𝑛   𝑅,𝑛   𝑖,𝑍   𝑓,𝑛   𝑖,𝑛   𝑦,𝑛
Allowed substitution hints:   𝜓(𝑦,𝑓,𝑖,𝑛)   𝐴(𝑦,𝑓,𝑖)   𝑅(𝑦,𝑓,𝑖)   𝑍(𝑦,𝑓,𝑛)

Proof of Theorem bnj92
StepHypRef Expression
1 bnj92.1 . . 3 (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))
21sbcbii 3833 . 2 ([𝑍 / 𝑛]𝜓[𝑍 / 𝑛]𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))
3 bnj92.2 . . 3 𝑍 ∈ V
43bnj538 31916 . 2 ([𝑍 / 𝑛]𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)) ↔ ∀𝑖 ∈ ω [𝑍 / 𝑛](suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))
5 sbcimg 3824 . . . . 5 (𝑍 ∈ V → ([𝑍 / 𝑛](suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)) ↔ ([𝑍 / 𝑛]suc 𝑖𝑛[𝑍 / 𝑛](𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅))))
63, 5ax-mp 5 . . . 4 ([𝑍 / 𝑛](suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)) ↔ ([𝑍 / 𝑛]suc 𝑖𝑛[𝑍 / 𝑛](𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))
7 sbcel2gv 3845 . . . . . 6 (𝑍 ∈ V → ([𝑍 / 𝑛]suc 𝑖𝑛 ↔ suc 𝑖𝑍))
83, 7ax-mp 5 . . . . 5 ([𝑍 / 𝑛]suc 𝑖𝑛 ↔ suc 𝑖𝑍)
93bnj525 31914 . . . . 5 ([𝑍 / 𝑛](𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅) ↔ (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅))
108, 9imbi12i 352 . . . 4 (([𝑍 / 𝑛]suc 𝑖𝑛[𝑍 / 𝑛](𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)) ↔ (suc 𝑖𝑍 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))
116, 10bitri 276 . . 3 ([𝑍 / 𝑛](suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)) ↔ (suc 𝑖𝑍 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))
1211ralbii 3170 . 2 (∀𝑖 ∈ ω [𝑍 / 𝑛](suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)) ↔ ∀𝑖 ∈ ω (suc 𝑖𝑍 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))
132, 4, 123bitri 298 1 ([𝑍 / 𝑛]𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖𝑍 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 207   = wceq 1530   ∈ wcel 2107  ∀wral 3143  Vcvv 3500  [wsbc 3776  ∪ ciun 4917  suc csuc 6192  ‘cfv 6354  ωcom 7573   predc-bnj14 31863 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1904  ax-6 1963  ax-7 2008  ax-8 2109  ax-9 2117  ax-10 2138  ax-11 2153  ax-12 2169  ax-ext 2798 This theorem depends on definitions:  df-bi 208  df-an 397  df-or 844  df-3an 1083  df-tru 1533  df-ex 1774  df-nf 1778  df-sb 2063  df-clab 2805  df-cleq 2819  df-clel 2898  df-nfc 2968  df-ral 3148  df-v 3502  df-sbc 3777 This theorem is referenced by:  bnj106  32045  bnj153  32057
 Copyright terms: Public domain W3C validator