Theorem relintabex 44335

Description: If the intersection of a class is a relation, then the class is nonempty. (Contributed by RP, 12-Aug-2020.)

Assertion

Ref	Expression
relintabex	⊢ (Rel ∩ {𝑥 ∣ 𝜑} → ∃𝑥𝜑)

Proof of Theorem relintabex

Step	Hyp	Ref	Expression
1		intnex 5314	. . . 4 ⊢ (¬ ∩ {𝑥 ∣ 𝜑} ∈ V ↔ ∩ {𝑥 ∣ 𝜑} = V)
2		nrelv 5785	. . . . 5 ⊢ ¬ Rel V
3		releq 5762	. . . . 5 ⊢ (∩ {𝑥 ∣ 𝜑} = V → (Rel ∩ {𝑥 ∣ 𝜑} ↔ Rel V))
4	2, 3	mtbiri 330	. . . 4 ⊢ (∩ {𝑥 ∣ 𝜑} = V → ¬ Rel ∩ {𝑥 ∣ 𝜑})
5	1, 4	sylbi 220	. . 3 ⊢ (¬ ∩ {𝑥 ∣ 𝜑} ∈ V → ¬ Rel ∩ {𝑥 ∣ 𝜑})
6	5	con4i 115	. 2 ⊢ (Rel ∩ {𝑥 ∣ 𝜑} → ∩ {𝑥 ∣ 𝜑} ∈ V)
7		intexab 5315	. 2 ⊢ (∃𝑥𝜑 ↔ ∩ {𝑥 ∣ 𝜑} ∈ V)
8	6, 7	sylibr 237	1 ⊢ (Rel ∩ {𝑥 ∣ 𝜑} → ∃𝑥𝜑)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   = wceq 1569  ∃wex 1808   ∈ wcel 2142  {cab 2740  Vcvv 3454  ∩ cint 4911  Rel wrel 5665

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-sep 5256  ax-nul 5268  ax-pr 5403

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-nf 1813  df-sb 2096  df-clab 2741  df-cleq 2754  df-clel 2837  df-ne 2958  df-ral 3079  df-rex 3089  df-rab 3416  df-v 3456  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4487  df-sn 4589  df-pr 4591  df-op 4595  df-int 4912  df-opab 5173  df-xp 5666  df-rel 5667

This theorem is used by:  relintab  44337