Theorem bnj523 35517

Description: Technical lemma for bnj852 35551. 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
bnj523.1	⊢ (𝜑 ↔ (𝐹‘∅) = pred(𝑋, 𝐴, 𝑅))
bnj523.2	⊢ (𝜑′ ↔ [𝑀 / 𝑛]𝜑)
bnj523.3	⊢ 𝑀 ∈ V

Assertion

Ref	Expression
bnj523	⊢ (𝜑′ ↔ (𝐹‘∅) = pred(𝑋, 𝐴, 𝑅))

Distinct variable groups:   𝐴,𝑛   𝑛,𝐹   𝑅,𝑛   𝑛,𝑋

Allowed substitution hints:   𝜑(𝑛)   𝑀(𝑛)   𝜑′(𝑛)

Proof of Theorem bnj523

Step	Hyp	Ref	Expression
1		bnj523.2	. 2 ⊢ (𝜑′ ↔ [𝑀 / 𝑛]𝜑)
2		bnj523.1	. . 3 ⊢ (𝜑 ↔ (𝐹‘∅) = pred(𝑋, 𝐴, 𝑅))
3	2	sbcbii 3794	. 2 ⊢ ([𝑀 / 𝑛]𝜑 ↔ [𝑀 / 𝑛](𝐹‘∅) = pred(𝑋, 𝐴, 𝑅))
4		bnj523.3	. . 3 ⊢ 𝑀 ∈ V
5	4	bnj525 35369	. 2 ⊢ ([𝑀 / 𝑛](𝐹‘∅) = pred(𝑋, 𝐴, 𝑅) ↔ (𝐹‘∅) = pred(𝑋, 𝐴, 𝑅))
6	1, 3, 5	3bitri 300	1 ⊢ (𝜑′ ↔ (𝐹‘∅) = pred(𝑋, 𝐴, 𝑅))

This proof depends on syntax axioms:   ↔ wb 209   = wceq 1569   ∈ wcel 2144  Vcvv 3450  [wsbc 3738  ∅c0 4278  ‘cfv 6538   predc-bnj14 35319

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1572  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-sbc 3739

This theorem is used by:  bnj600  35549  bnj908  35561  bnj934  35565