| 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 4448 nfso 4449 nfse 4488 nffrfor 4495 nfwe 4502 ralxpf 4928 funimaexglem 5467 fun11iun 5663 dff13f 5979 nfiso 6015 mpoeq123 6150 nfofr 6313 fmpox 6440 nfrecs 6582 xpf1o 7148 ac6sfi 7206 ismkvnex 7501 lble 9285 fzrevral 10529 nfsum1 12147 nfsum 12148 fsum2dlemstep 12226 fisumcom2 12230 nfcprod1 12346 nfcprod 12347 bezoutlemmain 12800 cnmpt21 15517 setindis 17198 bdsetindis 17200 strcollnfALT 17217 isomninnlem 17285 iswomninnlem 17306 ismkvnnlem 17309 |
| Copyright terms: Public domain | W3C validator |