Theorem oprssdmm 6150

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

Hypotheses

Ref	Expression
oprssdmm.m	|- ( ( ph /\ u e. S ) -> E. v v e. u )
oprssdmm.cl	|- ( ( ph /\ ( x e. S /\ y e. S ) ) -> ( x F y ) e. S )
oprssdmm.f	|- ( ph -> Rel F )

Assertion

Ref	Expression
oprssdmm	|- ( ph -> ( S X. S ) C_ dom F )

Distinct variable groups:   u, F, v, x, y   u, S, x, y   ph, u, x, y

Allowed substitution hints:   ph( v)   S( v)

Proof of Theorem oprssdmm

Dummy variable z is distinct from all other variables.

Step	Hyp	Ref	Expression
1		elxp6 6148	. . . . . . 7 |- ( z e. ( S X. S ) <-> ( z = <. ( 1st ` z ) , ( 2nd ` z ) >. /\ ( ( 1st ` z ) e. S /\ ( 2nd ` z ) e. S ) ) )
2	1	biimpi 119	. . . . . 6 |- ( z e. ( S X. S ) -> ( z = <. ( 1st ` z ) , ( 2nd ` z ) >. /\ ( ( 1st ` z ) e. S /\ ( 2nd ` z ) e. S ) ) )
3	2	adantl 275	. . . . 5 |- ( ( ph /\ z e. ( S X. S ) ) -> ( z = <. ( 1st ` z ) , ( 2nd ` z ) >. /\ ( ( 1st ` z ) e. S /\ ( 2nd ` z ) e. S ) ) )
4	3	simpld 111	. . . 4 |- ( ( ph /\ z e. ( S X. S ) ) -> z = <. ( 1st ` z ) , ( 2nd ` z ) >. )
5	3	simprd 113	. . . . 5 |- ( ( ph /\ z e. ( S X. S ) ) -> ( ( 1st ` z ) e. S /\ ( 2nd ` z ) e. S ) )
6		oprssdmm.f	. . . . . . . . 9 |- ( ph -> Rel F )
7	6	adantr 274	. . . . . . . 8 |- ( ( ph /\ ( x e. S /\ y e. S ) ) -> Rel F )
8		eleq2 2234	. . . . . . . . . 10 |- ( u = ( F ` <. x , y >. ) -> ( v e. u <-> v e. ( F ` <. x , y >. ) ) )
9	8	exbidv 1818	. . . . . . . . 9 |- ( u = ( F ` <. x , y >. ) -> ( E. v v e. u <-> E. v v e. ( F ` <. x , y >. ) ) )
10		oprssdmm.m	. . . . . . . . . . 11 |- ( ( ph /\ u e. S ) -> E. v v e. u )
11	10	ralrimiva 2543	. . . . . . . . . 10 |- ( ph -> A. u e. S E. v v e. u )
12	11	adantr 274	. . . . . . . . 9 |- ( ( ph /\ ( x e. S /\ y e. S ) ) -> A. u e. S E. v v e. u )
13		df-ov 5856	. . . . . . . . . 10 |- ( x F y ) = ( F ` <. x , y >. )
14		oprssdmm.cl	. . . . . . . . . 10 |- ( ( ph /\ ( x e. S /\ y e. S ) ) -> ( x F y ) e. S )
15	13, 14	eqeltrrid 2258	. . . . . . . . 9 |- ( ( ph /\ ( x e. S /\ y e. S ) ) -> ( F ` <. x , y >. ) e. S )
16	9, 12, 15	rspcdva 2839	. . . . . . . 8 |- ( ( ph /\ ( x e. S /\ y e. S ) ) -> E. v v e. ( F ` <. x , y >. ) )
17		relelfvdm 5528	. . . . . . . . . 10 |- ( ( Rel F /\ v e. ( F ` <. x , y >. ) ) -> <. x , y >. e. dom F )
18	17	ex 114	. . . . . . . . 9 |- ( Rel F -> ( v e. ( F ` <. x , y >. ) -> <. x , y >. e. dom F ) )
19	18	exlimdv 1812	. . . . . . . 8 |- ( Rel F -> ( E. v v e. ( F ` <. x , y >. ) -> <. x , y >. e. dom F ) )
20	7, 16, 19	sylc 62	. . . . . . 7 |- ( ( ph /\ ( x e. S /\ y e. S ) ) -> <. x , y >. e. dom F )
21	20	ralrimivva 2552	. . . . . 6 |- ( ph -> A. x e. S A. y e. S <. x , y >. e. dom F )
22	21	adantr 274	. . . . 5 |- ( ( ph /\ z e. ( S X. S ) ) -> A. x e. S A. y e. S <. x , y >. e. dom F )
23		opeq1 3765	. . . . . . 7 |- ( x = ( 1st ` z ) -> <. x , y >. = <. ( 1st ` z ) , y >. )
24	23	eleq1d 2239	. . . . . 6 |- ( x = ( 1st ` z ) -> ( <. x , y >. e. dom F <-> <. ( 1st ` z ) , y >. e. dom F ) )
25		opeq2 3766	. . . . . . 7 |- ( y = ( 2nd ` z ) -> <. ( 1st ` z ) , y >. = <. ( 1st ` z ) , ( 2nd ` z ) >. )
26	25	eleq1d 2239	. . . . . 6 |- ( y = ( 2nd ` z ) -> ( <. ( 1st ` z ) , y >. e. dom F <-> <. ( 1st ` z ) , ( 2nd ` z ) >. e. dom F ) )
27	24, 26	rspc2va 2848	. . . . 5 |- ( ( ( ( 1st ` z ) e. S /\ ( 2nd ` z ) e. S ) /\ A. x e. S A. y e. S <. x , y >. e. dom F ) -> <. ( 1st ` z ) , ( 2nd ` z ) >. e. dom F )
28	5, 22, 27	syl2anc 409	. . . 4 |- ( ( ph /\ z e. ( S X. S ) ) -> <. ( 1st ` z ) , ( 2nd ` z ) >. e. dom F )
29	4, 28	eqeltrd 2247	. . 3 |- ( ( ph /\ z e. ( S X. S ) ) -> z e. dom F )
30	29	ex 114	. 2 |- ( ph -> ( z e. ( S X. S ) -> z e. dom F ) )
31	30	ssrdv 3153	1 |- ( ph -> ( S X. S ) C_ dom F )

Syntax hints:   -> wi 4   /\ wa 103   = wceq 1348   E.wex 1485   e. wcel 2141   A.wral 2448   C_ wss 3121   <.cop 3586   X. cxp 4609   dom cdm 4611   Rel wrel 4616   ` cfv 5198  (class class class)co 5853   1stc1st 6117   2ndc2nd 6118

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-13 2143  ax-14 2144  ax-ext 2152  ax-sep 4107  ax-pow 4160  ax-pr 4194  ax-un 4418

This theorem depends on definitions:  df-bi 116  df-3an 975  df-tru 1351  df-nf 1454  df-sb 1756  df-eu 2022  df-mo 2023  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ral 2453  df-rex 2454  df-v 2732  df-sbc 2956  df-un 3125  df-in 3127  df-ss 3134  df-pw 3568  df-sn 3589  df-pr 3590  df-op 3592  df-uni 3797  df-br 3990  df-opab 4051  df-mpt 4052  df-id 4278  df-xp 4617  df-rel 4618  df-cnv 4619  df-co 4620  df-dm 4621  df-rn 4622  df-iota 5160  df-fun 5200  df-fv 5206  df-ov 5856  df-1st 6119  df-2nd 6120

This theorem is referenced by:  axaddf  7830  axmulf  7831