Theorem bj-bdfindisg 16664

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

Hypotheses

Ref	Expression
bj-bdfindis.bd	⊢ BOUNDED 𝜑
bj-bdfindis.nf0	⊢ Ⅎ𝑥𝜓
bj-bdfindis.nf1	⊢ Ⅎ𝑥𝜒
bj-bdfindis.nfsuc	⊢ Ⅎ𝑥𝜃
bj-bdfindis.0	⊢ (𝑥 = ∅ → (𝜓 → 𝜑))
bj-bdfindis.1	⊢ (𝑥 = 𝑦 → (𝜑 → 𝜒))
bj-bdfindis.suc	⊢ (𝑥 = suc 𝑦 → (𝜃 → 𝜑))
bj-bdfindisg.nfa	⊢ Ⅎ𝑥𝐴
bj-bdfindisg.nfterm	⊢ Ⅎ𝑥𝜏
bj-bdfindisg.term	⊢ (𝑥 = 𝐴 → (𝜑 → 𝜏))

Assertion

Ref	Expression
bj-bdfindisg	⊢ ((𝜓 ∧ ∀𝑦 ∈ ω (𝜒 → 𝜃)) → (𝐴 ∈ ω → 𝜏))

Distinct variable groups:   𝑥,𝑦   𝜑,𝑦

Allowed substitution hints:   𝜑(𝑥)   𝜓(𝑥,𝑦)   𝜒(𝑥,𝑦)   𝜃(𝑥,𝑦)   𝜏(𝑥,𝑦)   𝐴(𝑥,𝑦)

Proof of Theorem bj-bdfindisg

Step	Hyp	Ref	Expression
1		bj-bdfindis.bd	. . 3 ⊢ BOUNDED 𝜑
2		bj-bdfindis.nf0	. . 3 ⊢ Ⅎ𝑥𝜓
3		bj-bdfindis.nf1	. . 3 ⊢ Ⅎ𝑥𝜒
4		bj-bdfindis.nfsuc	. . 3 ⊢ Ⅎ𝑥𝜃
5		bj-bdfindis.0	. . 3 ⊢ (𝑥 = ∅ → (𝜓 → 𝜑))
6		bj-bdfindis.1	. . 3 ⊢ (𝑥 = 𝑦 → (𝜑 → 𝜒))
7		bj-bdfindis.suc	. . 3 ⊢ (𝑥 = suc 𝑦 → (𝜃 → 𝜑))
8	1, 2, 3, 4, 5, 6, 7	bj-bdfindis 16663	. 2 ⊢ ((𝜓 ∧ ∀𝑦 ∈ ω (𝜒 → 𝜃)) → ∀𝑥 ∈ ω 𝜑)
9		bj-bdfindisg.nfa	. . 3 ⊢ Ⅎ𝑥𝐴
10		nfcv 2375	. . 3 ⊢ Ⅎ𝑥ω
11		bj-bdfindisg.nfterm	. . 3 ⊢ Ⅎ𝑥𝜏
12		bj-bdfindisg.term	. . 3 ⊢ (𝑥 = 𝐴 → (𝜑 → 𝜏))
13	9, 10, 11, 12	bj-rspg 16505	. 2 ⊢ (∀𝑥 ∈ ω 𝜑 → (𝐴 ∈ ω → 𝜏))
14	8, 13	syl 14	1 ⊢ ((𝜓 ∧ ∀𝑦 ∈ ω (𝜒 → 𝜃)) → (𝐴 ∈ ω → 𝜏))

Syntax hints:   → wi 4   ∧ wa 104   = wceq 1398  Ⅎwnf 1509   ∈ wcel 2202  Ⅎwnfc 2362  ∀wral 2511  ∅c0 3496  suc csuc 4468  ωcom 4694  BOUNDED wbd 16528

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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2204  ax-14 2205  ax-ext 2213  ax-nul 4220  ax-pr 4305  ax-un 4536  ax-bd0 16529  ax-bdor 16532  ax-bdex 16535  ax-bdeq 16536  ax-bdel 16537  ax-bdsb 16538  ax-bdsep 16600  ax-infvn 16657

This theorem depends on definitions:  df-bi 117  df-tru 1401  df-nf 1510  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ral 2516  df-rex 2517  df-rab 2520  df-v 2805  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-nul 3497  df-sn 3679  df-pr 3680  df-uni 3899  df-int 3934  df-suc 4474  df-iom 4695  df-bdc 16557  df-bj-ind 16643

This theorem is referenced by:  bj-nntrans  16667  bj-nnelirr  16669  bj-omtrans  16672