| 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 3977 | . . . 4 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (𝑥 ⊆ 𝑦 ↔ 𝐴 ⊆ 𝐵)) | |
| 2 | 1 | 3adant3 1132 | . . 3 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵 ∧ 𝑧 = 𝐶) → (𝑥 ⊆ 𝑦 ↔ 𝐴 ⊆ 𝐵)) |
| 3 | ineq12 4181 | . . . . 5 ⊢ ((𝑥 = 𝐴 ∧ 𝑧 = 𝐶) → (𝑥 ∩ 𝑧) = (𝐴 ∩ 𝐶)) | |
| 4 | 3 | 3adant2 1131 | . . . 4 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵 ∧ 𝑧 = 𝐶) → (𝑥 ∩ 𝑧) = (𝐴 ∩ 𝐶)) |
| 5 | ineq12 4181 | . . . . 5 ⊢ ((𝑦 = 𝐵 ∧ 𝑧 = 𝐶) → (𝑦 ∩ 𝑧) = (𝐵 ∩ 𝐶)) | |
| 6 | 5 | 3adant1 1130 | . . . 4 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵 ∧ 𝑧 = 𝐶) → (𝑦 ∩ 𝑧) = (𝐵 ∩ 𝐶)) |
| 7 | 4, 6 | eqeq12d 2746 | . . 3 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵 ∧ 𝑧 = 𝐶) → ((𝑥 ∩ 𝑧) = (𝑦 ∩ 𝑧) ↔ (𝐴 ∩ 𝐶) = (𝐵 ∩ 𝐶))) |
| 8 | 2, 7 | anbi12d 632 | . 2 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵 ∧ 𝑧 = 𝐶) → ((𝑥 ⊆ 𝑦 ∧ (𝑥 ∩ 𝑧) = (𝑦 ∩ 𝑧)) ↔ (𝐴 ⊆ 𝐵 ∧ (𝐴 ∩ 𝐶) = (𝐵 ∩ 𝐶)))) |
| 9 | df-redunds 38621 | . 2 ⊢ Redunds = ◡{〈〈𝑦, 𝑧〉, 𝑥〉 ∣ (𝑥 ⊆ 𝑦 ∧ (𝑥 ∩ 𝑧) = (𝑦 ∩ 𝑧))} | |
| 10 | 8, 9 | brcnvrabga 38331 | 1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → (𝐴 Redunds 〈𝐵, 𝐶〉 ↔ (𝐴 ⊆ 𝐵 ∧ (𝐴 ∩ 𝐶) = (𝐵 ∩ 𝐶)))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1086 = wceq 1540 ∈ wcel 2109 ∩ cin 3916 ⊆ wss 3917 〈cop 4598 class class class wbr 5110 Redunds credunds 38196 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-11 2158 ax-12 2178 ax-ext 2702 ax-sep 5254 ax-nul 5264 ax-pr 5390 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-sb 2066 df-clab 2709 df-cleq 2722 df-clel 2804 df-ral 3046 df-rex 3055 df-rab 3409 df-v 3452 df-dif 3920 df-un 3922 df-in 3924 df-ss 3934 df-nul 4300 df-if 4492 df-sn 4593 df-pr 4595 df-op 4599 df-br 5111 df-opab 5173 df-xp 5647 df-rel 5648 df-cnv 5649 df-oprab 7394 df-redunds 38621 |
| This theorem is referenced by: brredundsredund 38625 |
| Copyright terms: Public domain | W3C validator |