Theorem bnj609 35079

Description: Technical lemma for bnj852 35083. 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
bnj609.1	⊢ (𝜑 ↔ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅))
bnj609.2	⊢ (𝜑″ ↔ [𝐺 / 𝑓]𝜑)
bnj609.3	⊢ 𝐺 ∈ V

Assertion

Ref	Expression
bnj609	⊢ (𝜑″ ↔ (𝐺‘∅) = pred(𝑋, 𝐴, 𝑅))

Distinct variable groups:   𝐴,𝑓   𝑅,𝑓   𝑓,𝑋

Allowed substitution hints:   𝜑(𝑓)   𝐺(𝑓)   𝜑″(𝑓)

Proof of Theorem bnj609

Dummy variable 𝑒 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		bnj609.2	. 2 ⊢ (𝜑″ ↔ [𝐺 / 𝑓]𝜑)
2		bnj609.3	. . 3 ⊢ 𝐺 ∈ V
3		dfsbcq 3731	. . 3 ⊢ (𝑒 = 𝐺 → ([𝑒 / 𝑓]𝜑 ↔ [𝐺 / 𝑓]𝜑))
4		fveq1 6835	. . . 4 ⊢ (𝑒 = 𝐺 → (𝑒‘∅) = (𝐺‘∅))
5	4	eqeq1d 2739	. . 3 ⊢ (𝑒 = 𝐺 → ((𝑒‘∅) = pred(𝑋, 𝐴, 𝑅) ↔ (𝐺‘∅) = pred(𝑋, 𝐴, 𝑅)))
6		bnj609.1	. . . . 5 ⊢ (𝜑 ↔ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅))
7	6	sbcbii 3786	. . . 4 ⊢ ([𝑒 / 𝑓]𝜑 ↔ [𝑒 / 𝑓](𝑓‘∅) = pred(𝑋, 𝐴, 𝑅))
8		vex 3434	. . . . 5 ⊢ 𝑒 ∈ V
9		fveq1 6835	. . . . . 6 ⊢ (𝑓 = 𝑒 → (𝑓‘∅) = (𝑒‘∅))
10	9	eqeq1d 2739	. . . . 5 ⊢ (𝑓 = 𝑒 → ((𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ↔ (𝑒‘∅) = pred(𝑋, 𝐴, 𝑅)))
11	8, 10	sbcie 3771	. . . 4 ⊢ ([𝑒 / 𝑓](𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ↔ (𝑒‘∅) = pred(𝑋, 𝐴, 𝑅))
12	7, 11	bitri 275	. . 3 ⊢ ([𝑒 / 𝑓]𝜑 ↔ (𝑒‘∅) = pred(𝑋, 𝐴, 𝑅))
13	2, 3, 5, 12	vtoclb 3513	. 2 ⊢ ([𝐺 / 𝑓]𝜑 ↔ (𝐺‘∅) = pred(𝑋, 𝐴, 𝑅))
14	1, 13	bitri 275	1 ⊢ (𝜑″ ↔ (𝐺‘∅) = pred(𝑋, 𝐴, 𝑅))

Syntax hints:   ↔ wb 206   = wceq 1542   ∈ wcel 2114  Vcvv 3430  [wsbc 3729  ∅c0 4274  ‘cfv 6494   predc-bnj14 34851

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-ext 2709

This theorem depends on definitions:  df-bi 207  df-an 396  df-tru 1545  df-ex 1782  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-v 3432  df-sbc 3730  df-ss 3907  df-uni 4852  df-br 5087  df-iota 6450  df-fv 6502

This theorem is referenced by:  bnj600  35081  bnj908  35093  bnj934  35097