Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > bianass | Structured version Visualization version Unicode version |
Description: An inference to merge two lists of conjuncts. (Contributed by Giovanni Mascellani, 23-May-2019.) |
Ref | Expression |
---|---|
bianass.1 |
Ref | Expression |
---|---|
bianass |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | bianass.1 | . . 3 | |
2 | 1 | anbi2i 730 | . 2 |
3 | anass 681 | . 2 | |
4 | 2, 3 | bitr4i 267 | 1 |
Colors of variables: wff setvar class |
Syntax hints: wb 196 wa 384 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 |
This theorem depends on definitions: df-bi 197 df-an 386 |
This theorem is referenced by: cnvresima 5623 wwlksnextwrd 26792 etasslt 31920 bj-restuni 33050 |
Copyright terms: Public domain | W3C validator |