Theorem bj-findisg 13167

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

Hypotheses

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

Assertion

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

Distinct variable groups:   𝑥,𝑦   𝜑,𝑦

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

Proof of Theorem bj-findisg

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

Syntax hints:   → wi 4   ∧ wa 103   = wceq 1331  Ⅎwnf 1436   ∈ wcel 1480  Ⅎwnfc 2266  ∀wral 2414  ∅c0 3358  suc csuc 4282  ωcom 4499

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 603  ax-in2 604  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-13 1491  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2119  ax-nul 4049  ax-pr 4126  ax-un 4350  ax-setind 4447  ax-bd0 13000  ax-bdim 13001  ax-bdan 13002  ax-bdor 13003  ax-bdn 13004  ax-bdal 13005  ax-bdex 13006  ax-bdeq 13007  ax-bdel 13008  ax-bdsb 13009  ax-bdsep 13071  ax-infvn 13128

This theorem depends on definitions:  df-bi 116  df-tru 1334  df-fal 1337  df-nf 1437  df-sb 1736  df-clab 2124  df-cleq 2130  df-clel 2133  df-nfc 2268  df-ral 2419  df-rex 2420  df-rab 2423  df-v 2683  df-dif 3068  df-un 3070  df-in 3072  df-ss 3079  df-nul 3359  df-sn 3528  df-pr 3529  df-uni 3732  df-int 3767  df-suc 4288  df-iom 4500  df-bdc 13028  df-bj-ind 13114

This theorem is referenced by: (None)