Theorem opelf 6773

Description: The members of an ordered pair element of a mapping belong to the mapping's domain and codomain. (Contributed by NM, 10-Dec-2003.) (Revised by Mario Carneiro, 26-Apr-2015.)

Assertion

Ref	Expression
opelf	⊢ ((𝐹:𝐴⟶𝐵 ∧ ⟨𝐶, 𝐷⟩ ∈ 𝐹) → (𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐵))

Proof of Theorem opelf

Step	Hyp	Ref	Expression
1		fssxp 6767	. . . 4 ⊢ (𝐹:𝐴⟶𝐵 → 𝐹 ⊆ (𝐴 × 𝐵))
2	1	sseld 3912	. . 3 ⊢ (𝐹:𝐴⟶𝐵 → (⟨𝐶, 𝐷⟩ ∈ 𝐹 → ⟨𝐶, 𝐷⟩ ∈ (𝐴 × 𝐵)))
3		opelxp 5694	. . 3 ⊢ (⟨𝐶, 𝐷⟩ ∈ (𝐴 × 𝐵) ↔ (𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐵))
4	2, 3	imbitrdi 254	. 2 ⊢ (𝐹:𝐴⟶𝐵 → (⟨𝐶, 𝐷⟩ ∈ 𝐹 → (𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐵)))
5	4	imp 412	1 ⊢ ((𝐹:𝐴⟶𝐵 ∧ ⟨𝐶, 𝐷⟩ ∈ 𝐹) → (𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐵))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∈ wcel 2147  ⟨cop 4840   × cxp 5656  ⟶wf 6562

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735  ax-sep 5255  ax-pr 5398

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-br 5109  df-opab 5174  df-xp 5664  df-rel 5665  df-cnv 5666  df-dm 5668  df-rn 5669  df-fun 6568  df-fn 6569  df-f 6570

This theorem is used by:  feu  6788  fcnvres  6789  fsn  7168