Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > eqopab2b | Unicode version |
Description: Equivalence of ordered pair abstraction equality and biconditional. (Contributed by Mario Carneiro, 4-Jan-2017.) |
Ref | Expression |
---|---|
eqopab2b |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ssopab2b 4031 | . . 3 | |
2 | ssopab2b 4031 | . . 3 | |
3 | 1, 2 | anbi12i 447 | . 2 |
4 | eqss 3014 | . 2 | |
5 | 2albiim 1417 | . 2 | |
6 | 3, 4, 5 | 3bitr4i 210 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wa 102 wb 103 wal 1282 wceq 1284 wss 2973 copab 3838 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 104 ax-ia2 105 ax-ia3 106 ax-io 662 ax-5 1376 ax-7 1377 ax-gen 1378 ax-ie1 1422 ax-ie2 1423 ax-8 1435 ax-10 1436 ax-11 1437 ax-i12 1438 ax-bndl 1439 ax-4 1440 ax-14 1445 ax-17 1459 ax-i9 1463 ax-ial 1467 ax-i5r 1468 ax-ext 2063 ax-sep 3896 ax-pow 3948 ax-pr 3964 |
This theorem depends on definitions: df-bi 115 df-3an 921 df-tru 1287 df-nf 1390 df-sb 1686 df-eu 1944 df-mo 1945 df-clab 2068 df-cleq 2074 df-clel 2077 df-nfc 2208 df-ral 2353 df-v 2603 df-un 2977 df-in 2979 df-ss 2986 df-pw 3384 df-sn 3404 df-pr 3405 df-op 3407 df-opab 3840 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |