Theorem r19.30dc 2653

Description: Restricted quantifier version of 19.30dc 1650. (Contributed by Scott Fenton, 25-Feb-2011.) (Proof shortened by Wolf Lammen, 18-Jun-2023.)

Assertion

Ref	Expression
r19.30dc	⊢ ((∀𝑥 ∈ 𝐴 (𝜑 ∨ 𝜓) ∧ DECID ∃𝑥 ∈ 𝐴 𝜓) → (∀𝑥 ∈ 𝐴 𝜑 ∨ ∃𝑥 ∈ 𝐴 𝜓))

Proof of Theorem r19.30dc

Step	Hyp	Ref	Expression
1		ralnex 2494	. . . . 5 ⊢ (∀𝑥 ∈ 𝐴 ¬ 𝜓 ↔ ¬ ∃𝑥 ∈ 𝐴 𝜓)
2		pm2.53 724	. . . . . . 7 ⊢ ((𝜓 ∨ 𝜑) → (¬ 𝜓 → 𝜑))
3	2	orcoms 732	. . . . . 6 ⊢ ((𝜑 ∨ 𝜓) → (¬ 𝜓 → 𝜑))
4	3	ral2imi 2571	. . . . 5 ⊢ (∀𝑥 ∈ 𝐴 (𝜑 ∨ 𝜓) → (∀𝑥 ∈ 𝐴 ¬ 𝜓 → ∀𝑥 ∈ 𝐴 𝜑))
5	1, 4	biimtrrid 153	. . . 4 ⊢ (∀𝑥 ∈ 𝐴 (𝜑 ∨ 𝜓) → (¬ ∃𝑥 ∈ 𝐴 𝜓 → ∀𝑥 ∈ 𝐴 𝜑))
6	5	adantr 276	. . 3 ⊢ ((∀𝑥 ∈ 𝐴 (𝜑 ∨ 𝜓) ∧ DECID ∃𝑥 ∈ 𝐴 𝜓) → (¬ ∃𝑥 ∈ 𝐴 𝜓 → ∀𝑥 ∈ 𝐴 𝜑))
7		dfordc 894	. . . 4 ⊢ (DECID ∃𝑥 ∈ 𝐴 𝜓 → ((∃𝑥 ∈ 𝐴 𝜓 ∨ ∀𝑥 ∈ 𝐴 𝜑) ↔ (¬ ∃𝑥 ∈ 𝐴 𝜓 → ∀𝑥 ∈ 𝐴 𝜑)))
8	7	adantl 277	. . 3 ⊢ ((∀𝑥 ∈ 𝐴 (𝜑 ∨ 𝜓) ∧ DECID ∃𝑥 ∈ 𝐴 𝜓) → ((∃𝑥 ∈ 𝐴 𝜓 ∨ ∀𝑥 ∈ 𝐴 𝜑) ↔ (¬ ∃𝑥 ∈ 𝐴 𝜓 → ∀𝑥 ∈ 𝐴 𝜑)))
9	6, 8	mpbird 167	. 2 ⊢ ((∀𝑥 ∈ 𝐴 (𝜑 ∨ 𝜓) ∧ DECID ∃𝑥 ∈ 𝐴 𝜓) → (∃𝑥 ∈ 𝐴 𝜓 ∨ ∀𝑥 ∈ 𝐴 𝜑))
10	9	orcomd 731	1 ⊢ ((∀𝑥 ∈ 𝐴 (𝜑 ∨ 𝜓) ∧ DECID ∃𝑥 ∈ 𝐴 𝜓) → (∀𝑥 ∈ 𝐴 𝜑 ∨ ∃𝑥 ∈ 𝐴 𝜓))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 104   ↔ wb 105   ∨ wo 710  DECID wdc 836  ∀wral 2484  ∃wrex 2485

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 711  ax-5 1470  ax-gen 1472  ax-ie2 1517

This theorem depends on definitions:  df-bi 117  df-dc 837  df-tru 1376  df-fal 1379  df-ral 2489  df-rex 2490

This theorem is referenced by:  exmidontriimlem1  7333