Theorem bj-bdfindisg 14971

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

Syntax hints:   → wi 4   ∧ wa 104   = wceq 1363  Ⅎwnf 1470   ∈ wcel 2158  Ⅎwnfc 2316  ∀wral 2465  ∅c0 3434  suc csuc 4377  ωcom 4601  BOUNDED wbd 14835

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 615  ax-in2 616  ax-io 710  ax-5 1457  ax-7 1458  ax-gen 1459  ax-ie1 1503  ax-ie2 1504  ax-8 1514  ax-10 1515  ax-11 1516  ax-i12 1517  ax-bndl 1519  ax-4 1520  ax-17 1536  ax-i9 1540  ax-ial 1544  ax-i5r 1545  ax-13 2160  ax-14 2161  ax-ext 2169  ax-nul 4141  ax-pr 4221  ax-un 4445  ax-bd0 14836  ax-bdor 14839  ax-bdex 14842  ax-bdeq 14843  ax-bdel 14844  ax-bdsb 14845  ax-bdsep 14907  ax-infvn 14964

This theorem depends on definitions:  df-bi 117  df-tru 1366  df-nf 1471  df-sb 1773  df-clab 2174  df-cleq 2180  df-clel 2183  df-nfc 2318  df-ral 2470  df-rex 2471  df-rab 2474  df-v 2751  df-dif 3143  df-un 3145  df-in 3147  df-ss 3154  df-nul 3435  df-sn 3610  df-pr 3611  df-uni 3822  df-int 3857  df-suc 4383  df-iom 4602  df-bdc 14864  df-bj-ind 14950

This theorem is referenced by:  bj-nntrans  14974  bj-nnelirr  14976  bj-omtrans  14979