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

Theorem zfun 4117
Description: Axiom of Union expressed with the fewest number of different variables. (Contributed by NM, 14-Aug-2003.)
Assertion
Ref Expression
zfun
Distinct variable group:   ,,

Proof of Theorem zfun
Dummy variable is distinct from all other variables.
StepHypRef Expression
1 ax-un 4116 . 2
2 elequ2 1579 . . . . . . 7
3 elequ1 1578 . . . . . . 7
42, 3anbi12d 445 . . . . . 6
54cbvexv 1773 . . . . 5
65imbi1i 227 . . . 4
76albii 1335 . . 3
87exbii 1474 . 2
91, 8mpbi 133 1
Colors of variables: wff set class
Syntax hints:   wi 4   wa 97  wal 1224  wex 1358
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-5 1312  ax-7 1313  ax-gen 1314  ax-ie1 1359  ax-ie2 1360  ax-8 1372  ax-4 1377  ax-13 1381  ax-14 1382  ax-17 1396  ax-i9 1400  ax-ial 1405  ax-un 4116
This theorem depends on definitions:  df-bi 110
This theorem is referenced by:  uniex2  4119  bj-uniex2  7331
  Copyright terms: Public domain W3C validator