Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > riiner | Structured version Visualization version GIF version |
Description: The relative intersection of a family of equivalence relations is an equivalence relation. (Contributed by Mario Carneiro, 27-Sep-2015.) |
Ref | Expression |
---|---|
riiner | ⊢ (∀𝑥 ∈ 𝐴 𝑅 Er 𝐵 → ((𝐵 × 𝐵) ∩ ∩ 𝑥 ∈ 𝐴 𝑅) Er 𝐵) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | xpider 8368 | . . 3 ⊢ (𝐵 × 𝐵) Er 𝐵 | |
2 | riin0 5004 | . . . . 5 ⊢ (𝐴 = ∅ → ((𝐵 × 𝐵) ∩ ∩ 𝑥 ∈ 𝐴 𝑅) = (𝐵 × 𝐵)) | |
3 | 2 | adantl 484 | . . . 4 ⊢ ((∀𝑥 ∈ 𝐴 𝑅 Er 𝐵 ∧ 𝐴 = ∅) → ((𝐵 × 𝐵) ∩ ∩ 𝑥 ∈ 𝐴 𝑅) = (𝐵 × 𝐵)) |
4 | ereq1 8296 | . . . 4 ⊢ (((𝐵 × 𝐵) ∩ ∩ 𝑥 ∈ 𝐴 𝑅) = (𝐵 × 𝐵) → (((𝐵 × 𝐵) ∩ ∩ 𝑥 ∈ 𝐴 𝑅) Er 𝐵 ↔ (𝐵 × 𝐵) Er 𝐵)) | |
5 | 3, 4 | syl 17 | . . 3 ⊢ ((∀𝑥 ∈ 𝐴 𝑅 Er 𝐵 ∧ 𝐴 = ∅) → (((𝐵 × 𝐵) ∩ ∩ 𝑥 ∈ 𝐴 𝑅) Er 𝐵 ↔ (𝐵 × 𝐵) Er 𝐵)) |
6 | 1, 5 | mpbiri 260 | . 2 ⊢ ((∀𝑥 ∈ 𝐴 𝑅 Er 𝐵 ∧ 𝐴 = ∅) → ((𝐵 × 𝐵) ∩ ∩ 𝑥 ∈ 𝐴 𝑅) Er 𝐵) |
7 | iiner 8369 | . . . 4 ⊢ ((𝐴 ≠ ∅ ∧ ∀𝑥 ∈ 𝐴 𝑅 Er 𝐵) → ∩ 𝑥 ∈ 𝐴 𝑅 Er 𝐵) | |
8 | 7 | ancoms 461 | . . 3 ⊢ ((∀𝑥 ∈ 𝐴 𝑅 Er 𝐵 ∧ 𝐴 ≠ ∅) → ∩ 𝑥 ∈ 𝐴 𝑅 Er 𝐵) |
9 | erssxp 8312 | . . . . . 6 ⊢ (𝑅 Er 𝐵 → 𝑅 ⊆ (𝐵 × 𝐵)) | |
10 | 9 | ralimi 3160 | . . . . 5 ⊢ (∀𝑥 ∈ 𝐴 𝑅 Er 𝐵 → ∀𝑥 ∈ 𝐴 𝑅 ⊆ (𝐵 × 𝐵)) |
11 | riinn0 5005 | . . . . 5 ⊢ ((∀𝑥 ∈ 𝐴 𝑅 ⊆ (𝐵 × 𝐵) ∧ 𝐴 ≠ ∅) → ((𝐵 × 𝐵) ∩ ∩ 𝑥 ∈ 𝐴 𝑅) = ∩ 𝑥 ∈ 𝐴 𝑅) | |
12 | 10, 11 | sylan 582 | . . . 4 ⊢ ((∀𝑥 ∈ 𝐴 𝑅 Er 𝐵 ∧ 𝐴 ≠ ∅) → ((𝐵 × 𝐵) ∩ ∩ 𝑥 ∈ 𝐴 𝑅) = ∩ 𝑥 ∈ 𝐴 𝑅) |
13 | ereq1 8296 | . . . 4 ⊢ (((𝐵 × 𝐵) ∩ ∩ 𝑥 ∈ 𝐴 𝑅) = ∩ 𝑥 ∈ 𝐴 𝑅 → (((𝐵 × 𝐵) ∩ ∩ 𝑥 ∈ 𝐴 𝑅) Er 𝐵 ↔ ∩ 𝑥 ∈ 𝐴 𝑅 Er 𝐵)) | |
14 | 12, 13 | syl 17 | . . 3 ⊢ ((∀𝑥 ∈ 𝐴 𝑅 Er 𝐵 ∧ 𝐴 ≠ ∅) → (((𝐵 × 𝐵) ∩ ∩ 𝑥 ∈ 𝐴 𝑅) Er 𝐵 ↔ ∩ 𝑥 ∈ 𝐴 𝑅 Er 𝐵)) |
15 | 8, 14 | mpbird 259 | . 2 ⊢ ((∀𝑥 ∈ 𝐴 𝑅 Er 𝐵 ∧ 𝐴 ≠ ∅) → ((𝐵 × 𝐵) ∩ ∩ 𝑥 ∈ 𝐴 𝑅) Er 𝐵) |
16 | 6, 15 | pm2.61dane 3104 | 1 ⊢ (∀𝑥 ∈ 𝐴 𝑅 Er 𝐵 → ((𝐵 × 𝐵) ∩ ∩ 𝑥 ∈ 𝐴 𝑅) Er 𝐵) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 = wceq 1537 ≠ wne 3016 ∀wral 3138 ∩ cin 3935 ⊆ wss 3936 ∅c0 4291 ∩ ciin 4920 × cxp 5553 Er wer 8286 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-sep 5203 ax-nul 5210 ax-pr 5330 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-ral 3143 df-rex 3144 df-rab 3147 df-v 3496 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-nul 4292 df-if 4468 df-sn 4568 df-pr 4570 df-op 4574 df-iin 4922 df-br 5067 df-opab 5129 df-xp 5561 df-rel 5562 df-cnv 5563 df-co 5564 df-dm 5565 df-rn 5566 df-er 8289 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |