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

Theorem nfiso 6012
Description: Bound-variable hypothesis builder for an isomorphism. (Contributed by NM, 17-May-2004.) (Proof shortened by Andrew Salmon, 22-Oct-2011.)
Hypotheses
Ref Expression
nfiso.1  |-  F/_ x H
nfiso.2  |-  F/_ x R
nfiso.3  |-  F/_ x S
nfiso.4  |-  F/_ x A
nfiso.5  |-  F/_ x B
Assertion
Ref Expression
nfiso  |-  F/ x  H  Isom  R ,  S  ( A ,  B )

Proof of Theorem nfiso
Dummy variables  y  z are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-isom 5386 . 2  |-  ( H 
Isom  R ,  S  ( A ,  B )  <-> 
( H : A -1-1-onto-> B  /\  A. y  e.  A  A. z  e.  A  ( y R z  <-> 
( H `  y
) S ( H `
 z ) ) ) )
2 nfiso.1 . . . 4  |-  F/_ x H
3 nfiso.4 . . . 4  |-  F/_ x A
4 nfiso.5 . . . 4  |-  F/_ x B
52, 3, 4nff1o 5637 . . 3  |-  F/ x  H : A -1-1-onto-> B
6 nfcv 2392 . . . . . . 7  |-  F/_ x
y
7 nfiso.2 . . . . . . 7  |-  F/_ x R
8 nfcv 2392 . . . . . . 7  |-  F/_ x
z
96, 7, 8nfbr 4177 . . . . . 6  |-  F/ x  y R z
102, 6nffv 5705 . . . . . . 7  |-  F/_ x
( H `  y
)
11 nfiso.3 . . . . . . 7  |-  F/_ x S
122, 8nffv 5705 . . . . . . 7  |-  F/_ x
( H `  z
)
1310, 11, 12nfbr 4177 . . . . . 6  |-  F/ x
( H `  y
) S ( H `
 z )
149, 13nfbi 1642 . . . . 5  |-  F/ x
( y R z  <-> 
( H `  y
) S ( H `
 z ) )
153, 14nfralxy 2588 . . . 4  |-  F/ x A. z  e.  A  ( y R z  <-> 
( H `  y
) S ( H `
 z ) )
163, 15nfralxy 2588 . . 3  |-  F/ x A. y  e.  A  A. z  e.  A  ( y R z  <-> 
( H `  y
) S ( H `
 z ) )
175, 16nfan 1618 . 2  |-  F/ x
( H : A -1-1-onto-> B  /\  A. y  e.  A  A. z  e.  A  ( y R z  <-> 
( H `  y
) S ( H `
 z ) ) )
181, 17nfxfr 1527 1  |-  F/ x  H  Isom  R ,  S  ( A ,  B )
Colors of variables:    wff set class
This proof depends on syntax axioms:    /\ wa 104    <-> wb 105   F/wnf 1513   F/_wnfc 2379   A.wral 2528   class class class wbr 4130   -1-1-onto->wf1o 5376   ` cfv 5377    Isom wiso 5378
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-ext 2220
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-un 3224  df-in 3226  df-ss 3233  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4131  df-opab 4193  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-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-isom 5386
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator