New Foundations Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  NFE Home  >  Th. List  >  iota2df Unicode version

Theorem iota2df 4365
 Description: A condition that allows us to represent "the unique element such that " with a class expression . (Contributed by NM, 30-Dec-2014.)
Hypotheses
Ref Expression
iota2df.1
iota2df.2
iota2df.3
iota2df.4
iota2df.5
iota2df.6
Assertion
Ref Expression
iota2df

Proof of Theorem iota2df
StepHypRef Expression
1 iota2df.6 . 2
2 iota2df.5 . . 3
3 nfiota1 4341 . . . . 5
43a1i 10 . . . 4
54, 1nfeqd 2503 . . 3
62, 5nfbid 1832 . 2
7 iota2df.4 . . 3
8 iota2df.3 . . . . 5
9 simpr 447 . . . . . 6
109eqeq2d 2364 . . . . 5
118, 10bibi12d 312 . . . 4
1211ex 423 . . 3
137, 12alrimi 1765 . 2
14 iota2df.2 . . . 4
15 iota1 4353 . . . 4
1614, 15syl 15 . . 3
177, 16alrimi 1765 . 2
18 iota2df.1 . 2
19 vtoclgft 2905 . 2
201, 6, 13, 17, 18, 19syl221anc 1193 1
 Colors of variables: wff setvar class Syntax hints:   wi 4   wb 176   wa 358  wal 1540  wnf 1544   wceq 1642   wcel 1710  weu 2204  wnfc 2476  cio 4337 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1546  ax-5 1557  ax-17 1616  ax-9 1654  ax-8 1675  ax-6 1729  ax-7 1734  ax-11 1746  ax-12 1925  ax-ext 2334 This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3an 936  df-nan 1288  df-tru 1319  df-ex 1542  df-nf 1545  df-sb 1649  df-eu 2208  df-clab 2340  df-cleq 2346  df-clel 2349  df-nfc 2478  df-ral 2619  df-rex 2620  df-v 2861  df-sbc 3047  df-nin 3211  df-compl 3212  df-un 3214  df-sn 3741  df-pr 3742  df-uni 3892  df-iota 4339 This theorem is referenced by:  iota2d  4366  iota2  4367
 Copyright terms: Public domain W3C validator