Theorem elcnvintab 44032

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 44031	. 2 ⊢ (𝐴 ∈ ◡∩ {𝑥 ∣ 𝜑} ↔ (𝐴 ∈ (V × V) ∧ ((𝑦 ∈ (V × V) ↦ ⟨(2nd ‘𝑦), (1st ‘𝑦)⟩)‘𝐴) ∈ ∩ {𝑥 ∣ 𝜑}))
3	1	elcnvlem 44031	. 2 ⊢ (𝐴 ∈ ◡𝑥 ↔ (𝐴 ∈ (V × V) ∧ ((𝑦 ∈ (V × V) ↦ ⟨(2nd ‘𝑦), (1st ‘𝑦)⟩)‘𝐴) ∈ 𝑥))
4	2, 3	elmapintab 44026	1 ⊢ (𝐴 ∈ ◡∩ {𝑥 ∣ 𝜑} ↔ (𝐴 ∈ (V × V) ∧ ∀𝑥(𝜑 → 𝐴 ∈ ◡𝑥)))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395  ∀wal 1540   ∈ wcel 2114  {cab 2715  Vcvv 3430  ⟨cop 4574  ∩ cint 4890   ↦ cmpt 5167   × cxp 5620  ^◡ccnv 5621  ‘cfv 6490  1^st c1st 7931  2^nd c2nd 7932

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-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5231  ax-nul 5241  ax-pr 5368  ax-un 7680

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rab 3391  df-v 3432  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-int 4891  df-br 5087  df-opab 5149  df-mpt 5168  df-id 5517  df-xp 5628  df-rel 5629  df-cnv 5630  df-co 5631  df-dm 5632  df-rn 5633  df-iota 6446  df-fun 6492  df-fv 6498  df-1st 7933  df-2nd 7934

This theorem is referenced by:  cnvintabd  44033