Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > ibllem | Structured version Visualization version GIF version |
Description: Conditioned equality theorem for the if statement. (Contributed by Mario Carneiro, 31-Jul-2014.) |
Ref | Expression |
---|---|
ibllem.1 | ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 = 𝐶) |
Ref | Expression |
---|---|
ibllem | ⊢ (𝜑 → if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝐵), 𝐵, 0) = if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝐶), 𝐶, 0)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ibllem.1 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 = 𝐶) | |
2 | 1 | breq2d 5086 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (0 ≤ 𝐵 ↔ 0 ≤ 𝐶)) |
3 | 2 | pm5.32da 579 | . . 3 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝐵) ↔ (𝑥 ∈ 𝐴 ∧ 0 ≤ 𝐶))) |
4 | 3 | ifbid 4482 | . 2 ⊢ (𝜑 → if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝐵), 𝐵, 0) = if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝐶), 𝐵, 0)) |
5 | 1 | adantrr 714 | . . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 0 ≤ 𝐶)) → 𝐵 = 𝐶) |
6 | 5 | ifeq1da 4490 | . 2 ⊢ (𝜑 → if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝐶), 𝐵, 0) = if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝐶), 𝐶, 0)) |
7 | 4, 6 | eqtrd 2778 | 1 ⊢ (𝜑 → if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝐵), 𝐵, 0) = if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝐶), 𝐶, 0)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 = wceq 1539 ∈ wcel 2106 ifcif 4459 class class class wbr 5074 0cc0 10871 ≤ cle 11010 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-ext 2709 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-sb 2068 df-clab 2716 df-cleq 2730 df-clel 2816 df-rab 3073 df-v 3434 df-dif 3890 df-un 3892 df-nul 4257 df-if 4460 df-sn 4562 df-pr 4564 df-op 4568 df-br 5075 |
This theorem is referenced by: isibl 24930 isibl2 24931 iblitg 24933 iblcnlem1 24952 iblcnlem 24953 itgcnlem 24954 iblrelem 24955 itgrevallem1 24959 itgeqa 24978 |
Copyright terms: Public domain | W3C validator |