| 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 8809 | . . 3 ⊢ (𝐵 × 𝐵) Er 𝐵 | |
| 2 | riin0 5041 | . . . . 5 ⊢ (𝐴 = ∅ → ((𝐵 × 𝐵) ∩ ∩ 𝑥 ∈ 𝐴 𝑅) = (𝐵 × 𝐵)) | |
| 3 | 2 | adantl 487 | . . . 4 ⊢ ((∀𝑥 ∈ 𝐴 𝑅 Er 𝐵 ∧ 𝐴 = ∅) → ((𝐵 × 𝐵) ∩ ∩ 𝑥 ∈ 𝐴 𝑅) = (𝐵 × 𝐵)) |
| 4 | ereq1 8725 | . . . 4 ⊢ (((𝐵 × 𝐵) ∩ ∩ 𝑥 ∈ 𝐴 𝑅) = (𝐵 × 𝐵) → (((𝐵 × 𝐵) ∩ ∩ 𝑥 ∈ 𝐴 𝑅) Er 𝐵 ↔ (𝐵 × 𝐵) Er 𝐵)) | |
| 5 | 3, 4 | syl 18 | . . 3 ⊢ ((∀𝑥 ∈ 𝐴 𝑅 Er 𝐵 ∧ 𝐴 = ∅) → (((𝐵 × 𝐵) ∩ ∩ 𝑥 ∈ 𝐴 𝑅) Er 𝐵 ↔ (𝐵 × 𝐵) Er 𝐵)) |
| 6 | 1, 5 | mpbiri 261 | . 2 ⊢ ((∀𝑥 ∈ 𝐴 𝑅 Er 𝐵 ∧ 𝐴 = ∅) → ((𝐵 × 𝐵) ∩ ∩ 𝑥 ∈ 𝐴 𝑅) Er 𝐵) |
| 7 | iiner 8810 | . . . 4 ⊢ ((𝐴 ≠ ∅ ∧ ∀𝑥 ∈ 𝐴 𝑅 Er 𝐵) → ∩ 𝑥 ∈ 𝐴 𝑅 Er 𝐵) | |
| 8 | 7 | ancoms 464 | . . 3 ⊢ ((∀𝑥 ∈ 𝐴 𝑅 Er 𝐵 ∧ 𝐴 ≠ ∅) → ∩ 𝑥 ∈ 𝐴 𝑅 Er 𝐵) |
| 9 | erssxp 8741 | . . . . . 6 ⊢ (𝑅 Er 𝐵 → 𝑅 ⊆ (𝐵 × 𝐵)) | |
| 10 | 9 | ralimi 3099 | . . . . 5 ⊢ (∀𝑥 ∈ 𝐴 𝑅 Er 𝐵 → ∀𝑥 ∈ 𝐴 𝑅 ⊆ (𝐵 × 𝐵)) |
| 11 | riinn0 5042 | . . . . 5 ⊢ ((∀𝑥 ∈ 𝐴 𝑅 ⊆ (𝐵 × 𝐵) ∧ 𝐴 ≠ ∅) → ((𝐵 × 𝐵) ∩ ∩ 𝑥 ∈ 𝐴 𝑅) = ∩ 𝑥 ∈ 𝐴 𝑅) | |
| 12 | 10, 11 | sylan 592 | . . . 4 ⊢ ((∀𝑥 ∈ 𝐴 𝑅 Er 𝐵 ∧ 𝐴 ≠ ∅) → ((𝐵 × 𝐵) ∩ ∩ 𝑥 ∈ 𝐴 𝑅) = ∩ 𝑥 ∈ 𝐴 𝑅) |
| 13 | ereq1 8725 | . . . 4 ⊢ (((𝐵 × 𝐵) ∩ ∩ 𝑥 ∈ 𝐴 𝑅) = ∩ 𝑥 ∈ 𝐴 𝑅 → (((𝐵 × 𝐵) ∩ ∩ 𝑥 ∈ 𝐴 𝑅) Er 𝐵 ↔ ∩ 𝑥 ∈ 𝐴 𝑅 Er 𝐵)) | |
| 14 | 12, 13 | syl 18 | . . 3 ⊢ ((∀𝑥 ∈ 𝐴 𝑅 Er 𝐵 ∧ 𝐴 ≠ ∅) → (((𝐵 × 𝐵) ∩ ∩ 𝑥 ∈ 𝐴 𝑅) Er 𝐵 ↔ ∩ 𝑥 ∈ 𝐴 𝑅 Er 𝐵)) |
| 15 | 8, 14 | mpbird 260 | . 2 ⊢ ((∀𝑥 ∈ 𝐴 𝑅 Er 𝐵 ∧ 𝐴 ≠ ∅) → ((𝐵 × 𝐵) ∩ ∩ 𝑥 ∈ 𝐴 𝑅) Er 𝐵) |
| 16 | 6, 15 | pm2.61dane 3042 | 1 ⊢ (∀𝑥 ∈ 𝐴 𝑅 Er 𝐵 → ((𝐵 × 𝐵) ∩ ∩ 𝑥 ∈ 𝐴 𝑅) Er 𝐵) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1569 ≠ wne 2955 ∀wral 3076 ⊆ wss 3895 ∩ cin 4089 ∅c0 4278 ∩ ciin 4951 × cxp 5648 Er wer 8714 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-ext 2732 ax-sep 5248 ax-pr 5390 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-sb 2099 df-clab 2739 df-cleq 2752 df-clel 2835 df-ne 2956 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-ss 3896 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-sn 4584 df-pr 4586 df-op 4590 df-iin 4953 df-br 5103 df-opab 5167 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-er 8717 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |