Theorem hbrdg 3942

Description: Bound-variable hypothesis builder for the recursive definition generator.

Hypotheses

Ref	Expression
hbrdg.1	|- (y e. F -> A.x y e. F)
hbrdg.2	|- (y e. A -> A.x y e. A)

Assertion

Ref	Expression
hbrdg	|- (y e. rec(F, A) -> A.x y e. rec(F, A))

Distinct variable groups:   y,F   y,A   x,y

Proof of Theorem hbrdg

Step	Hyp	Ref	Expression
1		df-rdg 3938	. 2 |- rec(F, A) = U.{f | E.w e. On (f Fn w /\ A.v e. w (f` v) = ({<.g, z>. | z = if(g = (/), A, if(Lim dom g, U.ran g, (F` (g` U.dom g))))}` (f |` v)))}
2		ax-17 973	. . . . 5 |- (w e. On -> A.x w e. On)
3		ax-17 973	. . . . . 6 |- (f Fn w -> A.x f Fn w)
4		ax-17 973	. . . . . . 7 |- (v e. w -> A.x v e. w)
5		ax-17 973	. . . . . . . 8 |- (y e. (f` v) -> A.x y e. (f` v))
6		ax-17 973	. . . . . . . . . . 11 |- (y e. z -> A.x y e. z)
7		ax-17 973	. . . . . . . . . . . 12 |- (g = (/) -> A.x g = (/))
8		hbrdg.2	. . . . . . . . . . . 12 |- (y e. A -> A.x y e. A)
9		ax-17 973	. . . . . . . . . . . . 13 |- (Lim dom g -> A.xLim dom g)
10		ax-17 973	. . . . . . . . . . . . 13 |- (y e. U.ran g -> A.x y e. U.ran g)
11		hbrdg.1	. . . . . . . . . . . . . 14 |- (y e. F -> A.x y e. F)
12		ax-17 973	. . . . . . . . . . . . . 14 |- (y e. (g` U.dom g) -> A.x y e. (g` U.dom g))
13	11, 12	hbfv 3735	. . . . . . . . . . . . 13 |- (y e. (F` (g` U.dom g)) -> A.x y e. (F` (g` U.dom g)))
14	9, 10, 13	hbif 2377	. . . . . . . . . . . 12 |- (y e. if(Lim dom g, U.ran g, (F` (g` U.dom g))) -> A.x y e. if(Lim dom g, U.ran g, (F` (g` U.dom g))))
15	7, 8, 14	hbif 2377	. . . . . . . . . . 11 |- (y e. if(g = (/), A, if(Lim dom g, U.ran g, (F` (g` U.dom g)))) -> A.x y e. if(g = (/), A, if(Lim dom g, U.ran g, (F` (g` U.dom g)))))
16	6, 15	hbeq 1568	. . . . . . . . . 10 |- (z = if(g = (/), A, if(Lim dom g, U.ran g, (F` (g` U.dom g)))) -> A.x z = if(g = (/), A, if(Lim dom g, U.ran g, (F` (g` U.dom g)))))
17	16	hbopab 2818	. . . . . . . . 9 |- (y e. {<.g, z>. | z = if(g = (/), A, if(Lim dom g, U.ran g, (F` (g` U.dom g))))} -> A.x y e. {<.g, z>. | z = if(g = (/), A, if(Lim dom g, U.ran g, (F` (g` U.dom g))))})
18		ax-17 973	. . . . . . . . 9 |- (y e. (f |` v) -> A.x y e. (f |` v))
19	17, 18	hbfv 3735	. . . . . . . 8 |- (y e. ({<.g, z>. | z = if(g = (/), A, if(Lim dom g, U.ran g, (F` (g` U.dom g))))}` (f |` v)) -> A.x y e. ({<.g, z>. | z = if(g = (/), A, if(Lim dom g, U.ran g, (F` (g` U.dom g))))}` (f |` v)))
20	5, 19	hbeq 1568	. . . . . . 7 |- ((f` v) = ({<.g, z>. | z = if(g = (/), A, if(Lim dom g, U.ran g, (F` (g` U.dom g))))}` (f |` v)) -> A.x(f` v) = ({<.g, z>. | z = if(g = (/), A, if(Lim dom g, U.ran g, (F` (g` U.dom g))))}` (f |` v)))
21	4, 20	hbral 1689	. . . . . 6 |- (A.v e. w (f` v) = ({<.g, z>. | z = if(g = (/), A, if(Lim dom g, U.ran g, (F` (g` U.dom g))))}` (f |` v)) -> A.xA.v e. w (f` v) = ({<.g, z>. | z = if(g = (/), A, if(Lim dom g, U.ran g, (F` (g` U.dom g))))}` (f |` v)))
22	3, 21	hban 1011	. . . . 5 |- ((f Fn w /\ A.v e. w (f` v) = ({<.g, z>. | z = if(g = (/), A, if(Lim dom g, U.ran g, (F` (g` U.dom g))))}` (f |` v))) -> A.x(f Fn w /\ A.v e. w (f` v) = ({<.g, z>. | z = if(g = (/), A, if(Lim dom g, U.ran g, (F` (g` U.dom g))))}` (f |` v))))
23	2, 22	hbrex 1691	. . . 4 |- (E.w e. On (f Fn w /\ A.v e. w (f` v) = ({<.g, z>. | z = if(g = (/), A, if(Lim dom g, U.ran g, (F` (g` U.dom g))))}` (f |` v))) -> A.xE.w e. On (f Fn w /\ A.v e. w (f` v) = ({<.g, z>. | z = if(g = (/), A, if(Lim dom g, U.ran g, (F` (g` U.dom g))))}` (f |` v))))
24	23	hbab 1470	. . 3 |- (y e. {f | E.w e. On (f Fn w /\ A.v e. w (f` v) = ({<.g, z>. | z = if(g = (/), A, if(Lim dom g, U.ran g, (F` (g` U.dom g))))}` (f |` v)))} -> A.x y e. {f | E.w e. On (f Fn w /\ A.v e. w (f` v) = ({<.g, z>. | z = if(g = (/), A, if(Lim dom g, U.ran g, (F` (g` U.dom g))))}` (f |` v)))})
25	24	hbuni 2513	. 2 |- (y e. U.{f | E.w e. On (f Fn w /\ A.v e. w (f` v) = ({<.g, z>. | z = if(g = (/), A, if(Lim dom g, U.ran g, (F` (g` U.dom g))))}` (f |` v)))} -> A.x y e. U.{f | E.w e. On (f Fn w /\ A.v e. w (f` v) = ({<.g, z>. | z = if(g = (/), A, if(Lim dom g, U.ran g, (F` (g` U.dom g))))}` (f |` v)))})
26	1, 25	hbxfr 1566	1 |- (y e. rec(F, A) -> A.x y e. rec(F, A))

Syntax hints:   -> wi 3   /\ wa 223  A.wal 956   = wceq 958   e. wcel 960  {cab 1466  A.wral 1648  E.wrex 1649  (/)c0 2283  ifcif 2365  U.cuni 2507  {copab 2671  Oncon0 2954  Lim wlim 2955  dom cdm 3176  ran crn 3177   |` cres 3178   Fn wfn 3183  ` cfv 3188  reccrdg 3937

This theorem is referenced by:  rdgsucopab 3952  rdgsucopabn 3953  frsucopab 3960  abianfplem 3967  unbnn 4555  inf0 4615  trcl 4655  alephfplem2 4908  om2uzsuc 6297

This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 964  ax-gen 965  ax-8 966  ax-10 968  ax-11 969  ax-12 970  ax-13 971  ax-14 972  ax-17 973  ax-4 975  ax-5o 977  ax-6o 980  ax-9o 1125  ax-10o 1142  ax-16 1212  ax-11o 1220  ax-ext 1462  ax-sep 2708  ax-pow 2748  ax-pr 2785

This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 983  df-sb 1174  df-eu 1384  df-mo 1385  df-clab 1467  df-cleq 1472  df-clel 1475  df-ne 1590  df-ral 1652  df-rex 1653  df-v 1815  df-dif 2052  df-un 2053  df-in 2054  df-ss 2056  df-nul 2284  df-if 2366  df-pw 2406  df-sn 2416  df-pr 2417  df-op 2420  df-uni 2508  df-br 2625  df-opab 2672  df-xp 3190  df-cnv 3192  df-dm 3194  df-rn 3195  df-res 3196  df-ima 3197  df-fv 3204  df-rdg 3938

Copyright terms: Public domain