Theorem oprssdmm 6171

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 6169	. . . . . . 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 2241	. . . . . . . . . 10 ⊢ (𝑢 = (𝐹‘⟨𝑥, 𝑦⟩) → (𝑣 ∈ 𝑢 ↔ 𝑣 ∈ (𝐹‘⟨𝑥, 𝑦⟩)))
9	8	exbidv 1825	. . . . . . . . 9 ⊢ (𝑢 = (𝐹‘⟨𝑥, 𝑦⟩) → (∃𝑣 𝑣 ∈ 𝑢 ↔ ∃𝑣 𝑣 ∈ (𝐹‘⟨𝑥, 𝑦⟩)))
10		oprssdmm.m	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑢 ∈ 𝑆) → ∃𝑣 𝑣 ∈ 𝑢)
11	10	ralrimiva 2550	. . . . . . . . . 10 ⊢ (𝜑 → ∀𝑢 ∈ 𝑆 ∃𝑣 𝑣 ∈ 𝑢)
12	11	adantr 276	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → ∀𝑢 ∈ 𝑆 ∃𝑣 𝑣 ∈ 𝑢)
13		df-ov 5877	. . . . . . . . . 10 ⊢ (𝑥𝐹𝑦) = (𝐹‘⟨𝑥, 𝑦⟩)
14		oprssdmm.cl	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥𝐹𝑦) ∈ 𝑆)
15	13, 14	eqeltrrid 2265	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝐹‘⟨𝑥, 𝑦⟩) ∈ 𝑆)
16	9, 12, 15	rspcdva 2846	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → ∃𝑣 𝑣 ∈ (𝐹‘⟨𝑥, 𝑦⟩))
17		relelfvdm 5547	. . . . . . . . . 10 ⊢ ((Rel 𝐹 ∧ 𝑣 ∈ (𝐹‘⟨𝑥, 𝑦⟩)) → ⟨𝑥, 𝑦⟩ ∈ dom 𝐹)
18	17	ex 115	. . . . . . . . 9 ⊢ (Rel 𝐹 → (𝑣 ∈ (𝐹‘⟨𝑥, 𝑦⟩) → ⟨𝑥, 𝑦⟩ ∈ dom 𝐹))
19	18	exlimdv 1819	. . . . . . . 8 ⊢ (Rel 𝐹 → (∃𝑣 𝑣 ∈ (𝐹‘⟨𝑥, 𝑦⟩) → ⟨𝑥, 𝑦⟩ ∈ dom 𝐹))
20	7, 16, 19	sylc 62	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → ⟨𝑥, 𝑦⟩ ∈ dom 𝐹)
21	20	ralrimivva 2559	. . . . . 6 ⊢ (𝜑 → ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 ⟨𝑥, 𝑦⟩ ∈ dom 𝐹)
22	21	adantr 276	. . . . 5 ⊢ ((𝜑 ∧ 𝑧 ∈ (𝑆 × 𝑆)) → ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 ⟨𝑥, 𝑦⟩ ∈ dom 𝐹)
23		opeq1 3778	. . . . . . 7 ⊢ (𝑥 = (1st ‘𝑧) → ⟨𝑥, 𝑦⟩ = ⟨(1st ‘𝑧), 𝑦⟩)
24	23	eleq1d 2246	. . . . . 6 ⊢ (𝑥 = (1st ‘𝑧) → (⟨𝑥, 𝑦⟩ ∈ dom 𝐹 ↔ ⟨(1st ‘𝑧), 𝑦⟩ ∈ dom 𝐹))
25		opeq2 3779	. . . . . . 7 ⊢ (𝑦 = (2nd ‘𝑧) → ⟨(1st ‘𝑧), 𝑦⟩ = ⟨(1st ‘𝑧), (2nd ‘𝑧)⟩)
26	25	eleq1d 2246	. . . . . 6 ⊢ (𝑦 = (2nd ‘𝑧) → (⟨(1st ‘𝑧), 𝑦⟩ ∈ dom 𝐹 ↔ ⟨(1st ‘𝑧), (2nd ‘𝑧)⟩ ∈ dom 𝐹))
27	24, 26	rspc2va 2855	. . . . 5 ⊢ ((((1st ‘𝑧) ∈ 𝑆 ∧ (2nd ‘𝑧) ∈ 𝑆) ∧ ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 ⟨𝑥, 𝑦⟩ ∈ dom 𝐹) → ⟨(1st ‘𝑧), (2nd ‘𝑧)⟩ ∈ dom 𝐹)
28	5, 22, 27	syl2anc 411	. . . 4 ⊢ ((𝜑 ∧ 𝑧 ∈ (𝑆 × 𝑆)) → ⟨(1st ‘𝑧), (2nd ‘𝑧)⟩ ∈ dom 𝐹)
29	4, 28	eqeltrd 2254	. . 3 ⊢ ((𝜑 ∧ 𝑧 ∈ (𝑆 × 𝑆)) → 𝑧 ∈ dom 𝐹)
30	29	ex 115	. 2 ⊢ (𝜑 → (𝑧 ∈ (𝑆 × 𝑆) → 𝑧 ∈ dom 𝐹))
31	30	ssrdv 3161	1 ⊢ (𝜑 → (𝑆 × 𝑆) ⊆ dom 𝐹)

Syntax hints:   → wi 4   ∧ wa 104   = wceq 1353  ∃wex 1492   ∈ wcel 2148  ∀wral 2455   ⊆ wss 3129  ⟨cop 3595   × cxp 4624  dom cdm 4626  Rel wrel 4631  ‘cfv 5216  (class class class)co 5874  1^st c1st 6138  2^nd c2nd 6139

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 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-sep 4121  ax-pow 4174  ax-pr 4209  ax-un 4433

This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ral 2460  df-rex 2461  df-v 2739  df-sbc 2963  df-un 3133  df-in 3135  df-ss 3142  df-pw 3577  df-sn 3598  df-pr 3599  df-op 3601  df-uni 3810  df-br 4004  df-opab 4065  df-mpt 4066  df-id 4293  df-xp 4632  df-rel 4633  df-cnv 4634  df-co 4635  df-dm 4636  df-rn 4637  df-iota 5178  df-fun 5218  df-fv 5224  df-ov 5877  df-1st 6140  df-2nd 6141

This theorem is referenced by:  axaddf  7866  axmulf  7867