Theorem relintabex 44689

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 5305	. . . 4 ⊢ (¬ ∩ {𝑥 ∣ 𝜑} ∈ V ↔ ∩ {𝑥 ∣ 𝜑} = V)
2		nrelv 5777	. . . . 5 ⊢ ¬ Rel V
3		releq 5753	. . . . 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 5306	. 2 ⊢ (∃𝑥𝜑 ↔ ∩ {𝑥 ∣ 𝜑} ∈ V)
8	6, 7	sylibr 237	1 ⊢ (Rel ∩ {𝑥 ∣ 𝜑} → ∃𝑥𝜑)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   = wceq 1569  ∃wex 1811   ∈ wcel 2144  {cab 2738  Vcvv 3450  ∩ cint 4906  Rel wrel 5655

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5390

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3897  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-int 4907  df-opab 5167  df-xp 5656  df-rel 5657

This theorem is used by:  relintab  44691