Theorem bj-bdfindisg 16888

Description: Version of bj-bdfindis 16887 using a class term in the consequent. Constructive proof (from CZF). See the comment of bj-bdfindis 16887 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 16887	. 2 ⊢ ((𝜓 ∧ ∀𝑦 ∈ ω (𝜒 → 𝜃)) → ∀𝑥 ∈ ω 𝜑)
9		bj-bdfindisg.nfa	. . 3 ⊢ Ⅎ𝑥𝐴
10		nfcv 2392	. . 3 ⊢ Ⅎ𝑥ω
11		bj-bdfindisg.nfterm	. . 3 ⊢ Ⅎ𝑥𝜏
12		bj-bdfindisg.term	. . 3 ⊢ (𝑥 = 𝐴 → (𝜑 → 𝜏))
13	9, 10, 11, 12	bj-rspg 16729	. 2 ⊢ (∀𝑥 ∈ ω 𝜑 → (𝐴 ∈ ω → 𝜏))
14	8, 13	syl 14	1 ⊢ ((𝜓 ∧ ∀𝑦 ∈ ω (𝜒 → 𝜃)) → (𝐴 ∈ ω → 𝜏))

Syntax hints:   → wi 4   ∧ wa 104   = wceq 1402  Ⅎwnf 1513   ∈ wcel 2209  Ⅎwnfc 2379  ∀wral 2528  ∅c0 3520  suc csuc 4505  ωcom 4732  BOUNDED wbd 16752

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 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 4254  ax-pr 4341  ax-un 4573  ax-bd0 16753  ax-bdor 16756  ax-bdex 16759  ax-bdeq 16760  ax-bdel 16761  ax-bdsb 16762  ax-bdsep 16824  ax-infvn 16881

This theorem depends on definitions:  df-bi 117  df-tru 1405  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 3711  df-pr 3712  df-uni 3931  df-int 3966  df-suc 4511  df-iom 4733  df-bdc 16781  df-bj-ind 16867

This theorem is referenced by:  bj-nntrans  16891  bj-nnelirr  16893  bj-omtrans  16896