![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > unex | Unicode version |
Description: The union of two sets is a set. Corollary 5.8 of [TakeutiZaring] p. 16. (Contributed by NM, 1-Jul-1994.) |
Ref | Expression |
---|---|
unex.1 |
![]() ![]() ![]() ![]() |
unex.2 |
![]() ![]() ![]() ![]() |
Ref | Expression |
---|---|
unex |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | unex.1 |
. . 3
![]() ![]() ![]() ![]() | |
2 | unex.2 |
. . 3
![]() ![]() ![]() ![]() | |
3 | 1, 2 | unipr 3758 |
. 2
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
4 | prexg 4141 |
. . . 4
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | |
5 | 1, 2, 4 | mp2an 423 |
. . 3
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
6 | 5 | uniex 4367 |
. 2
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
7 | 3, 6 | eqeltrri 2214 |
1
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Colors of variables: wff set class |
Syntax hints: ![]() ![]() ![]() ![]() ![]() |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-io 699 ax-5 1424 ax-7 1425 ax-gen 1426 ax-ie1 1470 ax-ie2 1471 ax-8 1483 ax-10 1484 ax-11 1485 ax-i12 1486 ax-bndl 1487 ax-4 1488 ax-13 1492 ax-14 1493 ax-17 1507 ax-i9 1511 ax-ial 1515 ax-i5r 1516 ax-ext 2122 ax-sep 4054 ax-pr 4139 ax-un 4363 |
This theorem depends on definitions: df-bi 116 df-tru 1335 df-nf 1438 df-sb 1737 df-clab 2127 df-cleq 2133 df-clel 2136 df-nfc 2271 df-rex 2423 df-v 2691 df-un 3080 df-sn 3538 df-pr 3539 df-uni 3745 |
This theorem is referenced by: unexb 4371 rdg0 6292 unen 6718 findcard2 6791 findcard2s 6792 ac6sfi 6800 sbthlemi10 6862 finomni 7020 exmidfodomrlemim 7074 nn0ex 9007 xrex 9669 exmidunben 11975 strleun 12087 |
Copyright terms: Public domain | W3C validator |