MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  ralnralall Structured version   Visualization version   GIF version

Theorem ralnralall 4465
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
StepHypRef Expression
1 r19.26 3095 . 2 (∀𝑥𝐴 (𝜑 ∧ ¬ 𝜑) ↔ (∀𝑥𝐴 𝜑 ∧ ∀𝑥𝐴 ¬ 𝜑))
2 pm3.24 402 . . . . 5 ¬ (𝜑 ∧ ¬ 𝜑)
32bifal 1558 . . . 4 ((𝜑 ∧ ¬ 𝜑) ↔ ⊥)
43ralbii 3081 . . 3 (∀𝑥𝐴 (𝜑 ∧ ¬ 𝜑) ↔ ∀𝑥𝐴 ⊥)
5 r19.3rzv 4455 . . . 4 (𝐴 ≠ ∅ → (⊥ ↔ ∀𝑥𝐴 ⊥))
6 falim 1559 . . . 4 (⊥ → 𝜓)
75, 6biimtrrdi 254 . . 3 (𝐴 ≠ ∅ → (∀𝑥𝐴 ⊥ → 𝜓))
84, 7biimtrid 242 . 2 (𝐴 ≠ ∅ → (∀𝑥𝐴 (𝜑 ∧ ¬ 𝜑) → 𝜓))
91, 8biimtrrid 243 1 (𝐴 ≠ ∅ → ((∀𝑥𝐴 𝜑 ∧ ∀𝑥𝐴 ¬ 𝜑) → 𝜓))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 395  wfal 1554  wne 2931  wral 3050  c0 4284
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-9 2124  ax-ext 2707
This theorem depends on definitions:  df-bi 207  df-an 396  df-tru 1545  df-fal 1555  df-ex 1782  df-sb 2069  df-clab 2714  df-cleq 2727  df-ne 2932  df-ral 3051  df-dif 3903  df-nul 4285
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator