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

Theorem hbdm 3352
Description: Bound-variable hypothesis builder for domain.
Hypothesis
Ref Expression
hbdm.1 |- (y e. A -> A.x y e. A)
Assertion
Ref Expression
hbdm |- (y e. dom A -> A.x y e. dom A)
Distinct variable groups:   x,y   y,A

Proof of Theorem hbdm
StepHypRef Expression
1 dfdm4 3305 . 2 |- dom A = ran `' A
2 hbdm.1 . . . 4 |- (y e. A -> A.x y e. A)
32hbcnv 3295 . . 3 |- (y e. `'A -> A.x y e. `'A)
43hbrn 3351 . 2 |- (y e. ran `' A -> A.x y e. ran `' A)
51, 4hbxfr 1563 1 |- (y e. dom A -> A.x y e. dom A)
Colors of variables: wff set class
Syntax hints:   -> wi 3  A.wal 954   e. wcel 958  `'ccnv 3169  dom cdm 3170  ran crn 3171
This theorem is referenced by:  hbfn 3584
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-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-br 2620  df-opab 2667  df-cnv 3186  df-dm 3188  df-rn 3189
Copyright terms: Public domain