Theorem cnvcnvintabd 44427

Description: Value of the relationship content of the intersection of a class. (Contributed by RP, 20-Aug-2020.)

Hypothesis

Ref	Expression
cnvcnvintabd.x	⊢ (𝜑 → ∃𝑥𝜓)

Assertion

Ref	Expression
cnvcnvintabd	⊢ (𝜑 → ◡◡∩ {𝑥 ∣ 𝜓} = ∩ {𝑤 ∈ 𝒫 (V × V) ∣ ∃𝑥(𝑤 = ◡◡𝑥 ∧ 𝜓)})

Distinct variable groups:   𝜓,𝑤   𝑥,𝑤

Allowed substitution hints:   𝜑(𝑥, 𝑤)   𝜓(𝑥)

Proof of Theorem cnvcnvintabd

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		cnvcnv 6189	. . . . . . . . . 10 ⊢ ◡◡𝑥 = (𝑥 ∩ (V × V))
2	1	eleq2i 2854	. . . . . . . . 9 ⊢ (𝑦 ∈ ◡◡𝑥 ↔ 𝑦 ∈ (𝑥 ∩ (V × V)))
3		elin 3918	. . . . . . . . . 10 ⊢ (𝑦 ∈ (𝑥 ∩ (V × V)) ↔ (𝑦 ∈ 𝑥 ∧ 𝑦 ∈ (V × V)))
4	3	rbaib 548	. . . . . . . . 9 ⊢ (𝑦 ∈ (V × V) → (𝑦 ∈ (𝑥 ∩ (V × V)) ↔ 𝑦 ∈ 𝑥))
5	2, 4	bitrid 286	. . . . . . . 8 ⊢ (𝑦 ∈ (V × V) → (𝑦 ∈ ◡◡𝑥 ↔ 𝑦 ∈ 𝑥))
6	5	bicomd 226	. . . . . . 7 ⊢ (𝑦 ∈ (V × V) → (𝑦 ∈ 𝑥 ↔ 𝑦 ∈ ◡◡𝑥))
7	6	imbi2d 343	. . . . . 6 ⊢ (𝑦 ∈ (V × V) → ((𝜓 → 𝑦 ∈ 𝑥) ↔ (𝜓 → 𝑦 ∈ ◡◡𝑥)))
8	7	albidv 1953	. . . . 5 ⊢ (𝑦 ∈ (V × V) → (∀𝑥(𝜓 → 𝑦 ∈ 𝑥) ↔ ∀𝑥(𝜓 → 𝑦 ∈ ◡◡𝑥)))
9	8	pm5.32i 585	. . . 4 ⊢ ((𝑦 ∈ (V × V) ∧ ∀𝑥(𝜓 → 𝑦 ∈ 𝑥)) ↔ (𝑦 ∈ (V × V) ∧ ∀𝑥(𝜓 → 𝑦 ∈ ◡◡𝑥)))
10		cnvcnvintabd.x	. . . . . . 7 ⊢ (𝜑 → ∃𝑥𝜓)
11		pm5.5 364	. . . . . . 7 ⊢ (∃𝑥𝜓 → ((∃𝑥𝜓 → 𝑦 ∈ (V × V)) ↔ 𝑦 ∈ (V × V)))
12	10, 11	syl 18	. . . . . 6 ⊢ (𝜑 → ((∃𝑥𝜓 → 𝑦 ∈ (V × V)) ↔ 𝑦 ∈ (V × V)))
13	12	bicomd 226	. . . . 5 ⊢ (𝜑 → (𝑦 ∈ (V × V) ↔ (∃𝑥𝜓 → 𝑦 ∈ (V × V))))
14	13	anbi1d 643	. . . 4 ⊢ (𝜑 → ((𝑦 ∈ (V × V) ∧ ∀𝑥(𝜓 → 𝑦 ∈ ◡◡𝑥)) ↔ ((∃𝑥𝜓 → 𝑦 ∈ (V × V)) ∧ ∀𝑥(𝜓 → 𝑦 ∈ ◡◡𝑥))))
15	9, 14	bitrid 286	. . 3 ⊢ (𝜑 → ((𝑦 ∈ (V × V) ∧ ∀𝑥(𝜓 → 𝑦 ∈ 𝑥)) ↔ ((∃𝑥𝜓 → 𝑦 ∈ (V × V)) ∧ ∀𝑥(𝜓 → 𝑦 ∈ ◡◡𝑥))))
16		elcnvcnvintab 44409	. . 3 ⊢ (𝑦 ∈ ◡◡∩ {𝑥 ∣ 𝜓} ↔ (𝑦 ∈ (V × V) ∧ ∀𝑥(𝜓 → 𝑦 ∈ 𝑥)))
17		vex 3457	. . . . . 6 ⊢ 𝑥 ∈ V
18		cnvexg 7924	. . . . . 6 ⊢ (𝑥 ∈ V → ◡𝑥 ∈ V)
19		cnvexg 7924	. . . . . 6 ⊢ (◡𝑥 ∈ V → ◡◡𝑥 ∈ V)
20	17, 18, 19	mp2b 10	. . . . 5 ⊢ ◡◡𝑥 ∈ V
21		relcnv 6104	. . . . . 6 ⊢ Rel ◡◡𝑥
22		df-rel 5666	. . . . . 6 ⊢ (Rel ◡◡𝑥 ↔ ◡◡𝑥 ⊆ (V × V))
23	21, 22	mpbi 233	. . . . 5 ⊢ ◡◡𝑥 ⊆ (V × V)
24	20, 23	elmapintrab 44403	. . . 4 ⊢ (𝑦 ∈ V → (𝑦 ∈ ∩ {𝑤 ∈ 𝒫 (V × V) ∣ ∃𝑥(𝑤 = ◡◡𝑥 ∧ 𝜓)} ↔ ((∃𝑥𝜓 → 𝑦 ∈ (V × V)) ∧ ∀𝑥(𝜓 → 𝑦 ∈ ◡◡𝑥))))
25	24	elv 3458	. . 3 ⊢ (𝑦 ∈ ∩ {𝑤 ∈ 𝒫 (V × V) ∣ ∃𝑥(𝑤 = ◡◡𝑥 ∧ 𝜓)} ↔ ((∃𝑥𝜓 → 𝑦 ∈ (V × V)) ∧ ∀𝑥(𝜓 → 𝑦 ∈ ◡◡𝑥)))
26	15, 16, 25	3bitr4g 317	. 2 ⊢ (𝜑 → (𝑦 ∈ ◡◡∩ {𝑥 ∣ 𝜓} ↔ 𝑦 ∈ ∩ {𝑤 ∈ 𝒫 (V × V) ∣ ∃𝑥(𝑤 = ◡◡𝑥 ∧ 𝜓)}))
27	26	eqrdv 2760	1 ⊢ (𝜑 → ◡◡∩ {𝑥 ∣ 𝜓} = ∩ {𝑤 ∈ 𝒫 (V × V) ∣ ∃𝑥(𝑤 = ◡◡𝑥 ∧ 𝜓)})

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401  ∀wal 1568   = wceq 1570  ∃wex 1812   ∈ wcel 2145  {cab 2740  {crab 3414  Vcvv 3453   ∩ cin 3901   ⊆ wss 3902  𝒫 cpw 4560  ∩ cint 4910   × cxp 5657  ^◡ccnv 5658  Rel wrel 5664

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-sep 5255  ax-pow 5334  ax-pr 5402  ax-un 7739

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-clab 2741  df-cleq 2754  df-clel 2837  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-int 4911  df-br 5108  df-opab 5172  df-xp 5665  df-rel 5666  df-cnv 5667  df-dm 5669  df-rn 5670

This theorem is used by: (None)