HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem unisn2 2891
Description: A version of unisn 2531 without the A e. V hypothesis. (Contributed by Stefan Allan, 14-Mar-2006.)
Assertion
Ref Expression
unisn2 |- U.{A} e. {(/), A}

Proof of Theorem unisn2
StepHypRef Expression
1 unisng 2532 . . 3 |- (A e. V -> U.{A} = A)
2 eqid 1482 . . . . 5 |- A = A
32olci 271 . . . 4 |- (A = (/) \/ A = A)
4 elprg 2435 . . . 4 |- (A e. V -> (A e. {(/), A} <-> (A = (/) \/ A = A)))
53, 4mpbiri 194 . . 3 |- (A e. V -> A e. {(/), A})
61, 5eqeltrd 1555 . 2 |- (A e. V -> U.{A} e. {(/), A})
7 snprc 2455 . . . . 5 |- (-. A e. V <-> {A} = (/))
87biimpi 151 . . . 4 |- (-. A e. V -> {A} = (/))
98unieqd 2526 . . 3 |- (-. A e. V -> U.{A} = U.(/))
10 uni0 2539 . . . 4 |- U.(/) = (/)
11 0ex 2726 . . . . 5 |- (/) e. V
1211prid1 2464 . . . 4 |- (/) e. {(/), A}
1310, 12eqeltri 1551 . . 3 |- U.(/) e. {(/), A}
149, 13syl6eqel 1563 . 2 |- (-. A e. V -> U.{A} e. {(/), A})
156, 14pm2.61i 126 1 |- U.{A} e. {(/), A}
Colors of variables: wff set class
Syntax hints:  -. wn 2   \/ wo 222   = wceq 960   e. wcel 962  Vcvv 1818  (/)c0 2291  {csn 2421  {cpr 2422  U.cuni 2517
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 966  ax-gen 967  ax-8 968  ax-10 970  ax-11 971  ax-12 972  ax-14 974  ax-17 975  ax-4 977  ax-5o 979  ax-6o 982  ax-9o 1127  ax-10o 1144  ax-16 1214  ax-11o 1222  ax-ext 1464  ax-nul 2725
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 985  df-sb 1176  df-eu 1386  df-mo 1387  df-clab 1470  df-cleq 1475  df-clel 1478  df-ne 1594  df-ral 1656  df-rex 1657  df-v 1819  df-dif 2060  df-un 2061  df-in 2062  df-ss 2064  df-nul 2292  df-sn 2424  df-pr 2425  df-uni 2518
Copyright terms: Public domain