Theorem bj-findisg 17006

Description: Version of bj-findis 17005 using a class term in the consequent. Constructive proof (from CZF). See the comment of bj-findis 17005 for explanations. (Contributed by BJ, 21-Nov-2019.) (Proof modification is discouraged.)

Hypotheses

Ref	Expression
bj-findis.nf0	|- F/ x ps
bj-findis.nf1	|- F/ x ch
bj-findis.nfsuc	|- F/ x th
bj-findis.0	|- ( x = (/) -> ( ps -> ph ) )
bj-findis.1	|- ( x = y -> ( ph -> ch ) )
bj-findis.suc	|- ( x = suc y -> ( th -> ph ) )
bj-findisg.nfa	|- F/_ x A
bj-findisg.nfterm	|- F/ x ta
bj-findisg.term	|- ( x = A -> ( ph -> ta ) )

Assertion

Ref	Expression
bj-findisg	|- ( ( ps /\ A. y e. om ( ch -> th ) ) -> ( A e. om -> ta ) )

Distinct variable groups:   x, y   ph, y

Allowed substitution hints:   ph( x)   ps( x, y)   ch( x, y)   th( x, y)   ta( x, y)   A( x, y)

Proof of Theorem bj-findisg

Step	Hyp	Ref	Expression
1		bj-findis.nf0	. . 3 |- F/ x ps
2		bj-findis.nf1	. . 3 |- F/ x ch
3		bj-findis.nfsuc	. . 3 |- F/ x th
4		bj-findis.0	. . 3 |- ( x = (/) -> ( ps -> ph ) )
5		bj-findis.1	. . 3 |- ( x = y -> ( ph -> ch ) )
6		bj-findis.suc	. . 3 |- ( x = suc y -> ( th -> ph ) )
7	1, 2, 3, 4, 5, 6	bj-findis 17005	. 2 |- ( ( ps /\ A. y e. om ( ch -> th ) ) -> A. x e. om ph )
8		bj-findisg.nfa	. . 3 |- F/_ x A
9		nfcv 2392	. . 3 |- F/_ x om
10		bj-findisg.nfterm	. . 3 |- F/ x ta
11		bj-findisg.term	. . 3 |- ( x = A -> ( ph -> ta ) )
12	8, 9, 10, 11	bj-rspg 16815	. 2 |- ( A. x e. om ph -> ( A e. om -> ta ) )
13	7, 12	syl 14	1 |- ( ( ps /\ A. y e. om ( ch -> th ) ) -> ( A e. om -> ta ) )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   = wceq 1402   F/wnf 1513   e. wcel 2209   F/_wnfc 2379   A.wral 2528   (/)c0 3520   suc csuc 4510   omcom 4737

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-nul 4259  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-bd0 16839  ax-bdim 16840  ax-bdan 16841  ax-bdor 16842  ax-bdn 16843  ax-bdal 16844  ax-bdex 16845  ax-bdeq 16846  ax-bdel 16847  ax-bdsb 16848  ax-bdsep 16910  ax-infvn 16967

This proof depends on definitions:  df-bi 117  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-sn 3715  df-pr 3716  df-uni 3936  df-int 3971  df-suc 4516  df-iom 4738  df-bdc 16867  df-bj-ind 16953

This theorem is used by: (None)