| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > ralunb | Unicode version | ||
| Description: Restricted quantification over a union. (Contributed by Scott Fenton, 12-Apr-2011.) (Proof shortened by Andrew Salmon, 29-Jun-2011.) |
| Ref | Expression |
|---|---|
| ralunb |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elun 3370 |
. . . . . 6
| |
| 2 | 1 | imbi1i 238 |
. . . . 5
|
| 3 | jaob 722 |
. . . . 5
| |
| 4 | 2, 3 | bitri 184 |
. . . 4
|
| 5 | 4 | albii 1523 |
. . 3
|
| 6 | 19.26 1534 |
. . 3
| |
| 7 | 5, 6 | bitri 184 |
. 2
|
| 8 | df-ral 2533 |
. 2
| |
| 9 | df-ral 2533 |
. . 3
| |
| 10 | df-ral 2533 |
. . 3
| |
| 11 | 9, 10 | anbi12i 464 |
. 2
|
| 12 | 7, 8, 11 | 3bitr4i 212 |
1
|
| Colors of variables: wff set class |
| This proof depends on syntax axioms:
|
| This proof depends on 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-ext 2220 |
| This proof depends on definitions: df-bi 117 df-tru 1405 df-nf 1514 df-sb 1816 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ral 2533 df-v 2823 df-un 3224 |
| This theorem is used by: ralun 3411 ralprg 3760 raltpg 3762 ralunsn 3923 dcfi 7315 zsupcllemstep 10672 hashf1lem1 11299 pfxsuffeqwrdeq 11484 rexfiuz 11769 modfsummodlemstep 12240 modfsummod 12241 prmind2 12914 2sqlem10 16342 clwwlkccatlem 16739 clwwlknonex2lem2 16777 nninfsellemdc 17151 nninfsellemsuc 17153 |
| Copyright terms: Public domain | W3C validator |