| Mathbox for Richard Penner |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > cnvintabd | Structured version Visualization version GIF version | ||
| Description: Value of the converse of the intersection of a nonempty class. (Contributed by RP, 20-Aug-2020.) |
| Ref | Expression |
|---|---|
| cnvintabd.x | ⊢ (𝜑 → ∃𝑥𝜓) |
| Ref | Expression |
|---|---|
| cnvintabd | ⊢ (𝜑 → ◡∩ {𝑥 ∣ 𝜓} = ∩ {𝑤 ∈ 𝒫 (V × V) ∣ ∃𝑥(𝑤 = ◡𝑥 ∧ 𝜓)}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cnvintabd.x | . . . . . 6 ⊢ (𝜑 → ∃𝑥𝜓) | |
| 2 | pm5.5 364 | . . . . . 6 ⊢ (∃𝑥𝜓 → ((∃𝑥𝜓 → 𝑦 ∈ (V × V)) ↔ 𝑦 ∈ (V × V))) | |
| 3 | 1, 2 | syl 18 | . . . . 5 ⊢ (𝜑 → ((∃𝑥𝜓 → 𝑦 ∈ (V × V)) ↔ 𝑦 ∈ (V × V))) |
| 4 | 3 | bicomd 226 | . . . 4 ⊢ (𝜑 → (𝑦 ∈ (V × V) ↔ (∃𝑥𝜓 → 𝑦 ∈ (V × V)))) |
| 5 | 4 | anbi1d 643 | . . 3 ⊢ (𝜑 → ((𝑦 ∈ (V × V) ∧ ∀𝑥(𝜓 → 𝑦 ∈ ◡𝑥)) ↔ ((∃𝑥𝜓 → 𝑦 ∈ (V × V)) ∧ ∀𝑥(𝜓 → 𝑦 ∈ ◡𝑥)))) |
| 6 | elcnvintab 44429 | . . 3 ⊢ (𝑦 ∈ ◡∩ {𝑥 ∣ 𝜓} ↔ (𝑦 ∈ (V × V) ∧ ∀𝑥(𝜓 → 𝑦 ∈ ◡𝑥))) | |
| 7 | vex 3457 | . . . . . 6 ⊢ 𝑥 ∈ V | |
| 8 | 7 | cnvex 7925 | . . . . 5 ⊢ ◡𝑥 ∈ V |
| 9 | relcnv 6104 | . . . . . 6 ⊢ Rel ◡𝑥 | |
| 10 | df-rel 5666 | . . . . . 6 ⊢ (Rel ◡𝑥 ↔ ◡𝑥 ⊆ (V × V)) | |
| 11 | 9, 10 | mpbi 233 | . . . . 5 ⊢ ◡𝑥 ⊆ (V × V) |
| 12 | 8, 11 | elmapintrab 44403 | . . . 4 ⊢ (𝑦 ∈ V → (𝑦 ∈ ∩ {𝑤 ∈ 𝒫 (V × V) ∣ ∃𝑥(𝑤 = ◡𝑥 ∧ 𝜓)} ↔ ((∃𝑥𝜓 → 𝑦 ∈ (V × V)) ∧ ∀𝑥(𝜓 → 𝑦 ∈ ◡𝑥)))) |
| 13 | 12 | elv 3458 | . . 3 ⊢ (𝑦 ∈ ∩ {𝑤 ∈ 𝒫 (V × V) ∣ ∃𝑥(𝑤 = ◡𝑥 ∧ 𝜓)} ↔ ((∃𝑥𝜓 → 𝑦 ∈ (V × V)) ∧ ∀𝑥(𝜓 → 𝑦 ∈ ◡𝑥))) |
| 14 | 5, 6, 13 | 3bitr4g 317 | . 2 ⊢ (𝜑 → (𝑦 ∈ ◡∩ {𝑥 ∣ 𝜓} ↔ 𝑦 ∈ ∩ {𝑤 ∈ 𝒫 (V × V) ∣ ∃𝑥(𝑤 = ◡𝑥 ∧ 𝜓)})) |
| 15 | 14 | eqrdv 2760 | 1 ⊢ (𝜑 → ◡∩ {𝑥 ∣ 𝜓} = ∩ {𝑤 ∈ 𝒫 (V × V) ∣ ∃𝑥(𝑤 = ◡𝑥 ∧ 𝜓)}) |
| Colors of variables: wff setvar class |
| 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 ⊆ 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-nul 5267 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-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 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-mpt 5191 df-id 5554 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-iota 6493 df-fun 6539 df-fv 6545 df-1st 7989 df-2nd 7990 |
| This theorem is used by: clcnvlem 44450 |
| Copyright terms: Public domain | W3C validator |