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

Theorem f1ocpbllem 13523
Description: Lemma for f1ocpbl 13524. (Contributed by Mario Carneiro, 24-Feb-2015.)
Hypothesis
Ref Expression
f1ocpbl.f  |-  ( ph  ->  F : V -1-1-onto-> X )
Assertion
Ref Expression
f1ocpbllem  |-  ( (
ph  /\  ( A  e.  V  /\  B  e.  V )  /\  ( C  e.  V  /\  D  e.  V )
)  ->  ( (
( F `  A
)  =  ( F `
 C )  /\  ( F `  B )  =  ( F `  D ) )  <->  ( A  =  C  /\  B  =  D ) ) )

Proof of Theorem f1ocpbllem
StepHypRef Expression
1 f1ocpbl.f . . . . 5  |-  ( ph  ->  F : V -1-1-onto-> X )
2 f1of1 5613 . . . . 5  |-  ( F : V -1-1-onto-> X  ->  F : V -1-1-> X )
31, 2syl 14 . . . 4  |-  ( ph  ->  F : V -1-1-> X
)
433ad2ant1 1045 . . 3  |-  ( (
ph  /\  ( A  e.  V  /\  B  e.  V )  /\  ( C  e.  V  /\  D  e.  V )
)  ->  F : V -1-1-> X )
5 simp2l 1050 . . 3  |-  ( (
ph  /\  ( A  e.  V  /\  B  e.  V )  /\  ( C  e.  V  /\  D  e.  V )
)  ->  A  e.  V )
6 simp3l 1052 . . 3  |-  ( (
ph  /\  ( A  e.  V  /\  B  e.  V )  /\  ( C  e.  V  /\  D  e.  V )
)  ->  C  e.  V )
7 f1fveq 5945 . . 3  |-  ( ( F : V -1-1-> X  /\  ( A  e.  V  /\  C  e.  V
) )  ->  (
( F `  A
)  =  ( F `
 C )  <->  A  =  C ) )
84, 5, 6, 7syl12anc 1272 . 2  |-  ( (
ph  /\  ( A  e.  V  /\  B  e.  V )  /\  ( C  e.  V  /\  D  e.  V )
)  ->  ( ( F `  A )  =  ( F `  C )  <->  A  =  C ) )
9 simp2r 1051 . . 3  |-  ( (
ph  /\  ( A  e.  V  /\  B  e.  V )  /\  ( C  e.  V  /\  D  e.  V )
)  ->  B  e.  V )
10 simp3r 1053 . . 3  |-  ( (
ph  /\  ( A  e.  V  /\  B  e.  V )  /\  ( C  e.  V  /\  D  e.  V )
)  ->  D  e.  V )
11 f1fveq 5945 . . 3  |-  ( ( F : V -1-1-> X  /\  ( B  e.  V  /\  D  e.  V
) )  ->  (
( F `  B
)  =  ( F `
 D )  <->  B  =  D ) )
124, 9, 10, 11syl12anc 1272 . 2  |-  ( (
ph  /\  ( A  e.  V  /\  B  e.  V )  /\  ( C  e.  V  /\  D  e.  V )
)  ->  ( ( F `  B )  =  ( F `  D )  <->  B  =  D ) )
138, 12anbi12d 473 1  |-  ( (
ph  /\  ( A  e.  V  /\  B  e.  V )  /\  ( C  e.  V  /\  D  e.  V )
)  ->  ( (
( F `  A
)  =  ( F `
 C )  /\  ( F `  B )  =  ( F `  D ) )  <->  ( A  =  C  /\  B  =  D ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    /\ w3a 1005    = wceq 1398    e. wcel 2203   -1-1->wf1 5349   -1-1-onto->wf1o 5351   ` cfv 5352
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-14 2206  ax-ext 2214  ax-sep 4228  ax-pow 4287  ax-pr 4322
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ral 2525  df-rex 2526  df-v 2815  df-sbc 3043  df-un 3215  df-in 3217  df-ss 3224  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-br 4110  df-opab 4172  df-id 4414  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-iota 5312  df-fun 5354  df-fn 5355  df-f 5356  df-f1 5357  df-f1o 5359  df-fv 5360
This theorem is referenced by:  f1ocpbl  13524  f1olecpbl  13526
  Copyright terms: Public domain W3C validator