Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > disjnims | Unicode version |
Description: If a collection for is disjoint, then pairs are disjoint. (Contributed by Mario Carneiro, 14-Nov-2016.) (Revised by Jim Kingdon, 7-Oct-2022.) |
Ref | Expression |
---|---|
disjnims | Disj |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nfcv 2281 | . . 3 | |
2 | nfcsb1v 3035 | . . 3 | |
3 | csbeq1a 3012 | . . 3 | |
4 | 1, 2, 3 | cbvdisj 3916 | . 2 Disj Disj |
5 | csbeq1 3006 | . . 3 | |
6 | 5 | disjnim 3920 | . 2 Disj |
7 | 4, 6 | sylbi 120 | 1 Disj |
Colors of variables: wff set class |
Syntax hints: wi 4 wceq 1331 wne 2308 wral 2416 csb 3003 cin 3070 c0 3363 Disj wdisj 3906 |
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-in1 603 ax-in2 604 ax-io 698 ax-5 1423 ax-7 1424 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-8 1482 ax-10 1483 ax-11 1484 ax-i12 1485 ax-bndl 1486 ax-4 1487 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2121 |
This theorem depends on definitions: df-bi 116 df-tru 1334 df-fal 1337 df-nf 1437 df-sb 1736 df-eu 2002 df-mo 2003 df-clab 2126 df-cleq 2132 df-clel 2135 df-nfc 2270 df-ne 2309 df-ral 2421 df-rex 2422 df-reu 2423 df-rmo 2424 df-v 2688 df-sbc 2910 df-csb 3004 df-dif 3073 df-in 3077 df-nul 3364 df-disj 3907 |
This theorem is referenced by: disji2 3922 |
Copyright terms: Public domain | W3C validator |