Users' Mathboxes Mathbox for Richard Penner < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  cnvintabd Structured version   Visualization version   GIF version

Theorem cnvintabd 44924
Description: Value of the converse of the intersection of a nonempty class. (Contributed by RP, 20-Aug-2020.)
Hypothesis
Ref Expression
cnvintabd.x (𝜑 → ∃𝑥𝜓)
Assertion
Ref Expression
cnvintabd (𝜑 → ◡∩ {𝑥 ∣ 𝜓} = ∩ {𝑤 ∈ 𝒫 (V × V) ∣ ∃𝑥(𝑤 = ◡𝑥 ∧ 𝜓)})
Distinct variable groups:   𝜓,𝑤   𝑥,𝑤
Allowed substitution hints:   𝜑(𝑥, 𝑤)   𝜓(𝑥)

Proof of Theorem cnvintabd
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 cnvintabd.x . . . . . 6 (𝜑 → ∃𝑥𝜓)
2 pm5.5 364 . . . . . 6 (∃𝑥𝜓 → ((∃𝑥𝜓 → 𝑦 ∈ (V × V)) ↔ 𝑦 ∈ (V × V)))
31, 2syl 18 . . . . 5 (𝜑 → ((∃𝑥𝜓 → 𝑦 ∈ (V × V)) ↔ 𝑦 ∈ (V × V)))
43bicomd 226 . . . 4 (𝜑 → (𝑦 ∈ (V × V) ↔ (∃𝑥𝜓 → 𝑦 ∈ (V × V))))
54anbi1d 643 . . 3 (𝜑 → ((𝑦 ∈ (V × V) ∧ ∀𝑥(𝜓 → 𝑦 ∈ ◡𝑥)) ↔ ((∃𝑥𝜓 → 𝑦 ∈ (V × V)) ∧ ∀𝑥(𝜓 → 𝑦 ∈ ◡𝑥))))
6 elcnvintab 44923 . . 3 (𝑦 ∈ ◡∩ {𝑥 ∣ 𝜓} ↔ (𝑦 ∈ (V × V) ∧ ∀𝑥(𝜓 → 𝑦 ∈ ◡𝑥)))
7 vex 3457 . . . . . 6 𝑥 ∈ V
87cnvex 7970 . . . . 5 ◡𝑥 ∈ V
9 relcnv 6117 . . . . . 6 Rel ◡𝑥
10 df-rel 5664 . . . . . 6 (Rel ◡𝑥 ↔ ◡𝑥 ⊆ (V × V))
119, 10mpbi 233 . . . . 5 ◡𝑥 ⊆ (V × V)
128, 11elmapintrab 44898 . . . 4 (𝑦 ∈ V → (𝑦 ∈ ∩ {𝑤 ∈ 𝒫 (V × V) ∣ ∃𝑥(𝑤 = ◡𝑥 ∧ 𝜓)} ↔ ((∃𝑥𝜓 → 𝑦 ∈ (V × V)) ∧ ∀𝑥(𝜓 → 𝑦 ∈ ◡𝑥))))
1312elv 3458 . . 3 (𝑦 ∈ ∩ {𝑤 ∈ 𝒫 (V × V) ∣ ∃𝑥(𝑤 = ◡𝑥 ∧ 𝜓)} ↔ ((∃𝑥𝜓 → 𝑦 ∈ (V × V)) ∧ ∀𝑥(𝜓 → 𝑦 ∈ ◡𝑥)))
145, 6, 133bitr4g 317 . 2 (𝜑 → (𝑦 ∈ ◡∩ {𝑥 ∣ 𝜓} ↔ 𝑦 ∈ ∩ {𝑤 ∈ 𝒫 (V × V) ∣ ∃𝑥(𝑤 = ◡𝑥 ∧ 𝜓)}))
1514eqrdv 2764 1 (𝜑 → ◡∩ {𝑥 ∣ 𝜓} = ∩ {𝑤 ∈ 𝒫 (V × V) ∣ ∃𝑥(𝑤 = ◡𝑥 ∧ 𝜓)})
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401  ∀wal 1570   = wceq 1572  ∃wex 1814   ∈ wcel 2150  {cab 2744  {crab 3415  Vcvv 3453   ⊆ wss 3899  𝒫 cpw 4559  ∩ cint 4911   × cxp 5655  ◡ccnv 5656  Rel wrel 5662
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-10 2183  ax-11 2200  ax-12 2219  ax-ext 2738  ax-sep 5254  ax-nul 5265  ax-pow 5333  ax-pr 5397  ax-un 7782
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1106  df-tru 1575  df-fal 1585  df-ex 1815  df-nf 1819  df-sb 2104  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2842  df-nfc 2916  df-ne 2963  df-ral 3084  df-rex 3094  df-rab 3416  df-v 3455  df-ss 3900  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-op 4840  df-uni 4872  df-int 4912  df-br 5108  df-opab 5173  df-mpt 5192  df-id 5552  df-xp 5663  df-rel 5664  df-cnv 5665  df-co 5666  df-dm 5667  df-rn 5668  df-iota 6519  df-fun 6567  df-fv 6573  df-1st 8034  df-2nd 8035
This theorem is used by:  clcnvlem  44944
  Copyright terms: Public domain W3C validator