ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  cbv1h Structured version   Unicode version

Theorem cbv1h 1630
Description: Rule used to change bound variables, using implicit substitution. (Contributed by NM, 5-Aug-1993.) (Proof shortened by Wolf Lammen, 13-May-2018.)
Hypotheses
Ref Expression
cbv1h.1
cbv1h.2
cbv1h.3
Assertion
Ref Expression
cbv1h

Proof of Theorem cbv1h
StepHypRef Expression
1 nfa1 1431 . 2  F/
2 nfa2 1468 . 2  F/
3 sp 1398 . . . . 5
43sps 1427 . . . 4
5 cbv1h.1 . . . 4
64, 5syl 14 . . 3
72, 6nfd 1413 . 2  F/
8 cbv1h.2 . . . 4
94, 8syl 14 . . 3
101, 9nfd 1413 . 2  F/
11 cbv1h.3 . . 3
124, 11syl 14 . 2
131, 2, 7, 10, 12cbv1 1629 1
Colors of variables: wff set class
Syntax hints:   wi 4  wal 1240
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-5 1333  ax-7 1334  ax-gen 1335  ax-ie1 1379  ax-ie2 1380  ax-4 1397  ax-i9 1420  ax-ial 1424  ax-i5r 1425
This theorem depends on definitions:  df-bi 110  df-nf 1347
This theorem is referenced by:  cbv2h  1631
  Copyright terms: Public domain W3C validator