![]() |
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 8813 | . . 3 ⊢ (𝐵 × 𝐵) Er 𝐵 | |
2 | riin0 5089 | . . . . 5 ⊢ (𝐴 = ∅ → ((𝐵 × 𝐵) ∩ ∩ 𝑥 ∈ 𝐴 𝑅) = (𝐵 × 𝐵)) | |
3 | 2 | adantl 480 | . . . 4 ⊢ ((∀𝑥 ∈ 𝐴 𝑅 Er 𝐵 ∧ 𝐴 = ∅) → ((𝐵 × 𝐵) ∩ ∩ 𝑥 ∈ 𝐴 𝑅) = (𝐵 × 𝐵)) |
4 | ereq1 8738 | . . . 4 ⊢ (((𝐵 × 𝐵) ∩ ∩ 𝑥 ∈ 𝐴 𝑅) = (𝐵 × 𝐵) → (((𝐵 × 𝐵) ∩ ∩ 𝑥 ∈ 𝐴 𝑅) Er 𝐵 ↔ (𝐵 × 𝐵) Er 𝐵)) | |
5 | 3, 4 | syl 17 | . . 3 ⊢ ((∀𝑥 ∈ 𝐴 𝑅 Er 𝐵 ∧ 𝐴 = ∅) → (((𝐵 × 𝐵) ∩ ∩ 𝑥 ∈ 𝐴 𝑅) Er 𝐵 ↔ (𝐵 × 𝐵) Er 𝐵)) |
6 | 1, 5 | mpbiri 257 | . 2 ⊢ ((∀𝑥 ∈ 𝐴 𝑅 Er 𝐵 ∧ 𝐴 = ∅) → ((𝐵 × 𝐵) ∩ ∩ 𝑥 ∈ 𝐴 𝑅) Er 𝐵) |
7 | iiner 8814 | . . . 4 ⊢ ((𝐴 ≠ ∅ ∧ ∀𝑥 ∈ 𝐴 𝑅 Er 𝐵) → ∩ 𝑥 ∈ 𝐴 𝑅 Er 𝐵) | |
8 | 7 | ancoms 457 | . . 3 ⊢ ((∀𝑥 ∈ 𝐴 𝑅 Er 𝐵 ∧ 𝐴 ≠ ∅) → ∩ 𝑥 ∈ 𝐴 𝑅 Er 𝐵) |
9 | erssxp 8754 | . . . . . 6 ⊢ (𝑅 Er 𝐵 → 𝑅 ⊆ (𝐵 × 𝐵)) | |
10 | 9 | ralimi 3080 | . . . . 5 ⊢ (∀𝑥 ∈ 𝐴 𝑅 Er 𝐵 → ∀𝑥 ∈ 𝐴 𝑅 ⊆ (𝐵 × 𝐵)) |
11 | riinn0 5090 | . . . . 5 ⊢ ((∀𝑥 ∈ 𝐴 𝑅 ⊆ (𝐵 × 𝐵) ∧ 𝐴 ≠ ∅) → ((𝐵 × 𝐵) ∩ ∩ 𝑥 ∈ 𝐴 𝑅) = ∩ 𝑥 ∈ 𝐴 𝑅) | |
12 | 10, 11 | sylan 578 | . . . 4 ⊢ ((∀𝑥 ∈ 𝐴 𝑅 Er 𝐵 ∧ 𝐴 ≠ ∅) → ((𝐵 × 𝐵) ∩ ∩ 𝑥 ∈ 𝐴 𝑅) = ∩ 𝑥 ∈ 𝐴 𝑅) |
13 | ereq1 8738 | . . . 4 ⊢ (((𝐵 × 𝐵) ∩ ∩ 𝑥 ∈ 𝐴 𝑅) = ∩ 𝑥 ∈ 𝐴 𝑅 → (((𝐵 × 𝐵) ∩ ∩ 𝑥 ∈ 𝐴 𝑅) Er 𝐵 ↔ ∩ 𝑥 ∈ 𝐴 𝑅 Er 𝐵)) | |
14 | 12, 13 | syl 17 | . . 3 ⊢ ((∀𝑥 ∈ 𝐴 𝑅 Er 𝐵 ∧ 𝐴 ≠ ∅) → (((𝐵 × 𝐵) ∩ ∩ 𝑥 ∈ 𝐴 𝑅) Er 𝐵 ↔ ∩ 𝑥 ∈ 𝐴 𝑅 Er 𝐵)) |
15 | 8, 14 | mpbird 256 | . 2 ⊢ ((∀𝑥 ∈ 𝐴 𝑅 Er 𝐵 ∧ 𝐴 ≠ ∅) → ((𝐵 × 𝐵) ∩ ∩ 𝑥 ∈ 𝐴 𝑅) Er 𝐵) |
16 | 6, 15 | pm2.61dane 3026 | 1 ⊢ (∀𝑥 ∈ 𝐴 𝑅 Er 𝐵 → ((𝐵 × 𝐵) ∩ ∩ 𝑥 ∈ 𝐴 𝑅) Er 𝐵) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 394 = wceq 1533 ≠ wne 2937 ∀wral 3058 ∩ cin 3948 ⊆ wss 3949 ∅c0 4326 ∩ ciin 5001 × cxp 5680 Er wer 8728 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2166 ax-ext 2699 ax-sep 5303 ax-nul 5310 ax-pr 5433 |
This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2529 df-eu 2558 df-clab 2706 df-cleq 2720 df-clel 2806 df-nfc 2881 df-ne 2938 df-ral 3059 df-rex 3068 df-rab 3431 df-v 3475 df-dif 3952 df-un 3954 df-in 3956 df-ss 3966 df-nul 4327 df-if 4533 df-sn 4633 df-pr 4635 df-op 4639 df-iin 5003 df-br 5153 df-opab 5215 df-xp 5688 df-rel 5689 df-cnv 5690 df-co 5691 df-dm 5692 df-rn 5693 df-er 8731 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |