Theorem ralnralall 4515

Description: A contradiction concerning restricted generalization for a nonempty set implies anything. (Contributed by Alexander van der Vekens, 4-Sep-2018.)

Assertion

Ref	Expression
ralnralall	⊢ (𝐴 ≠ ∅ → ((∀𝑥 ∈ 𝐴 𝜑 ∧ ∀𝑥 ∈ 𝐴 ¬ 𝜑) → 𝜓))

Distinct variable group:   𝑥,𝐴

Allowed substitution hints:   𝜑(𝑥)   𝜓(𝑥)

Proof of Theorem ralnralall

Step	Hyp	Ref	Expression
1		r19.26 3111	. 2 ⊢ (∀𝑥 ∈ 𝐴 (𝜑 ∧ ¬ 𝜑) ↔ (∀𝑥 ∈ 𝐴 𝜑 ∧ ∀𝑥 ∈ 𝐴 ¬ 𝜑))
2		pm3.24 402	. . . . 5 ⊢ ¬ (𝜑 ∧ ¬ 𝜑)
3	2	bifal 1556	. . . 4 ⊢ ((𝜑 ∧ ¬ 𝜑) ↔ ⊥)
4	3	ralbii 3093	. . 3 ⊢ (∀𝑥 ∈ 𝐴 (𝜑 ∧ ¬ 𝜑) ↔ ∀𝑥 ∈ 𝐴 ⊥)
5		r19.3rzv 4499	. . . 4 ⊢ (𝐴 ≠ ∅ → (⊥ ↔ ∀𝑥 ∈ 𝐴 ⊥))
6		falim 1557	. . . 4 ⊢ (⊥ → 𝜓)
7	5, 6	biimtrrdi 254	. . 3 ⊢ (𝐴 ≠ ∅ → (∀𝑥 ∈ 𝐴 ⊥ → 𝜓))
8	4, 7	biimtrid 242	. 2 ⊢ (𝐴 ≠ ∅ → (∀𝑥 ∈ 𝐴 (𝜑 ∧ ¬ 𝜑) → 𝜓))
9	1, 8	biimtrrid 243	1 ⊢ (𝐴 ≠ ∅ → ((∀𝑥 ∈ 𝐴 𝜑 ∧ ∀𝑥 ∈ 𝐴 ¬ 𝜑) → 𝜓))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 395  ⊥wfal 1552   ≠ wne 2940  ∀wral 3061  ∅c0 4333

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-9 2118  ax-12 2177  ax-ext 2708

This theorem depends on definitions:  df-bi 207  df-an 396  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-clab 2715  df-cleq 2729  df-ne 2941  df-ral 3062  df-dif 3954  df-nul 4334

This theorem is referenced by: (None)