HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem hbfvd 3730
Description: Deduction version of bound-variable hypothesis builder hbfv 3729. If a closed theorem version is desired, see hbfvd2 3731.
Hypotheses
Ref Expression
hbfvd.1 |- (ph -> A.xph)
hbfvd.2 |- (ph -> (y e. F -> A.x y e. F))
hbfvd.3 |- (ph -> (y e. A -> A.x y e. A))
Assertion
Ref Expression
hbfvd |- (ph -> (y e. (F` A) -> A.x y e. (F` A)))
Distinct variable groups:   y,A   y,F   ph,y   x,y

Proof of Theorem hbfvd
StepHypRef Expression
1 hba1 1003 . . . . 5 |- (A.x z e. F -> A.xA.x z e. F)
21hbab 1467 . . . 4 |- (y e. {z | A.x z e. F} -> A.x y e. {z | A.x z e. F})
3 hba1 1003 . . . . 5 |- (A.x z e. A -> A.xA.x z e. A)
43hbab 1467 . . . 4 |- (y e. {z | A.x z e. A} -> A.x y e. {z | A.x z e. A})
52, 4hbfv 3729 . . 3 |- (y e. ({z | A.x z e. F}` {z | A.x z e. A}) -> A.x y e. ({z | A.x z e. F}` {z | A.x z e. A}))
65a1i 8 . 2 |- (ph -> (y e. ({z | A.x z e. F}` {z | A.x z e. A}) -> A.x y e. ({z | A.x z e. F}` {z | A.x z e. A})))
7 hbfvd.2 . . . . . . 7 |- (ph -> (y e. F -> A.x y e. F))
8719.21aiv 1286 . . . . . 6 |- (ph -> A.y(y e. F -> A.x y e. F))
9 abidhb 1912 . . . . . 6 |- (A.y(y e. F -> A.x y e. F) -> {z | A.x z e. F} = F)
108, 9syl 10 . . . . 5 |- (ph -> {z | A.x z e. F} = F)
1110fveq1d 3726 . . . 4 |- (ph -> ({z | A.x z e. F}` {z | A.x z e. A}) = (F` {z | A.x z e. A}))
12 hbfvd.3 . . . . . . 7 |- (ph -> (y e. A -> A.x y e. A))
131219.21aiv 1286 . . . . . 6 |- (ph -> A.y(y e. A -> A.x y e. A))
14 abidhb 1912 . . . . . 6 |- (A.y(y e. A -> A.x y e. A) -> {z | A.x z e. A} = A)
1513, 14syl 10 . . . . 5 |- (ph -> {z | A.x z e. A} = A)
1615fveq2d 3728 . . . 4 |- (ph -> (F` {z | A.x z e. A}) = (F` A))
1711, 16eqtrd 1507 . . 3 |- (ph -> ({z | A.x z e. F}` {z | A.x z e. A}) = (F` A))
1817eleq2d 1541 . 2 |- (ph -> (y e. ({z | A.x z e. F}` {z | A.x z e. A}) <-> y e. (F` A)))
19 hbfvd.1 . . 3 |- (ph -> A.xph)
2019, 18albid 1104 . 2 |- (ph -> (A.x y e. ({z | A.x z e. F}` {z | A.x z e. A}) <-> A.x y e. (F` A)))
216, 18, 203imtr3d 542 1 |- (ph -> (y e. (F` A) -> A.x y e. (F` A)))
Colors of variables: wff set class
Syntax hints:   -> wi 3  A.wal 954   = wceq 956   e. wcel 958  {cab 1463  ` cfv 3182
This theorem is referenced by:  csbfv12g 3742
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 962  ax-gen 963  ax-8 964  ax-10 966  ax-11 967  ax-12 968  ax-13 969  ax-14 970  ax-17 971  ax-4 973  ax-5o 975  ax-6o 978  ax-9o 1123  ax-10o 1140  ax-16 1210  ax-11o 1218  ax-ext 1459  ax-sep 2703  ax-pow 2742  ax-pr 2779
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 981  df-sb 1172  df-eu 1382  df-mo 1383  df-clab 1464  df-cleq 1469  df-clel 1472  df-ne 1587  df-rex 1650  df-v 1812  df-dif 2049  df-un 2050  df-in 2051  df-ss 2053  df-nul 2281  df-pw 2402  df-sn 2412  df-pr 2413  df-op 2416  df-uni 2504  df-br 2620  df-opab 2667  df-xp 3184  df-cnv 3186  df-dm 3188  df-rn 3189  df-res 3190  df-ima 3191  df-fv 3198
Copyright terms: Public domain