| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > nfralxy | Unicode version | ||
| Description: Old name for nfralw 2587. (Contributed by Jim Kingdon, 30-May-2018.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| nfralxy.1 |
|
| nfralxy.2 |
|
| Ref | Expression |
|---|---|
| nfralxy |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nftru 1519 |
. . 3
| |
| 2 | nfralxy.1 |
. . . 4
| |
| 3 | 2 | a1i 9 |
. . 3
|
| 4 | nfralxy.2 |
. . . 4
| |
| 5 | 4 | a1i 9 |
. . 3
|
| 6 | 1, 3, 5 | nfraldxy 2583 |
. 2
|
| 7 | 6 | mptru 1411 |
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-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-4 1563 ax-17 1579 ax-ial 1587 ax-i5r 1588 ax-ext 2220 |
| This proof depends on definitions: df-bi 117 df-tru 1405 df-nf 1514 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ral 2533 |
| This theorem is used by: nfra2xy 2592 rspc2 2941 sbcralt 3128 sbcralg 3130 raaanlem 3632 nfint 3980 nfiinxy 4039 nfpo 4446 nfso 4447 nfse 4486 nffrfor 4493 nfwe 4500 ralxpf 4926 funimaexglem 5464 fun11iun 5660 dff13f 5976 nfiso 6012 mpoeq123 6147 nfofr 6309 fmpox 6436 nfrecs 6578 xpf1o 7144 ac6sfi 7202 ismkvnex 7495 lble 9277 fzrevral 10512 nfsum1 12122 nfsum 12123 fsum2dlemstep 12201 fisumcom2 12205 nfcprod1 12321 nfcprod 12322 bezoutlemmain 12775 cnmpt21 15392 setindis 16993 bdsetindis 16995 strcollnfALT 17012 isomninnlem 17079 iswomninnlem 17099 ismkvnnlem 17102 |
| Copyright terms: Public domain | W3C validator |