HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem ndmoprcl 4977
Description: The closure of an operation outside its domain, when the domain includes the empty set. This technical lemma can make the operation more convenient to work in some cases. It is is dependent on our particular definitions of operation value, function value, and ordered pair.
Hypotheses
Ref Expression
ndmoprcl.1 |- dom F = (S X. S)
ndmoprcl.2 |- ((A e. S /\ x e. S) -> (AFx) e. S)
ndmoprcl.3 |- (/) e. S
Assertion
Ref Expression
ndmoprcl |- (AFB) e. S
Distinct variable groups:   x,A   x,B   x,F   x,S

Proof of Theorem ndmoprcl
StepHypRef Expression
1 oprprc2 4909 . . . . 5 |- (-. B e. _V -> (AFB) = (AFA))
21eleq1d 1963 . . . 4 |- (-. B e. _V -> ((AFB) e. S <-> (AFA) e. S))
3 ndmoprcl.1 . . . . . . . 8 |- dom F = (S X. S)
4 ndmoprg 4976 . . . . . . . 8 |- ((dom F = (S X. S) /\ A e. _V /\ -. (A e. S /\ A e. S)) -> (AFA) = (/))
53, 4mp3an1 1178 . . . . . . 7 |- ((A e. _V /\ -. (A e. S /\ A e. S)) -> (AFA) = (/))
6 ndmoprcl.3 . . . . . . 7 |- (/) e. S
75, 6syl6eqel 1979 . . . . . 6 |- ((A e. _V /\ -. (A e. S /\ A e. S)) -> (AFA) e. S)
87ex 402 . . . . 5 |- (A e. _V -> (-. (A e. S /\ A e. S) -> (AFA) e. S))
9 opreq2 4890 . . . . . . . . 9 |- (x = A -> (AFx) = (AFA))
109eleq1d 1963 . . . . . . . 8 |- (x = A -> ((AFx) e. S <-> (AFA) e. S))
1110imbi2d 674 . . . . . . 7 |- (x = A -> ((A e. S -> (AFx) e. S) <-> (A e. S -> (AFA) e. S)))
12 ndmoprcl.2 . . . . . . . 8 |- ((A e. S /\ x e. S) -> (AFx) e. S)
1312expcom 403 . . . . . . 7 |- (x e. S -> (A e. S -> (AFx) e. S))
1411, 13vtoclga 2352 . . . . . 6 |- (A e. S -> (A e. S -> (AFA) e. S))
1514imp 377 . . . . 5 |- ((A e. S /\ A e. S) -> (AFA) e. S)
168, 15pm2.61d2 143 . . . 4 |- (A e. _V -> (AFA) e. S)
172, 16syl5cbir 228 . . 3 |- (A e. _V -> (-. B e. _V -> (AFB) e. S))
18 ndmoprg 4976 . . . . . . 7 |- ((dom F = (S X. S) /\ B e. _V /\ -. (A e. S /\ B e. S)) -> (AFB) = (/))
193, 18mp3an1 1178 . . . . . 6 |- ((B e. _V /\ -. (A e. S /\ B e. S)) -> (AFB) = (/))
2019, 6syl6eqel 1979 . . . . 5 |- ((B e. _V /\ -. (A e. S /\ B e. S)) -> (AFB) e. S)
2120ex 402 . . . 4 |- (B e. _V -> (-. (A e. S /\ B e. S) -> (AFB) e. S))
22 opreq2 4890 . . . . . . . 8 |- (x = B -> (AFx) = (AFB))
2322eleq1d 1963 . . . . . . 7 |- (x = B -> ((AFx) e. S <-> (AFB) e. S))
2423imbi2d 674 . . . . . 6 |- (x = B -> ((A e. S -> (AFx) e. S) <-> (A e. S -> (AFB) e. S)))
2524, 13vtoclga 2352 . . . . 5 |- (B e. S -> (A e. S -> (AFB) e. S))
2625impcom 378 . . . 4 |- ((A e. S /\ B e. S) -> (AFB) e. S)
2721, 26pm2.61d2 143 . . 3 |- (B e. _V -> (AFB) e. S)
2817, 27pm2.61d2 143 . 2 |- (A e. _V -> (AFB) e. S)
29 relxp 4088 . . . . 5 |- Rel (S X. S)
303releqi 4072 . . . . 5 |- (Rel dom F <-> Rel (S X. S))
3129, 30mpbir 207 . . . 4 |- Rel dom F
3231oprprc1 4908 . . 3 |- (-. A e. _V -> (AFB) = (/))
3332, 6syl6eqel 1979 . 2 |- (-. A e. _V -> (AFB) e. S)
3428, 33pm2.61i 140 1 |- (AFB) e. S
Colors of variables: wff set class
Syntax hints:  -. wn 2   -> wi 3   /\ wa 240   = wceq 1298   e. wcel 1300  _Vcvv 2292  (/)c0 2875   X. cxp 3984  dom cdm 3986  Rel wrel 3991  (class class class)co 4884
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 1304  ax-gen 1305  ax-8 1306  ax-9 1307  ax-10 1308  ax-11 1309  ax-12 1310  ax-14 1312  ax-17 1317  ax-4 1319  ax-5o 1321  ax-6o 1324  ax-9o 1481  ax-10o 1500  ax-16 1580  ax-11o 1588  ax-ext 1865  ax-sep 3438  ax-nul 3445  ax-pow 3481  ax-pr 3524
This theorem depends on definitions:  df-bi 164  df-or 241  df-an 242  df-3an 860  df-ex 1327  df-sb 1536  df-eu 1775  df-mo 1776  df-clab 1872  df-cleq 1877  df-clel 1880  df-ne 2019  df-ral 2109  df-rex 2110  df-v 2294  df-dif 2597  df-un 2600  df-in 2603  df-ss 2605  df-nul 2876  df-pw 3035  df-sn 3049  df-pr 3050  df-op 3053  df-uni 3178  df-br 3339  df-opab 3396  df-xp 4000  df-rel 4001  df-cnv 4002  df-dm 4004  df-rn 4005  df-res 4006  df-ima 4007  df-fv 4014  df-opr 4886
Copyright terms: Public domain