Theorem bnj1422 32717

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

Hypotheses

Ref	Expression
bnj1422.1	⊢ (𝜑 → Fun 𝐴)
bnj1422.2	⊢ (𝜑 → dom 𝐴 = 𝐵)

Assertion

Ref	Expression
bnj1422	⊢ (𝜑 → 𝐴 Fn 𝐵)

Proof of Theorem bnj1422

Step	Hyp	Ref	Expression
1		bnj1422.1	. 2 ⊢ (𝜑 → Fun 𝐴)
2		bnj1422.2	. 2 ⊢ (𝜑 → dom 𝐴 = 𝐵)
3		df-fn 6421	. 2 ⊢ (𝐴 Fn 𝐵 ↔ (Fun 𝐴 ∧ dom 𝐴 = 𝐵))
4	1, 2, 3	sylanbrc 582	1 ⊢ (𝜑 → 𝐴 Fn 𝐵)

Syntax hints:   → wi 4   = wceq 1539  dom cdm 5580  Fun wfun 6412   Fn wfn 6413

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8

This theorem depends on definitions:  df-bi 206  df-an 396  df-fn 6421

This theorem is referenced by:  bnj150  32756  bnj535  32770  bnj1312  32938  bnj60  32942