![]() |
Mathbox for Peter Mazsa |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > inecmo | Structured version Visualization version GIF version |
Description: Equivalence of a double restricted universal quantification and a restricted "at most one" inside a universal quantification. (Contributed by Peter Mazsa, 29-May-2018.) |
Ref | Expression |
---|---|
inecmo.1 | ⊢ (𝑥 = 𝑦 → 𝐵 = 𝐶) |
Ref | Expression |
---|---|
inecmo | ⊢ (Rel 𝑅 → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 = 𝑦 ∨ ([𝐵]𝑅 ∩ [𝐶]𝑅) = ∅) ↔ ∀𝑧∃*𝑥 ∈ 𝐴 𝐵𝑅𝑧)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ineleq 38336 | . . 3 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 = 𝑦 ∨ ([𝐵]𝑅 ∩ [𝐶]𝑅) = ∅) ↔ ∀𝑥 ∈ 𝐴 ∀𝑧∀𝑦 ∈ 𝐴 ((𝑧 ∈ [𝐵]𝑅 ∧ 𝑧 ∈ [𝐶]𝑅) → 𝑥 = 𝑦)) | |
2 | ralcom4 3284 | . . 3 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑧∀𝑦 ∈ 𝐴 ((𝑧 ∈ [𝐵]𝑅 ∧ 𝑧 ∈ [𝐶]𝑅) → 𝑥 = 𝑦) ↔ ∀𝑧∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ((𝑧 ∈ [𝐵]𝑅 ∧ 𝑧 ∈ [𝐶]𝑅) → 𝑥 = 𝑦)) | |
3 | 1, 2 | bitri 275 | . 2 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 = 𝑦 ∨ ([𝐵]𝑅 ∩ [𝐶]𝑅) = ∅) ↔ ∀𝑧∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ((𝑧 ∈ [𝐵]𝑅 ∧ 𝑧 ∈ [𝐶]𝑅) → 𝑥 = 𝑦)) |
4 | inecmo.1 | . . . . . 6 ⊢ (𝑥 = 𝑦 → 𝐵 = 𝐶) | |
5 | 4 | breq1d 5158 | . . . . 5 ⊢ (𝑥 = 𝑦 → (𝐵𝑅𝑧 ↔ 𝐶𝑅𝑧)) |
6 | 5 | rmo4 3739 | . . . 4 ⊢ (∃*𝑥 ∈ 𝐴 𝐵𝑅𝑧 ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ((𝐵𝑅𝑧 ∧ 𝐶𝑅𝑧) → 𝑥 = 𝑦)) |
7 | relelec 8791 | . . . . . . 7 ⊢ (Rel 𝑅 → (𝑧 ∈ [𝐵]𝑅 ↔ 𝐵𝑅𝑧)) | |
8 | relelec 8791 | . . . . . . 7 ⊢ (Rel 𝑅 → (𝑧 ∈ [𝐶]𝑅 ↔ 𝐶𝑅𝑧)) | |
9 | 7, 8 | anbi12d 632 | . . . . . 6 ⊢ (Rel 𝑅 → ((𝑧 ∈ [𝐵]𝑅 ∧ 𝑧 ∈ [𝐶]𝑅) ↔ (𝐵𝑅𝑧 ∧ 𝐶𝑅𝑧))) |
10 | 9 | imbi1d 341 | . . . . 5 ⊢ (Rel 𝑅 → (((𝑧 ∈ [𝐵]𝑅 ∧ 𝑧 ∈ [𝐶]𝑅) → 𝑥 = 𝑦) ↔ ((𝐵𝑅𝑧 ∧ 𝐶𝑅𝑧) → 𝑥 = 𝑦))) |
11 | 10 | 2ralbidv 3219 | . . . 4 ⊢ (Rel 𝑅 → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ((𝑧 ∈ [𝐵]𝑅 ∧ 𝑧 ∈ [𝐶]𝑅) → 𝑥 = 𝑦) ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ((𝐵𝑅𝑧 ∧ 𝐶𝑅𝑧) → 𝑥 = 𝑦))) |
12 | 6, 11 | bitr4id 290 | . . 3 ⊢ (Rel 𝑅 → (∃*𝑥 ∈ 𝐴 𝐵𝑅𝑧 ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ((𝑧 ∈ [𝐵]𝑅 ∧ 𝑧 ∈ [𝐶]𝑅) → 𝑥 = 𝑦))) |
13 | 12 | albidv 1918 | . 2 ⊢ (Rel 𝑅 → (∀𝑧∃*𝑥 ∈ 𝐴 𝐵𝑅𝑧 ↔ ∀𝑧∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ((𝑧 ∈ [𝐵]𝑅 ∧ 𝑧 ∈ [𝐶]𝑅) → 𝑥 = 𝑦))) |
14 | 3, 13 | bitr4id 290 | 1 ⊢ (Rel 𝑅 → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 = 𝑦 ∨ ([𝐵]𝑅 ∩ [𝐶]𝑅) = ∅) ↔ ∀𝑧∃*𝑥 ∈ 𝐴 𝐵𝑅𝑧)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∨ wo 847 ∀wal 1535 = wceq 1537 ∈ wcel 2106 ∀wral 3059 ∃*wrmo 3377 ∩ cin 3962 ∅c0 4339 class class class wbr 5148 Rel wrel 5694 [cec 8742 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1908 ax-6 1965 ax-7 2005 ax-8 2108 ax-9 2116 ax-10 2139 ax-11 2155 ax-12 2175 ax-ext 2706 ax-sep 5302 ax-nul 5312 ax-pr 5438 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1540 df-fal 1550 df-ex 1777 df-nf 1781 df-sb 2063 df-mo 2538 df-clab 2713 df-cleq 2727 df-clel 2814 df-ral 3060 df-rex 3069 df-rmo 3378 df-rab 3434 df-v 3480 df-dif 3966 df-un 3968 df-in 3970 df-ss 3980 df-nul 4340 df-if 4532 df-sn 4632 df-pr 4634 df-op 4638 df-br 5149 df-opab 5211 df-xp 5695 df-rel 5696 df-cnv 5697 df-dm 5699 df-rn 5700 df-res 5701 df-ima 5702 df-ec 8746 |
This theorem is referenced by: inecmo2 38338 ineccnvmo 38339 disjres 38726 |
Copyright terms: Public domain | W3C validator |