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

Theorem qliftfun 6595
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 6591 . . 3  |-  ( (
ph  /\  x  e.  X )  ->  [ x ] R  e.  ( X /. R ) )
6 eceq1 6548 . . 3  |-  ( x  =  y  ->  [ x ] R  =  [
y ] R )
7 qliftfun.4 . . 3  |-  ( x  =  y  ->  A  =  B )
81, 5, 2, 6, 7fliftfun 5775 . 2  |-  ( ph  ->  ( Fun  F  <->  A. x  e.  X  A. y  e.  X  ( [
x ] R  =  [ y ] R  ->  A  =  B ) ) )
93adantr 274 . . . . . . . . . . 11  |-  ( (
ph  /\  x R
y )  ->  R  Er  X )
10 simpr 109 . . . . . . . . . . 11  |-  ( (
ph  /\  x R
y )  ->  x R y )
119, 10ercl 6524 . . . . . . . . . 10  |-  ( (
ph  /\  x R
y )  ->  x  e.  X )
129, 10ercl2 6526 . . . . . . . . . 10  |-  ( (
ph  /\  x R
y )  ->  y  e.  X )
1311, 12jca 304 . . . . . . . . 9  |-  ( (
ph  /\  x R
y )  ->  (
x  e.  X  /\  y  e.  X )
)
1413ex 114 . . . . . . . 8  |-  ( ph  ->  ( x R y  ->  ( x  e.  X  /\  y  e.  X ) ) )
1514pm4.71rd 392 . . . . . . 7  |-  ( ph  ->  ( x R y  <-> 
( ( x  e.  X  /\  y  e.  X )  /\  x R y ) ) )
163adantr 274 . . . . . . . . 9  |-  ( (
ph  /\  ( x  e.  X  /\  y  e.  X ) )  ->  R  Er  X )
17 simprl 526 . . . . . . . . 9  |-  ( (
ph  /\  ( x  e.  X  /\  y  e.  X ) )  ->  x  e.  X )
1816, 17erth 6557 . . . . . . . 8  |-  ( (
ph  /\  ( x  e.  X  /\  y  e.  X ) )  -> 
( x R y  <->  [ x ] R  =  [ y ] R
) )
1918pm5.32da 449 . . . . . . 7  |-  ( ph  ->  ( ( ( x  e.  X  /\  y  e.  X )  /\  x R y )  <->  ( (
x  e.  X  /\  y  e.  X )  /\  [ x ] R  =  [ y ] R
) ) )
2015, 19bitrd 187 . . . . . 6  |-  ( ph  ->  ( x R y  <-> 
( ( x  e.  X  /\  y  e.  X )  /\  [
x ] R  =  [ y ] R
) ) )
2120imbi1d 230 . . . . 5  |-  ( ph  ->  ( ( x R y  ->  A  =  B )  <->  ( (
( x  e.  X  /\  y  e.  X
)  /\  [ x ] R  =  [
y ] R )  ->  A  =  B ) ) )
22 impexp 261 . . . . 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 195 . . . 4  |-  ( ph  ->  ( ( x R y  ->  A  =  B )  <->  ( (
x  e.  X  /\  y  e.  X )  ->  ( [ x ] R  =  [ y ] R  ->  A  =  B ) ) ) )
24232albidv 1860 . . 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 2489 . . 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 197 . 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 190 1  |-  ( ph  ->  ( Fun  F  <->  A. x A. y ( x R y  ->  A  =  B ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    <-> wb 104   A.wal 1346    = wceq 1348    e. wcel 2141   A.wral 2448   _Vcvv 2730   <.cop 3586   class class class wbr 3989    |-> cmpt 4050   ran crn 4612   Fun wfun 5192    Er wer 6510   [cec 6511   /.cqs 6512
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-rab 2457  df-v 2732  df-sbc 2956  df-csb 3050  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-res 4623  df-ima 4624  df-iota 5160  df-fun 5200  df-fn 5201  df-f 5202  df-fv 5206  df-er 6513  df-ec 6515  df-qs 6519
This theorem is referenced by:  qliftfund  6596  qliftfuns  6597
  Copyright terms: Public domain W3C validator