Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > rabbidva | GIF version |
Description: Equivalent wff's yield equal restricted class abstractions (deduction form). (Contributed by NM, 28-Nov-2003.) |
Ref | Expression |
---|---|
rabbidva.1 | ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝜓 ↔ 𝜒)) |
Ref | Expression |
---|---|
rabbidva | ⊢ (𝜑 → {𝑥 ∈ 𝐴 ∣ 𝜓} = {𝑥 ∈ 𝐴 ∣ 𝜒}) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | rabbidva.1 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝜓 ↔ 𝜒)) | |
2 | 1 | ralrimiva 2503 | . 2 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 (𝜓 ↔ 𝜒)) |
3 | rabbi 2606 | . 2 ⊢ (∀𝑥 ∈ 𝐴 (𝜓 ↔ 𝜒) ↔ {𝑥 ∈ 𝐴 ∣ 𝜓} = {𝑥 ∈ 𝐴 ∣ 𝜒}) | |
4 | 2, 3 | sylib 121 | 1 ⊢ (𝜑 → {𝑥 ∈ 𝐴 ∣ 𝜓} = {𝑥 ∈ 𝐴 ∣ 𝜒}) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ↔ wb 104 = wceq 1331 ∈ wcel 1480 ∀wral 2414 {crab 2418 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-5 1423 ax-7 1424 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-8 1482 ax-11 1484 ax-4 1487 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2119 |
This theorem depends on definitions: df-bi 116 df-tru 1334 df-nf 1437 df-sb 1736 df-clab 2124 df-cleq 2130 df-ral 2419 df-rab 2423 |
This theorem is referenced by: rabbidv 2670 rabeqbidva 2677 rabbi2dva 3279 rabxfrd 4385 onsucmin 4418 seinxp 4605 fniniseg2 5535 fnniniseg2 5536 f1oresrab 5578 dfinfre 8707 minmax 10994 xrminmax 11027 iooinsup 11039 gcdass 11692 lcmass 11755 bdbl 12661 xmetxpbl 12666 |
Copyright terms: Public domain | W3C validator |