Theorem opelf 6736

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 6730	. . . 4 ⊢ (𝐹:𝐴⟶𝐵 → 𝐹 ⊆ (𝐴 × 𝐵))
2	1	sseld 3930	. . 3 ⊢ (𝐹:𝐴⟶𝐵 → (⟨𝐶, 𝐷⟩ ∈ 𝐹 → ⟨𝐶, 𝐷⟩ ∈ (𝐴 × 𝐵)))
3		opelxp 5691	. . 3 ⊢ (⟨𝐶, 𝐷⟩ ∈ (𝐴 × 𝐵) ↔ (𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐵))
4	2, 3	imbitrdi 254	. 2 ⊢ (𝐹:𝐴⟶𝐵 → (⟨𝐶, 𝐷⟩ ∈ 𝐹 → (𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐵)))
5	4	imp 412	1 ⊢ ((𝐹:𝐴⟶𝐵 ∧ ⟨𝐶, 𝐷⟩ ∈ 𝐹) → (𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐵))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∈ wcel 2145  ⟨cop 4590   × cxp 5653  ⟶wf 6529

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2732  ax-sep 5251  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 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-br 5104  df-opab 5168  df-xp 5661  df-rel 5662  df-cnv 5663  df-dm 5665  df-rn 5666  df-fun 6535  df-fn 6536  df-f 6537

This theorem is used by:  feu  6751  fcnvres  6752  fsn  7129