![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > nfsbcw | Unicode version |
Description: Bound-variable hypothesis builder for class substitution. Version of nfsbc 3010 with a disjoint variable condition, which in the future may make it possible to reduce axiom usage. (Contributed by NM, 7-Sep-2014.) (Revised by GG, 10-Jan-2024.) |
Ref | Expression |
---|---|
nfsbcw.1 |
![]() ![]() ![]() ![]() |
nfsbcw.2 |
![]() ![]() ![]() ![]() |
Ref | Expression |
---|---|
nfsbcw |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nftru 1480 |
. . 3
![]() ![]() ![]() ![]() | |
2 | nfsbcw.1 |
. . . 4
![]() ![]() ![]() ![]() | |
3 | 2 | a1i 9 |
. . 3
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
4 | nfsbcw.2 |
. . . 4
![]() ![]() ![]() ![]() | |
5 | 4 | a1i 9 |
. . 3
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
6 | 1, 3, 5 | nfsbcdw 3118 |
. 2
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
7 | 6 | mptru 1373 |
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-5 1461 ax-7 1462 ax-gen 1463 ax-ie1 1507 ax-ie2 1508 ax-8 1518 ax-11 1520 ax-4 1524 ax-17 1540 ax-i9 1544 ax-ial 1548 ax-i5r 1549 ax-ext 2178 |
This theorem depends on definitions: df-bi 117 df-tru 1367 df-nf 1475 df-sb 1777 df-clab 2183 df-cleq 2189 df-clel 2192 df-nfc 2328 df-sbc 2990 |
This theorem is referenced by: opelopabgf 4304 elovmporab 6123 elovmporab1w 6124 |
Copyright terms: Public domain | W3C validator |