Users' Mathboxes Mathbox for BJ < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >   Mathboxes  >  bj-findisg Unicode version

Theorem bj-findisg 16575
Description: Version of bj-findis 16574 using a class term in the consequent. Constructive proof (from CZF). See the comment of bj-findis 16574 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
StepHypRef 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 )
)
71, 2, 3, 4, 5, 6bj-findis 16574 . 2  |-  ( ( ps  /\  A. y  e.  om  ( ch  ->  th ) )  ->  A. x  e.  om  ph )
8 bj-findisg.nfa . . 3  |-  F/_ x A
9 nfcv 2374 . . 3  |-  F/_ x om
10 bj-findisg.nfterm . . 3  |-  F/ x ta
11 bj-findisg.term . . 3  |-  ( x  =  A  ->  ( ph  ->  ta ) )
128, 9, 10, 11bj-rspg 16383 . 2  |-  ( A. x  e.  om  ph  ->  ( A  e.  om  ->  ta ) )
137, 12syl 14 1  |-  ( ( ps  /\  A. y  e.  om  ( ch  ->  th ) )  ->  ( A  e.  om  ->  ta ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1397   F/wnf 1508    e. wcel 2202   F/_wnfc 2361   A.wral 2510   (/)c0 3494   suc csuc 4462   omcom 4688
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-nul 4215  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-bd0 16408  ax-bdim 16409  ax-bdan 16410  ax-bdor 16411  ax-bdn 16412  ax-bdal 16413  ax-bdex 16414  ax-bdeq 16415  ax-bdel 16416  ax-bdsb 16417  ax-bdsep 16479  ax-infvn 16536
This theorem depends on definitions:  df-bi 117  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ral 2515  df-rex 2516  df-rab 2519  df-v 2804  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-sn 3675  df-pr 3676  df-uni 3894  df-int 3929  df-suc 4468  df-iom 4689  df-bdc 16436  df-bj-ind 16522
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator