Theorem bj-vtoclg 35007

Description: A version of vtoclg 3496 with an additional disjoint variable condition (which is removable if we allow use of df-clab 2717, see bj-vtoclg1f 35005), which requires fewer axioms (i.e., removes dependency on ax-6 1976, ax-7 2016, ax-9 2122, ax-12 2177, ax-ext 2710, df-clab 2717, df-cleq 2731, df-v 3425). (Contributed by BJ, 2-Jul-2022.) (Proof modification is discouraged.)

Hypotheses

Ref	Expression
bj-vtoclg.maj	⊢ (𝑥 = 𝐴 → (𝜑 → 𝜓))
bj-vtoclg.min	⊢ 𝜑

Assertion

Ref	Expression
bj-vtoclg	⊢ (𝐴 ∈ 𝑉 → 𝜓)

Distinct variable groups:   𝑥,𝐴   𝑥,𝑉   𝜓,𝑥

Allowed substitution hint:   𝜑(𝑥)

Proof of Theorem bj-vtoclg

Step	Hyp	Ref	Expression
1		elissetv 2820	. 2 ⊢ (𝐴 ∈ 𝑉 → ∃𝑥 𝑥 = 𝐴)
2		bj-vtoclg.maj	. . 3 ⊢ (𝑥 = 𝐴 → (𝜑 → 𝜓))
3		bj-vtoclg.min	. . 3 ⊢ 𝜑
4	2, 3	bj-exlimvmpi 34998	. 2 ⊢ (∃𝑥 𝑥 = 𝐴 → 𝜓)
5	1, 4	syl 17	1 ⊢ (𝐴 ∈ 𝑉 → 𝜓)

Syntax hints:   → wi 4   = wceq 1543  ∃wex 1787   ∈ wcel 2112

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1976  ax-7 2016  ax-8 2114

This theorem depends on definitions:  df-bi 210  df-an 400  df-ex 1788  df-clel 2818

This theorem is referenced by:  bj-zfauscl  35014