Theorem elmpom 6396

Description: If a maps-to operation is inhabited, the first class it is defined with is inhabited. (Contributed by Jim Kingdon, 4-Mar-2026.)

Hypothesis

Ref	Expression
elmpoex.f	⊢ 𝐹 = (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶)

Assertion

Ref	Expression
elmpom	⊢ (𝐷 ∈ 𝐹 → ∃𝑧 𝑧 ∈ 𝐴)

Distinct variable groups:   𝑥,𝐴,𝑦   𝑧,𝐴   𝑥,𝐵,𝑦

Allowed substitution hints:   𝐵(𝑧)   𝐶(𝑥,𝑦,𝑧)   𝐷(𝑥,𝑦,𝑧)   𝐹(𝑥,𝑦,𝑧)

Proof of Theorem elmpom

Dummy variables 𝑟 𝑤 𝑠 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		elmpoex.f	. . . . . . . 8 ⊢ 𝐹 = (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶)
2		df-mpo 6016	. . . . . . . 8 ⊢ (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) = {⟨⟨𝑥, 𝑦⟩, 𝑟⟩ ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑟 = 𝐶)}
3	1, 2	eqtri 2250	. . . . . . 7 ⊢ 𝐹 = {⟨⟨𝑥, 𝑦⟩, 𝑟⟩ ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑟 = 𝐶)}
4	3	dmeqi 4928	. . . . . 6 ⊢ dom 𝐹 = dom {⟨⟨𝑥, 𝑦⟩, 𝑟⟩ ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑟 = 𝐶)}
5		dmoprabss 6096	. . . . . 6 ⊢ dom {⟨⟨𝑥, 𝑦⟩, 𝑟⟩ ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑟 = 𝐶)} ⊆ (𝐴 × 𝐵)
6	4, 5	eqsstri 3257	. . . . 5 ⊢ dom 𝐹 ⊆ (𝐴 × 𝐵)
7		2ndexg 6324	. . . . . . 7 ⊢ (𝐷 ∈ 𝐹 → (2nd ‘𝐷) ∈ V)
8	1	mpofun 6116	. . . . . . . . . . 11 ⊢ Fun 𝐹
9		funrel 5339	. . . . . . . . . . 11 ⊢ (Fun 𝐹 → Rel 𝐹)
10	8, 9	ax-mp 5	. . . . . . . . . 10 ⊢ Rel 𝐹
11		1st2nd 6337	. . . . . . . . . 10 ⊢ ((Rel 𝐹 ∧ 𝐷 ∈ 𝐹) → 𝐷 = ⟨(1st ‘𝐷), (2nd ‘𝐷)⟩)
12	10, 11	mpan 424	. . . . . . . . 9 ⊢ (𝐷 ∈ 𝐹 → 𝐷 = ⟨(1st ‘𝐷), (2nd ‘𝐷)⟩)
13	12	eleq1d 2298	. . . . . . . 8 ⊢ (𝐷 ∈ 𝐹 → (𝐷 ∈ 𝐹 ↔ ⟨(1st ‘𝐷), (2nd ‘𝐷)⟩ ∈ 𝐹))
14	13	ibi 176	. . . . . . 7 ⊢ (𝐷 ∈ 𝐹 → ⟨(1st ‘𝐷), (2nd ‘𝐷)⟩ ∈ 𝐹)
15		opeq2 3859	. . . . . . . 8 ⊢ (𝑠 = (2nd ‘𝐷) → ⟨(1st ‘𝐷), 𝑠⟩ = ⟨(1st ‘𝐷), (2nd ‘𝐷)⟩)
16	15	eleq1d 2298	. . . . . . 7 ⊢ (𝑠 = (2nd ‘𝐷) → (⟨(1st ‘𝐷), 𝑠⟩ ∈ 𝐹 ↔ ⟨(1st ‘𝐷), (2nd ‘𝐷)⟩ ∈ 𝐹))
17	7, 14, 16	elabd 2949	. . . . . 6 ⊢ (𝐷 ∈ 𝐹 → ∃𝑠⟨(1st ‘𝐷), 𝑠⟩ ∈ 𝐹)
18		1stexg 6323	. . . . . . 7 ⊢ (𝐷 ∈ 𝐹 → (1st ‘𝐷) ∈ V)
19		eldm2g 4923	. . . . . . 7 ⊢ ((1st ‘𝐷) ∈ V → ((1st ‘𝐷) ∈ dom 𝐹 ↔ ∃𝑠⟨(1st ‘𝐷), 𝑠⟩ ∈ 𝐹))
20	18, 19	syl 14	. . . . . 6 ⊢ (𝐷 ∈ 𝐹 → ((1st ‘𝐷) ∈ dom 𝐹 ↔ ∃𝑠⟨(1st ‘𝐷), 𝑠⟩ ∈ 𝐹))
21	17, 20	mpbird 167	. . . . 5 ⊢ (𝐷 ∈ 𝐹 → (1st ‘𝐷) ∈ dom 𝐹)
22	6, 21	sselid 3223	. . . 4 ⊢ (𝐷 ∈ 𝐹 → (1st ‘𝐷) ∈ (𝐴 × 𝐵))
23		elex2 2817	. . . 4 ⊢ ((1st ‘𝐷) ∈ (𝐴 × 𝐵) → ∃𝑟 𝑟 ∈ (𝐴 × 𝐵))
24	22, 23	syl 14	. . 3 ⊢ (𝐷 ∈ 𝐹 → ∃𝑟 𝑟 ∈ (𝐴 × 𝐵))
25		xpm 5154	. . 3 ⊢ ((∃𝑧 𝑧 ∈ 𝐴 ∧ ∃𝑤 𝑤 ∈ 𝐵) ↔ ∃𝑟 𝑟 ∈ (𝐴 × 𝐵))
26	24, 25	sylibr 134	. 2 ⊢ (𝐷 ∈ 𝐹 → (∃𝑧 𝑧 ∈ 𝐴 ∧ ∃𝑤 𝑤 ∈ 𝐵))
27	26	simpld 112	1 ⊢ (𝐷 ∈ 𝐹 → ∃𝑧 𝑧 ∈ 𝐴)

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1395  ∃wex 1538   ∈ wcel 2200  Vcvv 2800  ⟨cop 3670   × cxp 4719  dom cdm 4721  Rel wrel 4726  Fun wfun 5316  ‘cfv 5322  {coprab 6012   ∈ cmpo 6013  1^st c1st 6294  2^nd c2nd 6295

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 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-sep 4203  ax-pow 4260  ax-pr 4295  ax-un 4526

This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-v 2802  df-sbc 3030  df-un 3202  df-in 3204  df-ss 3211  df-pw 3652  df-sn 3673  df-pr 3674  df-op 3676  df-uni 3890  df-br 4085  df-opab 4147  df-mpt 4148  df-id 4386  df-xp 4727  df-rel 4728  df-cnv 4729  df-co 4730  df-dm 4731  df-rn 4732  df-iota 5282  df-fun 5324  df-fn 5325  df-f 5326  df-fo 5328  df-fv 5330  df-oprab 6015  df-mpo 6016  df-1st 6296  df-2nd 6297

This theorem is referenced by:  clwwlknonmpo  16213