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

Theorem qliftfun 6891
Description: The function  F is the unique function defined by  F `  [
x ]  =  A, provided that the well-definedness condition holds. (Contributed by Mario Carneiro, 23-Dec-2016.)
Hypotheses
Ref Expression
qlift.1  |-  F  =  ran  ( x  e.  X  |->  <. [ x ] R ,  A >. )
qlift.2  |-  ( (
ph  /\  x  e.  X )  ->  A  e.  Y )
qlift.3  |-  ( ph  ->  R  Er  X )
qlift.4  |-  ( ph  ->  X  e.  _V )
qliftfun.4  |-  ( x  =  y  ->  A  =  B )
Assertion
Ref Expression
qliftfun  |-  ( ph  ->  ( Fun  F  <->  A. x A. y ( x R y  ->  A  =  B ) ) )
Distinct variable groups:    y, A    x, B    x, y, ph    x, R, y    y, F    x, X, y    x, Y, y
Allowed substitution hints:    A( x)    B( y)    F( x)

Proof of Theorem qliftfun
StepHypRef Expression
1 qlift.1 . . 3  |-  F  =  ran  ( x  e.  X  |->  <. [ x ] R ,  A >. )
2 qlift.2 . . . 4  |-  ( (
ph  /\  x  e.  X )  ->  A  e.  Y )
3 qlift.3 . . . 4  |-  ( ph  ->  R  Er  X )
4 qlift.4 . . . 4  |-  ( ph  ->  X  e.  _V )
51, 2, 3, 4qliftlem 6887 . . 3  |-  ( (
ph  /\  x  e.  X )  ->  [ x ] R  e.  ( X /. R ) )
6 eceq1 6842 . . 3  |-  ( x  =  y  ->  [ x ] R  =  [
y ] R )
7 qliftfun.4 . . 3  |-  ( x  =  y  ->  A  =  B )
81, 5, 2, 6, 7fliftfun 6002 . 2  |-  ( ph  ->  ( Fun  F  <->  A. x  e.  X  A. y  e.  X  ( [
x ] R  =  [ y ] R  ->  A  =  B ) ) )
93adantr 276 . . . . . . . . . . 11  |-  ( (
ph  /\  x R
y )  ->  R  Er  X )
10 simpr 110 . . . . . . . . . . 11  |-  ( (
ph  /\  x R
y )  ->  x R y )
119, 10ercl 6818 . . . . . . . . . 10  |-  ( (
ph  /\  x R
y )  ->  x  e.  X )
129, 10ercl2 6820 . . . . . . . . . 10  |-  ( (
ph  /\  x R
y )  ->  y  e.  X )
1311, 12jca 306 . . . . . . . . 9  |-  ( (
ph  /\  x R
y )  ->  (
x  e.  X  /\  y  e.  X )
)
1413ex 115 . . . . . . . 8  |-  ( ph  ->  ( x R y  ->  ( x  e.  X  /\  y  e.  X ) ) )
1514pm4.71rd 398 . . . . . . 7  |-  ( ph  ->  ( x R y  <-> 
( ( x  e.  X  /\  y  e.  X )  /\  x R y ) ) )
163adantr 276 . . . . . . . . 9  |-  ( (
ph  /\  ( x  e.  X  /\  y  e.  X ) )  ->  R  Er  X )
17 simprl 535 . . . . . . . . 9  |-  ( (
ph  /\  ( x  e.  X  /\  y  e.  X ) )  ->  x  e.  X )
1816, 17erth 6853 . . . . . . . 8  |-  ( (
ph  /\  ( x  e.  X  /\  y  e.  X ) )  -> 
( x R y  <->  [ x ] R  =  [ y ] R
) )
1918pm5.32da 456 . . . . . . 7  |-  ( ph  ->  ( ( ( x  e.  X  /\  y  e.  X )  /\  x R y )  <->  ( (
x  e.  X  /\  y  e.  X )  /\  [ x ] R  =  [ y ] R
) ) )
2015, 19bitrd 188 . . . . . 6  |-  ( ph  ->  ( x R y  <-> 
( ( x  e.  X  /\  y  e.  X )  /\  [
x ] R  =  [ y ] R
) ) )
2120imbi1d 231 . . . . 5  |-  ( ph  ->  ( ( x R y  ->  A  =  B )  <->  ( (
( x  e.  X  /\  y  e.  X
)  /\  [ x ] R  =  [
y ] R )  ->  A  =  B ) ) )
22 impexp 263 . . . . 5  |-  ( ( ( ( x  e.  X  /\  y  e.  X )  /\  [
x ] R  =  [ y ] R
)  ->  A  =  B )  <->  ( (
x  e.  X  /\  y  e.  X )  ->  ( [ x ] R  =  [ y ] R  ->  A  =  B ) ) )
2321, 22bitrdi 196 . . . 4  |-  ( ph  ->  ( ( x R y  ->  A  =  B )  <->  ( (
x  e.  X  /\  y  e.  X )  ->  ( [ x ] R  =  [ y ] R  ->  A  =  B ) ) ) )
24232albidv 1920 . . 3  |-  ( ph  ->  ( A. x A. y ( x R y  ->  A  =  B )  <->  A. x A. y ( ( x  e.  X  /\  y  e.  X )  ->  ( [ x ] R  =  [ y ] R  ->  A  =  B ) ) ) )
25 r2al 2569 . . 3  |-  ( A. x  e.  X  A. y  e.  X  ( [ x ] R  =  [ y ] R  ->  A  =  B )  <->  A. x A. y ( ( x  e.  X  /\  y  e.  X
)  ->  ( [
x ] R  =  [ y ] R  ->  A  =  B ) ) )
2624, 25bitr4di 198 . 2  |-  ( ph  ->  ( A. x A. y ( x R y  ->  A  =  B )  <->  A. x  e.  X  A. y  e.  X  ( [
x ] R  =  [ y ] R  ->  A  =  B ) ) )
278, 26bitr4d 191 1  |-  ( ph  ->  ( Fun  F  <->  A. x A. y ( x R y  ->  A  =  B ) ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    <-> wb 105   A.wal 1400    = wceq 1402    e. wcel 2209   A.wral 2528   _Vcvv 2821   <.cop 3712   class class class wbr 4130    |-> cmpt 4192   ran crn 4775   Fun wfun 5371    Er wer 6804   [cec 6805   /.cqs 6806
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-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  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-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-fv 5385  df-er 6807  df-ec 6809  df-qs 6813
This theorem is used by:  qliftfund  6892  qliftfuns  6893
  Copyright terms: Public domain W3C validator