![]() |
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 5215 | . . . . . 6 ⊢ ((𝑦 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴) → (𝑦𝑅𝑥 ↔ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥)) | |
2 | 1 | ancoms 468 | . . . . 5 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) → (𝑦𝑅𝑥 ↔ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥)) |
3 | 2 | rabbidva 3219 | . . . 4 ⊢ (𝑥 ∈ 𝐴 → {𝑦 ∈ 𝐴 ∣ 𝑦𝑅𝑥} = {𝑦 ∈ 𝐴 ∣ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥}) |
4 | 3 | eleq1d 2715 | . . 3 ⊢ (𝑥 ∈ 𝐴 → ({𝑦 ∈ 𝐴 ∣ 𝑦𝑅𝑥} ∈ V ↔ {𝑦 ∈ 𝐴 ∣ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥} ∈ V)) |
5 | 4 | ralbiia 3008 | . 2 ⊢ (∀𝑥 ∈ 𝐴 {𝑦 ∈ 𝐴 ∣ 𝑦𝑅𝑥} ∈ V ↔ ∀𝑥 ∈ 𝐴 {𝑦 ∈ 𝐴 ∣ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥} ∈ V) |
6 | df-se 5103 | . 2 ⊢ (𝑅 Se 𝐴 ↔ ∀𝑥 ∈ 𝐴 {𝑦 ∈ 𝐴 ∣ 𝑦𝑅𝑥} ∈ V) | |
7 | df-se 5103 | . 2 ⊢ ((𝑅 ∩ (𝐴 × 𝐴)) Se 𝐴 ↔ ∀𝑥 ∈ 𝐴 {𝑦 ∈ 𝐴 ∣ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥} ∈ V) | |
8 | 5, 6, 7 | 3bitr4i 292 | 1 ⊢ (𝑅 Se 𝐴 ↔ (𝑅 ∩ (𝐴 × 𝐴)) Se 𝐴) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 196 ∈ wcel 2030 ∀wral 2941 {crab 2945 Vcvv 3231 ∩ cin 3606 class class class wbr 4685 Se wse 5100 × cxp 5141 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1762 ax-4 1777 ax-5 1879 ax-6 1945 ax-7 1981 ax-9 2039 ax-10 2059 ax-11 2074 ax-12 2087 ax-13 2282 ax-ext 2631 ax-sep 4814 ax-nul 4822 ax-pr 4936 |
This theorem depends on definitions: df-bi 197 df-or 384 df-an 385 df-3an 1056 df-tru 1526 df-ex 1745 df-nf 1750 df-sb 1938 df-clab 2638 df-cleq 2644 df-clel 2647 df-nfc 2782 df-ral 2946 df-rex 2947 df-rab 2950 df-v 3233 df-dif 3610 df-un 3612 df-in 3614 df-ss 3621 df-nul 3949 df-if 4120 df-sn 4211 df-pr 4213 df-op 4217 df-br 4686 df-opab 4746 df-se 5103 df-xp 5149 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |