| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > th3qlem2 | Unicode version | ||
| Description: Lemma for Exercise 44 version of Theorem 3Q of [Enderton] p. 60, extended to operations on ordered pairs. The fourth hypothesis is the compatibility assumption. (Contributed by NM, 4-Aug-1995.) (Revised by Mario Carneiro, 12-Aug-2015.) |
| Ref | Expression |
|---|---|
| th3q.1 |
|
| th3q.2 |
|
| th3q.4 |
|
| Ref | Expression |
|---|---|
| th3qlem2 |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | th3q.2 |
. . 3
| |
| 2 | eqid 2238 |
. . . . 5
| |
| 3 | breq1 4128 |
. . . . . . . 8
| |
| 4 | 3 | anbi1d 469 |
. . . . . . 7
|
| 5 | oveq1 6082 |
. . . . . . . 8
| |
| 6 | 5 | breq1d 4135 |
. . . . . . 7
|
| 7 | 4, 6 | imbi12d 234 |
. . . . . 6
|
| 8 | 7 | imbi2d 230 |
. . . . 5
|
| 9 | breq2 4129 |
. . . . . . . 8
| |
| 10 | 9 | anbi1d 469 |
. . . . . . 7
|
| 11 | oveq1 6082 |
. . . . . . . 8
| |
| 12 | 11 | breq2d 4137 |
. . . . . . 7
|
| 13 | 10, 12 | imbi12d 234 |
. . . . . 6
|
| 14 | 13 | imbi2d 230 |
. . . . 5
|
| 15 | breq1 4128 |
. . . . . . . . . 10
| |
| 16 | 15 | anbi2d 468 |
. . . . . . . . 9
|
| 17 | oveq2 6083 |
. . . . . . . . . 10
| |
| 18 | 17 | breq1d 4135 |
. . . . . . . . 9
|
| 19 | 16, 18 | imbi12d 234 |
. . . . . . . 8
|
| 20 | 19 | imbi2d 230 |
. . . . . . 7
|
| 21 | breq2 4129 |
. . . . . . . . . 10
| |
| 22 | 21 | anbi2d 468 |
. . . . . . . . 9
|
| 23 | oveq2 6083 |
. . . . . . . . . 10
| |
| 24 | 23 | breq2d 4137 |
. . . . . . . . 9
|
| 25 | 22, 24 | imbi12d 234 |
. . . . . . . 8
|
| 26 | 25 | imbi2d 230 |
. . . . . . 7
|
| 27 | th3q.4 |
. . . . . . . 8
| |
| 28 | 27 | expcom 116 |
. . . . . . 7
|
| 29 | 2, 20, 26, 28 | 2optocl 4847 |
. . . . . 6
|
| 30 | 29 | com12 30 |
. . . . 5
|
| 31 | 2, 8, 14, 30 | 2optocl 4847 |
. . . 4
|
| 32 | 31 | imp 124 |
. . 3
|
| 33 | 1, 32 | th3qlem1 6901 |
. 2
|
| 34 | vex 2824 |
. . . . . . 7
| |
| 35 | vex 2824 |
. . . . . . 7
| |
| 36 | 34, 35 | opex 4364 |
. . . . . 6
|
| 37 | vex 2824 |
. . . . . . 7
| |
| 38 | vex 2824 |
. . . . . . 7
| |
| 39 | 37, 38 | opex 4364 |
. . . . . 6
|
| 40 | eceq1 6832 |
. . . . . . . . 9
| |
| 41 | 40 | eqeq2d 2250 |
. . . . . . . 8
|
| 42 | eceq1 6832 |
. . . . . . . . 9
| |
| 43 | 42 | eqeq2d 2250 |
. . . . . . . 8
|
| 44 | 41, 43 | bi2anan9 614 |
. . . . . . 7
|
| 45 | oveq12 6084 |
. . . . . . . . 9
| |
| 46 | 45 | eceq1d 6833 |
. . . . . . . 8
|
| 47 | 46 | eqeq2d 2250 |
. . . . . . 7
|
| 48 | 44, 47 | anbi12d 477 |
. . . . . 6
|
| 49 | 36, 39, 48 | spc2ev 2921 |
. . . . 5
|
| 50 | 49 | exlimivv 1952 |
. . . 4
|
| 51 | 50 | exlimivv 1952 |
. . 3
|
| 52 | 51 | moimi 2152 |
. 2
|
| 53 | 33, 52 | syl 14 |
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 106 ax-ia2 107 ax-ia3 108 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-sep 4244 ax-pow 4306 ax-pr 4341 |
| This theorem depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ral 2533 df-rex 2534 df-v 2823 df-sbc 3052 df-un 3224 df-in 3226 df-ss 3233 df-pw 3687 df-sn 3711 df-pr 3712 df-op 3714 df-uni 3931 df-br 4126 df-opab 4188 df-xp 4775 df-rel 4776 df-cnv 4777 df-co 4778 df-dm 4779 df-rn 4780 df-res 4781 df-ima 4782 df-iota 5332 df-fv 5380 df-ov 6078 df-er 6797 df-ec 6799 df-qs 6803 |
| This theorem is referenced by: th3qcor 6903 th3q 6904 |
| Copyright terms: Public domain | W3C validator |