| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > nfttrcl | Structured version Visualization version GIF version | ||
| Description: Bound variable hypothesis builder for transitive closure. (Contributed by Scott Fenton, 17-Oct-2024.) |
| Ref | Expression |
|---|---|
| nfttrcl.1 | ⊢ Ⅎ𝑥𝑅 |
| Ref | Expression |
|---|---|
| nfttrcl | ⊢ Ⅎ𝑥t++𝑅 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nfttrcl.1 | . . . 4 ⊢ Ⅎ𝑥𝑅 | |
| 2 | 1 | a1i 11 | . . 3 ⊢ (⊤ → Ⅎ𝑥𝑅) |
| 3 | 2 | nfttrcld 9692 | . 2 ⊢ (⊤ → Ⅎ𝑥t++𝑅) |
| 4 | 3 | mptru 1577 | 1 ⊢ Ⅎ𝑥t++𝑅 |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ⊤wtru 1571 Ⅎwnfc 2909 t++cttrcl 9689 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2734 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ral 3079 df-rex 3089 df-rab 3415 df-v 3455 df-dif 3905 df-un 3907 df-ss 3919 df-nul 4283 df-if 4486 df-sn 4588 df-pr 4590 df-op 4594 df-br 5108 df-opab 5172 df-ttrcl 9690 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |