Theorem rzal 3592

Description: Vacuous quantification is always true. (Contributed by NM, 11-Mar-1997.) (Proof shortened by Andrew Salmon, 26-Jun-2011.)

Assertion

Ref	Expression
rzal	⊢ (𝐴 = ∅ → ∀𝑥 ∈ 𝐴 𝜑)

Distinct variable group:   𝑥,𝐴

Allowed substitution hint:   𝜑(𝑥)

Proof of Theorem rzal

Step	Hyp	Ref	Expression
1		ne0i 3501	. . . 4 ⊢ (𝑥 ∈ 𝐴 → 𝐴 ≠ ∅)
2	1	necon2bi 2457	. . 3 ⊢ (𝐴 = ∅ → ¬ 𝑥 ∈ 𝐴)
3	2	pm2.21d 624	. 2 ⊢ (𝐴 = ∅ → (𝑥 ∈ 𝐴 → 𝜑))
4	3	ralrimiv 2604	1 ⊢ (𝐴 = ∅ → ∀𝑥 ∈ 𝐴 𝜑)

Syntax hints:   → wi 4   = wceq 1397   ∈ wcel 2202  ∀wral 2510  ∅c0 3494

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 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-ext 2213

This theorem depends on definitions:  df-bi 117  df-tru 1400  df-nf 1509  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-ral 2515  df-v 2804  df-dif 3202  df-nul 3495

This theorem is referenced by:  ralf0  3597  fiubm  11093  mgm0  13454  sgrp0  13495