![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > seinxp | Structured version Visualization version GIF version |
Description: Intersection of set-like relation with Cartesian product of its field. (Contributed by Mario Carneiro, 22-Jun-2015.) |
Ref | Expression |
---|---|
seinxp | ⊢ (𝑅 Se 𝐴 ↔ (𝑅 ∩ (𝐴 × 𝐴)) Se 𝐴) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | brinxp 5594 | . . . . . 6 ⊢ ((𝑦 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴) → (𝑦𝑅𝑥 ↔ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥)) | |
2 | 1 | ancoms 462 | . . . . 5 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) → (𝑦𝑅𝑥 ↔ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥)) |
3 | 2 | rabbidva 3425 | . . . 4 ⊢ (𝑥 ∈ 𝐴 → {𝑦 ∈ 𝐴 ∣ 𝑦𝑅𝑥} = {𝑦 ∈ 𝐴 ∣ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥}) |
4 | 3 | eleq1d 2874 | . . 3 ⊢ (𝑥 ∈ 𝐴 → ({𝑦 ∈ 𝐴 ∣ 𝑦𝑅𝑥} ∈ V ↔ {𝑦 ∈ 𝐴 ∣ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥} ∈ V)) |
5 | 4 | ralbiia 3132 | . 2 ⊢ (∀𝑥 ∈ 𝐴 {𝑦 ∈ 𝐴 ∣ 𝑦𝑅𝑥} ∈ V ↔ ∀𝑥 ∈ 𝐴 {𝑦 ∈ 𝐴 ∣ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥} ∈ V) |
6 | df-se 5479 | . 2 ⊢ (𝑅 Se 𝐴 ↔ ∀𝑥 ∈ 𝐴 {𝑦 ∈ 𝐴 ∣ 𝑦𝑅𝑥} ∈ V) | |
7 | df-se 5479 | . 2 ⊢ ((𝑅 ∩ (𝐴 × 𝐴)) Se 𝐴 ↔ ∀𝑥 ∈ 𝐴 {𝑦 ∈ 𝐴 ∣ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥} ∈ V) | |
8 | 5, 6, 7 | 3bitr4i 306 | 1 ⊢ (𝑅 Se 𝐴 ↔ (𝑅 ∩ (𝐴 × 𝐴)) Se 𝐴) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 209 ∈ wcel 2111 ∀wral 3106 {crab 3110 Vcvv 3441 ∩ cin 3880 class class class wbr 5030 Se wse 5476 × cxp 5517 |
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 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-sep 5167 ax-nul 5174 ax-pr 5295 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ral 3111 df-rex 3112 df-rab 3115 df-v 3443 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-nul 4244 df-if 4426 df-sn 4526 df-pr 4528 df-op 4532 df-br 5031 df-opab 5093 df-se 5479 df-xp 5525 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |