Theorem elcnvintab 43615

Description: Two ways of saying a set is an element of the converse of the intersection of a class. (Contributed by RP, 19-Aug-2020.)

Assertion

Ref	Expression
elcnvintab	⊢ (𝐴 ∈ ◡∩ {𝑥 ∣ 𝜑} ↔ (𝐴 ∈ (V × V) ∧ ∀𝑥(𝜑 → 𝐴 ∈ ◡𝑥)))

Distinct variable group:   𝑥,𝐴

Allowed substitution hint:   𝜑(𝑥)

Proof of Theorem elcnvintab

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2737	. . 3 ⊢ (𝑦 ∈ (V × V) ↦ ⟨(2nd ‘𝑦), (1st ‘𝑦)⟩) = (𝑦 ∈ (V × V) ↦ ⟨(2nd ‘𝑦), (1st ‘𝑦)⟩)
2	1	elcnvlem 43614	. 2 ⊢ (𝐴 ∈ ◡∩ {𝑥 ∣ 𝜑} ↔ (𝐴 ∈ (V × V) ∧ ((𝑦 ∈ (V × V) ↦ ⟨(2nd ‘𝑦), (1st ‘𝑦)⟩)‘𝐴) ∈ ∩ {𝑥 ∣ 𝜑}))
3	1	elcnvlem 43614	. 2 ⊢ (𝐴 ∈ ◡𝑥 ↔ (𝐴 ∈ (V × V) ∧ ((𝑦 ∈ (V × V) ↦ ⟨(2nd ‘𝑦), (1st ‘𝑦)⟩)‘𝐴) ∈ 𝑥))
4	2, 3	elmapintab 43609	1 ⊢ (𝐴 ∈ ◡∩ {𝑥 ∣ 𝜑} ↔ (𝐴 ∈ (V × V) ∧ ∀𝑥(𝜑 → 𝐴 ∈ ◡𝑥)))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395  ∀wal 1538   ∈ wcel 2108  {cab 2714  Vcvv 3480  ⟨cop 4632  ∩ cint 4946   ↦ cmpt 5225   × cxp 5683  ^◡ccnv 5684  ‘cfv 6561  1^st c1st 8012  2^nd c2nd 8013

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-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2708  ax-sep 5296  ax-nul 5306  ax-pr 5432  ax-un 7755

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2540  df-eu 2569  df-clab 2715  df-cleq 2729  df-clel 2816  df-nfc 2892  df-ne 2941  df-ral 3062  df-rex 3071  df-rab 3437  df-v 3482  df-dif 3954  df-un 3956  df-in 3958  df-ss 3968  df-nul 4334  df-if 4526  df-sn 4627  df-pr 4629  df-op 4633  df-uni 4908  df-int 4947  df-br 5144  df-opab 5206  df-mpt 5226  df-id 5578  df-xp 5691  df-rel 5692  df-cnv 5693  df-co 5694  df-dm 5695  df-rn 5696  df-iota 6514  df-fun 6563  df-fv 6569  df-1st 8014  df-2nd 8015

This theorem is referenced by:  cnvintabd  43616