ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  elpm2r Unicode version

Theorem elpm2r 6940
Description: Sufficient condition for being a partial function. (Contributed by NM, 31-Dec-2013.)
Assertion
Ref Expression
elpm2r  |-  ( ( ( A  e.  V  /\  B  e.  W
)  /\  ( F : C --> A  /\  C  C_  B ) )  ->  F  e.  ( A  ^pm  B ) )

Proof of Theorem elpm2r
StepHypRef Expression
1 fdm 5539 . . . . . . 7  |-  ( F : C --> A  ->  dom  F  =  C )
21feq2d 5521 . . . . . 6  |-  ( F : C --> A  -> 
( F : dom  F --> A  <->  F : C --> A ) )
31sseq1d 3277 . . . . . 6  |-  ( F : C --> A  -> 
( dom  F  C_  B  <->  C 
C_  B ) )
42, 3anbi12d 477 . . . . 5  |-  ( F : C --> A  -> 
( ( F : dom  F --> A  /\  dom  F 
C_  B )  <->  ( F : C --> A  /\  C  C_  B ) ) )
54adantr 276 . . . 4  |-  ( ( F : C --> A  /\  C  C_  B )  -> 
( ( F : dom  F --> A  /\  dom  F 
C_  B )  <->  ( F : C --> A  /\  C  C_  B ) ) )
65ibir 177 . . 3  |-  ( ( F : C --> A  /\  C  C_  B )  -> 
( F : dom  F --> A  /\  dom  F  C_  B ) )
7 elpm2g 6939 . . 3  |-  ( ( A  e.  V  /\  B  e.  W )  ->  ( F  e.  ( A  ^pm  B )  <->  ( F : dom  F --> A  /\  dom  F  C_  B ) ) )
86, 7imbitrrid 156 . 2  |-  ( ( A  e.  V  /\  B  e.  W )  ->  ( ( F : C
--> A  /\  C  C_  B )  ->  F  e.  ( A  ^pm  B
) ) )
98imp 124 1  |-  ( ( ( A  e.  V  /\  B  e.  W
)  /\  ( F : C --> A  /\  C  C_  B ) )  ->  F  e.  ( A  ^pm  B ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    <-> wb 105    e. wcel 2209    C_ wss 3220   dom cdm 4774   -->wf 5373  (class class class)co 6085    ^pm cpm 6923
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  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  ax-setind 4684
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  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-ne 2421  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-sbc 3052  df-dif 3222  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-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-fn 5380  df-f 5381  df-fv 5385  df-ov 6088  df-oprab 6089  df-mpo 6090  df-pm 6925
This theorem is used by:  fpmg  6955  pmresg  6957  ennnfonelemg  13294  lmbrf  15316  ellimc3apf  15761  dvfvalap  15782  dvmulxxbr  15803  dvaddxx  15804  dvmulxx  15805  dviaddf  15806  dvimulf  15807  dvcoapbr  15808  dvmptclx  15819
  Copyright terms: Public domain W3C validator