Theorem oprssdmm 6405

Description: Domain of closure of an operation. (Contributed by Jim Kingdon, 23-Oct-2023.)

Hypotheses

Ref	Expression
oprssdmm.m	⊢ ((𝜑 ∧ 𝑢 ∈ 𝑆) → ∃𝑣 𝑣 ∈ 𝑢)
oprssdmm.cl	⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥𝐹𝑦) ∈ 𝑆)
oprssdmm.f	⊢ (𝜑 → Rel 𝐹)

Assertion

Ref	Expression
oprssdmm	⊢ (𝜑 → (𝑆 × 𝑆) ⊆ dom 𝐹)

Distinct variable groups:   𝑢,𝐹,𝑣,𝑥,𝑦   𝑢,𝑆,𝑥,𝑦   𝜑,𝑢,𝑥,𝑦

Allowed substitution hints:   𝜑(𝑣)   𝑆(𝑣)

Proof of Theorem oprssdmm

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		elxp6 6403	. . . . . . 7 ⊢ (𝑧 ∈ (𝑆 × 𝑆) ↔ (𝑧 = ⟨(1st ‘𝑧), (2nd ‘𝑧)⟩ ∧ ((1st ‘𝑧) ∈ 𝑆 ∧ (2nd ‘𝑧) ∈ 𝑆)))
2	1	biimpi 120	. . . . . 6 ⊢ (𝑧 ∈ (𝑆 × 𝑆) → (𝑧 = ⟨(1st ‘𝑧), (2nd ‘𝑧)⟩ ∧ ((1st ‘𝑧) ∈ 𝑆 ∧ (2nd ‘𝑧) ∈ 𝑆)))
3	2	adantl 277	. . . . 5 ⊢ ((𝜑 ∧ 𝑧 ∈ (𝑆 × 𝑆)) → (𝑧 = ⟨(1st ‘𝑧), (2nd ‘𝑧)⟩ ∧ ((1st ‘𝑧) ∈ 𝑆 ∧ (2nd ‘𝑧) ∈ 𝑆)))
4	3	simpld 112	. . . 4 ⊢ ((𝜑 ∧ 𝑧 ∈ (𝑆 × 𝑆)) → 𝑧 = ⟨(1st ‘𝑧), (2nd ‘𝑧)⟩)
5	3	simprd 114	. . . . 5 ⊢ ((𝜑 ∧ 𝑧 ∈ (𝑆 × 𝑆)) → ((1st ‘𝑧) ∈ 𝑆 ∧ (2nd ‘𝑧) ∈ 𝑆))
6		oprssdmm.f	. . . . . . . . 9 ⊢ (𝜑 → Rel 𝐹)
7	6	adantr 276	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → Rel 𝐹)
8		eleq2 2302	. . . . . . . . . 10 ⊢ (𝑢 = (𝐹‘⟨𝑥, 𝑦⟩) → (𝑣 ∈ 𝑢 ↔ 𝑣 ∈ (𝐹‘⟨𝑥, 𝑦⟩)))
9	8	exbidv 1878	. . . . . . . . 9 ⊢ (𝑢 = (𝐹‘⟨𝑥, 𝑦⟩) → (∃𝑣 𝑣 ∈ 𝑢 ↔ ∃𝑣 𝑣 ∈ (𝐹‘⟨𝑥, 𝑦⟩)))
10		oprssdmm.m	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑢 ∈ 𝑆) → ∃𝑣 𝑣 ∈ 𝑢)
11	10	ralrimiva 2623	. . . . . . . . . 10 ⊢ (𝜑 → ∀𝑢 ∈ 𝑆 ∃𝑣 𝑣 ∈ 𝑢)
12	11	adantr 276	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → ∀𝑢 ∈ 𝑆 ∃𝑣 𝑣 ∈ 𝑢)
13		df-ov 6088	. . . . . . . . . 10 ⊢ (𝑥𝐹𝑦) = (𝐹‘⟨𝑥, 𝑦⟩)
14		oprssdmm.cl	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥𝐹𝑦) ∈ 𝑆)
15	13, 14	eqeltrrid 2326	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝐹‘⟨𝑥, 𝑦⟩) ∈ 𝑆)
16	9, 12, 15	rspcdva 2934	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → ∃𝑣 𝑣 ∈ (𝐹‘⟨𝑥, 𝑦⟩))
17		relelfvdm 5727	. . . . . . . . . 10 ⊢ ((Rel 𝐹 ∧ 𝑣 ∈ (𝐹‘⟨𝑥, 𝑦⟩)) → ⟨𝑥, 𝑦⟩ ∈ dom 𝐹)
18	17	ex 115	. . . . . . . . 9 ⊢ (Rel 𝐹 → (𝑣 ∈ (𝐹‘⟨𝑥, 𝑦⟩) → ⟨𝑥, 𝑦⟩ ∈ dom 𝐹))
19	18	exlimdv 1872	. . . . . . . 8 ⊢ (Rel 𝐹 → (∃𝑣 𝑣 ∈ (𝐹‘⟨𝑥, 𝑦⟩) → ⟨𝑥, 𝑦⟩ ∈ dom 𝐹))
20	7, 16, 19	sylc 62	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → ⟨𝑥, 𝑦⟩ ∈ dom 𝐹)
21	20	ralrimivva 2632	. . . . . 6 ⊢ (𝜑 → ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 ⟨𝑥, 𝑦⟩ ∈ dom 𝐹)
22	21	adantr 276	. . . . 5 ⊢ ((𝜑 ∧ 𝑧 ∈ (𝑆 × 𝑆)) → ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 ⟨𝑥, 𝑦⟩ ∈ dom 𝐹)
23		opeq1 3904	. . . . . . 7 ⊢ (𝑥 = (1st ‘𝑧) → ⟨𝑥, 𝑦⟩ = ⟨(1st ‘𝑧), 𝑦⟩)
24	23	eleq1d 2307	. . . . . 6 ⊢ (𝑥 = (1st ‘𝑧) → (⟨𝑥, 𝑦⟩ ∈ dom 𝐹 ↔ ⟨(1st ‘𝑧), 𝑦⟩ ∈ dom 𝐹))
25		opeq2 3905	. . . . . . 7 ⊢ (𝑦 = (2nd ‘𝑧) → ⟨(1st ‘𝑧), 𝑦⟩ = ⟨(1st ‘𝑧), (2nd ‘𝑧)⟩)
26	25	eleq1d 2307	. . . . . 6 ⊢ (𝑦 = (2nd ‘𝑧) → (⟨(1st ‘𝑧), 𝑦⟩ ∈ dom 𝐹 ↔ ⟨(1st ‘𝑧), (2nd ‘𝑧)⟩ ∈ dom 𝐹))
27	24, 26	rspc2va 2944	. . . . 5 ⊢ ((((1st ‘𝑧) ∈ 𝑆 ∧ (2nd ‘𝑧) ∈ 𝑆) ∧ ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 ⟨𝑥, 𝑦⟩ ∈ dom 𝐹) → ⟨(1st ‘𝑧), (2nd ‘𝑧)⟩ ∈ dom 𝐹)
28	5, 22, 27	syl2anc 415	. . . 4 ⊢ ((𝜑 ∧ 𝑧 ∈ (𝑆 × 𝑆)) → ⟨(1st ‘𝑧), (2nd ‘𝑧)⟩ ∈ dom 𝐹)
29	4, 28	eqeltrd 2315	. . 3 ⊢ ((𝜑 ∧ 𝑧 ∈ (𝑆 × 𝑆)) → 𝑧 ∈ dom 𝐹)
30	29	ex 115	. 2 ⊢ (𝜑 → (𝑧 ∈ (𝑆 × 𝑆) → 𝑧 ∈ dom 𝐹))
31	30	ssrdv 3254	1 ⊢ (𝜑 → (𝑆 × 𝑆) ⊆ dom 𝐹)

This proof depends on syntax axioms:   → wi 4   ∧ wa 104   = wceq 1402  ∃wex 1545   ∈ wcel 2209  ∀wral 2528   ⊆ wss 3220  ⟨cop 3712   × cxp 4772  dom cdm 4774  Rel wrel 4779  ‘cfv 5377  (class class class)co 6085  1^st c1st 6372  2^nd c2nd 6373

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-sbc 3052  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-iota 5337  df-fun 5379  df-fv 5385  df-ov 6088  df-1st 6374  df-2nd 6375

This theorem is used by:  axaddf  8235  axmulf  8236