| Mathbox for Peter Mazsa |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > brredunds | Structured version Visualization version GIF version | ||
| Description: Binary relation on the class of all redundant sets. (Contributed by Peter Mazsa, 25-Oct-2022.) |
| Ref | Expression |
|---|---|
| brredunds | ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → (𝐴 Redunds 〈𝐵, 𝐶〉 ↔ (𝐴 ⊆ 𝐵 ∧ (𝐴 ∩ 𝐶) = (𝐵 ∩ 𝐶)))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | sseq12 3972 | . . . 4 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (𝑥 ⊆ 𝑦 ↔ 𝐴 ⊆ 𝐵)) | |
| 2 | 1 | 3adant3 1148 | . . 3 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵 ∧ 𝑧 = 𝐶) → (𝑥 ⊆ 𝑦 ↔ 𝐴 ⊆ 𝐵)) |
| 3 | ineq12 4176 | . . . . 5 ⊢ ((𝑥 = 𝐴 ∧ 𝑧 = 𝐶) → (𝑥 ∩ 𝑧) = (𝐴 ∩ 𝐶)) | |
| 4 | 3 | 3adant2 1147 | . . . 4 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵 ∧ 𝑧 = 𝐶) → (𝑥 ∩ 𝑧) = (𝐴 ∩ 𝐶)) |
| 5 | ineq12 4176 | . . . . 5 ⊢ ((𝑦 = 𝐵 ∧ 𝑧 = 𝐶) → (𝑦 ∩ 𝑧) = (𝐵 ∩ 𝐶)) | |
| 6 | 5 | 3adant1 1146 | . . . 4 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵 ∧ 𝑧 = 𝐶) → (𝑦 ∩ 𝑧) = (𝐵 ∩ 𝐶)) |
| 7 | 4, 6 | eqeq12d 2786 | . . 3 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵 ∧ 𝑧 = 𝐶) → ((𝑥 ∩ 𝑧) = (𝑦 ∩ 𝑧) ↔ (𝐴 ∩ 𝐶) = (𝐵 ∩ 𝐶))) |
| 8 | 2, 7 | anbi12d 643 | . 2 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵 ∧ 𝑧 = 𝐶) → ((𝑥 ⊆ 𝑦 ∧ (𝑥 ∩ 𝑧) = (𝑦 ∩ 𝑧)) ↔ (𝐴 ⊆ 𝐵 ∧ (𝐴 ∩ 𝐶) = (𝐵 ∩ 𝐶)))) |
| 9 | df-redunds 39306 | . 2 ⊢ Redunds = ◡{〈〈𝑦, 𝑧〉, 𝑥〉 ∣ (𝑥 ⊆ 𝑦 ∧ (𝑥 ∩ 𝑧) = (𝑦 ∩ 𝑧))} | |
| 10 | 8, 9 | brcnvrabga 38941 | 1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → (𝐴 Redunds 〈𝐵, 𝐶〉 ↔ (𝐴 ⊆ 𝐵 ∧ (𝐴 ∩ 𝐶) = (𝐵 ∩ 𝐶)))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 ∧ w3a 1101 = wceq 1568 ∈ wcel 2150 ∩ cin 3912 ⊆ wss 3913 〈cop 4600 class class class wbr 5114 Redunds credunds 38802 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1823 ax-4 1837 ax-5 1938 ax-6 1995 ax-7 2036 ax-8 2152 ax-9 2160 ax-11 2199 ax-12 2220 ax-ext 2742 ax-sep 5262 ax-pr 5408 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1571 df-fal 1581 df-ex 1808 df-sb 2099 df-clab 2749 df-cleq 2762 df-clel 2845 df-ral 3087 df-rex 3097 df-rab 3424 df-v 3464 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-nul 4295 df-if 4493 df-sn 4595 df-pr 4597 df-op 4601 df-br 5115 df-opab 5179 df-xp 5671 df-rel 5672 df-cnv 5673 df-oprab 7418 df-redunds 39306 |
| This theorem is referenced by: brredundsredund 39310 |
| Copyright terms: Public domain | W3C validator |