Theorem opeldm 4869

Description: Membership of first of an ordered pair in a domain. (Contributed by NM, 30-Jul-1995.)

Hypotheses

Ref	Expression
opeldm.1	⊢ 𝐴 ∈ V
opeldm.2	⊢ 𝐵 ∈ V

Assertion

Ref	Expression
opeldm	⊢ (⟨𝐴, 𝐵⟩ ∈ 𝐶 → 𝐴 ∈ dom 𝐶)

Proof of Theorem opeldm

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		opeldm.2	. . 3 ⊢ 𝐵 ∈ V
2		opeq2 3809	. . . 4 ⊢ (𝑦 = 𝐵 → ⟨𝐴, 𝑦⟩ = ⟨𝐴, 𝐵⟩)
3	2	eleq1d 2265	. . 3 ⊢ (𝑦 = 𝐵 → (⟨𝐴, 𝑦⟩ ∈ 𝐶 ↔ ⟨𝐴, 𝐵⟩ ∈ 𝐶))
4	1, 3	spcev 2859	. 2 ⊢ (⟨𝐴, 𝐵⟩ ∈ 𝐶 → ∃𝑦⟨𝐴, 𝑦⟩ ∈ 𝐶)
5		opeldm.1	. . 3 ⊢ 𝐴 ∈ V
6	5	eldm2 4864	. 2 ⊢ (𝐴 ∈ dom 𝐶 ↔ ∃𝑦⟨𝐴, 𝑦⟩ ∈ 𝐶)
7	4, 6	sylibr 134	1 ⊢ (⟨𝐴, 𝐵⟩ ∈ 𝐶 → 𝐴 ∈ dom 𝐶)

Syntax hints:   → wi 4   = wceq 1364  ∃wex 1506   ∈ wcel 2167  Vcvv 2763  ⟨cop 3625  dom cdm 4663

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-ext 2178

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1475  df-sb 1777  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-v 2765  df-un 3161  df-sn 3628  df-pr 3629  df-op 3631  df-br 4034  df-dm 4673

This theorem is referenced by:  breldm  4870  elreldm  4892  relssres  4984  iss  4992  imadmrn  5019  dfco2a  5170  funssres  5300  funun  5302  iinerm  6666