Theorem bnj934 32964

Description: Technical lemma for bnj69 33039. 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
bnj934.1	⊢ (𝜑 ↔ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅))
bnj934.4	⊢ (𝜑′ ↔ [𝑝 / 𝑛]𝜑)
bnj934.7	⊢ (𝜑″ ↔ [𝐺 / 𝑓]𝜑′)
bnj934.50	⊢ 𝐺 ∈ V

Assertion

Ref	Expression
bnj934	⊢ ((𝜑 ∧ (𝐺‘∅) = (𝑓‘∅)) → 𝜑″)

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

Allowed substitution hints:   𝜑(𝑓,𝑛,𝑝)   𝐴(𝑝)   𝑅(𝑝)   𝐺(𝑓,𝑛,𝑝)   𝑋(𝑝)   𝜑′(𝑓,𝑛,𝑝)   𝜑″(𝑓,𝑛,𝑝)

Proof of Theorem bnj934

Step	Hyp	Ref	Expression
1		bnj934.1	. . . 4 ⊢ (𝜑 ↔ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅))
2		eqtr 2759	. . . 4 ⊢ (((𝐺‘∅) = (𝑓‘∅) ∧ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅)) → (𝐺‘∅) = pred(𝑋, 𝐴, 𝑅))
3	1, 2	sylan2b 595	. . 3 ⊢ (((𝐺‘∅) = (𝑓‘∅) ∧ 𝜑) → (𝐺‘∅) = pred(𝑋, 𝐴, 𝑅))
4		bnj934.7	. . . . 5 ⊢ (𝜑″ ↔ [𝐺 / 𝑓]𝜑′)
5		bnj934.4	. . . . . . . 8 ⊢ (𝜑′ ↔ [𝑝 / 𝑛]𝜑)
6		vex 3441	. . . . . . . 8 ⊢ 𝑝 ∈ V
7	1, 5, 6	bnj523 32916	. . . . . . 7 ⊢ (𝜑′ ↔ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅))
8	7, 1	bitr4i 278	. . . . . 6 ⊢ (𝜑′ ↔ 𝜑)
9	8	sbcbii 3781	. . . . 5 ⊢ ([𝐺 / 𝑓]𝜑′ ↔ [𝐺 / 𝑓]𝜑)
10	4, 9	bitri 275	. . . 4 ⊢ (𝜑″ ↔ [𝐺 / 𝑓]𝜑)
11		bnj934.50	. . . 4 ⊢ 𝐺 ∈ V
12	1, 10, 11	bnj609 32946	. . 3 ⊢ (𝜑″ ↔ (𝐺‘∅) = pred(𝑋, 𝐴, 𝑅))
13	3, 12	sylibr 233	. 2 ⊢ (((𝐺‘∅) = (𝑓‘∅) ∧ 𝜑) → 𝜑″)
14	13	ancoms 460	1 ⊢ ((𝜑 ∧ (𝐺‘∅) = (𝑓‘∅)) → 𝜑″)

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 397   = wceq 1539   ∈ wcel 2104  Vcvv 3437  [wsbc 3721  ∅c0 4262  ‘cfv 6458   predc-bnj14 32716

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 1911  ax-6 1969  ax-7 2009  ax-8 2106  ax-9 2114  ax-ext 2707

This theorem depends on definitions:  df-bi 206  df-an 398  df-tru 1542  df-ex 1780  df-sb 2066  df-clab 2714  df-cleq 2728  df-clel 2814  df-v 3439  df-sbc 3722  df-in 3899  df-ss 3909  df-uni 4845  df-br 5082  df-iota 6410  df-fv 6466

This theorem is referenced by:  bnj929  32965