Theorem bnj91 35258

Description: First-order logic and set theory. (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (New usage is discouraged.)

Hypotheses

Ref	Expression
bnj91.1	⊢ (𝜑 ↔ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅))
bnj91.2	⊢ 𝑍 ∈ V

Assertion

Ref	Expression
bnj91	⊢ ([𝑍 / 𝑦]𝜑 ↔ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅))

Distinct variable groups:   𝑦,𝐴   𝑦,𝑅   𝑦,𝑓   𝑥,𝑦

Allowed substitution hints:   𝜑(𝑥, 𝑦, 𝑓)   𝐴(𝑥, 𝑓)   𝑅(𝑥, 𝑓)   𝑍(𝑥, 𝑦, 𝑓)

Proof of Theorem bnj91

Step	Hyp	Ref	Expression
1		bnj91.1	. . 3 ⊢ (𝜑 ↔ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅))
2	1	sbcbii 3799	. 2 ⊢ ([𝑍 / 𝑦]𝜑 ↔ [𝑍 / 𝑦](𝑓‘∅) = pred(𝑥, 𝐴, 𝑅))
3		bnj91.2	. . 3 ⊢ 𝑍 ∈ V
4	3	bnj525 35136	. 2 ⊢ ([𝑍 / 𝑦](𝑓‘∅) = pred(𝑥, 𝐴, 𝑅) ↔ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅))
5	2, 4	bitri 278	1 ⊢ ([𝑍 / 𝑦]𝜑 ↔ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅))

This proof depends on syntax axioms:   ↔ wb 209   = wceq 1569   ∈ wcel 2142  Vcvv 3454  [wsbc 3743  ∅c0 4285  ‘cfv 6536   predc-bnj14 35086

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-ext 2734

This proof depends on definitions:  df-bi 210  df-an 401  df-tru 1572  df-ex 1809  df-sb 2096  df-clab 2741  df-cleq 2754  df-clel 2837  df-sbc 3744

This theorem is used by:  bnj118  35266  bnj125  35269