|   | Mathbox for Peter Mazsa | < Previous  
      Next > Nearby theorems | |
| Mirrors > Home > MPE Home > Th. List > Mathboxes > brredundsredund | Structured version Visualization version GIF version | ||
| Description: For sets, binary relation on the class of all redundant sets (brredunds 38627) is equivalent to satisfying the redundancy predicate (df-redund 38625). (Contributed by Peter Mazsa, 25-Oct-2022.) | 
| Ref | Expression | 
|---|---|
| brredundsredund | ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → (𝐴 Redunds 〈𝐵, 𝐶〉 ↔ 𝐴 Redund 〈𝐵, 𝐶〉)) | 
| Step | Hyp | Ref | Expression | 
|---|---|---|---|
| 1 | brredunds 38627 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → (𝐴 Redunds 〈𝐵, 𝐶〉 ↔ (𝐴 ⊆ 𝐵 ∧ (𝐴 ∩ 𝐶) = (𝐵 ∩ 𝐶)))) | |
| 2 | df-redund 38625 | . 2 ⊢ (𝐴 Redund 〈𝐵, 𝐶〉 ↔ (𝐴 ⊆ 𝐵 ∧ (𝐴 ∩ 𝐶) = (𝐵 ∩ 𝐶))) | |
| 3 | 1, 2 | bitr4di 289 | 1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → (𝐴 Redunds 〈𝐵, 𝐶〉 ↔ 𝐴 Redund 〈𝐵, 𝐶〉)) | 
| Colors of variables: wff setvar class | 
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1087 = wceq 1540 ∈ wcel 2108 ∩ cin 3950 ⊆ wss 3951 〈cop 4632 class class class wbr 5143 Redunds credunds 38202 Redund wredund 38203 | 
| 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 2007 ax-8 2110 ax-9 2118 ax-11 2157 ax-12 2177 ax-ext 2708 ax-sep 5296 ax-nul 5306 ax-pr 5432 | 
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1543 df-fal 1553 df-ex 1780 df-sb 2065 df-clab 2715 df-cleq 2729 df-clel 2816 df-ral 3062 df-rex 3071 df-rab 3437 df-v 3482 df-dif 3954 df-un 3956 df-in 3958 df-ss 3968 df-nul 4334 df-if 4526 df-sn 4627 df-pr 4629 df-op 4633 df-br 5144 df-opab 5206 df-xp 5691 df-rel 5692 df-cnv 5693 df-oprab 7435 df-redunds 38624 df-redund 38625 | 
| This theorem is referenced by: (None) | 
| Copyright terms: Public domain | W3C validator |