Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > rabeq2i | GIF version |
Description: Inference from equality of a class variable and a restricted class abstraction. (Contributed by NM, 16-Feb-2004.) |
Ref | Expression |
---|---|
rabeq2i.1 | ⊢ 𝐴 = {𝑥 ∈ 𝐵 ∣ 𝜑} |
Ref | Expression |
---|---|
rabeq2i | ⊢ (𝑥 ∈ 𝐴 ↔ (𝑥 ∈ 𝐵 ∧ 𝜑)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | rabeq2i.1 | . . 3 ⊢ 𝐴 = {𝑥 ∈ 𝐵 ∣ 𝜑} | |
2 | 1 | eleq2i 2231 | . 2 ⊢ (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ {𝑥 ∈ 𝐵 ∣ 𝜑}) |
3 | rabid 2639 | . 2 ⊢ (𝑥 ∈ {𝑥 ∈ 𝐵 ∣ 𝜑} ↔ (𝑥 ∈ 𝐵 ∧ 𝜑)) | |
4 | 2, 3 | bitri 183 | 1 ⊢ (𝑥 ∈ 𝐴 ↔ (𝑥 ∈ 𝐵 ∧ 𝜑)) |
Colors of variables: wff set class |
Syntax hints: ∧ wa 103 ↔ wb 104 = wceq 1342 ∈ wcel 2135 {crab 2446 |
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 1434 ax-gen 1436 ax-ie1 1480 ax-ie2 1481 ax-8 1491 ax-4 1497 ax-17 1513 ax-i9 1517 ax-ial 1521 ax-ext 2146 |
This theorem depends on definitions: df-bi 116 df-sb 1750 df-clab 2151 df-cleq 2157 df-clel 2160 df-rab 2451 |
This theorem is referenced by: tfis 4554 fvmptssdm 5564 suplocsrlempr 7739 suplocsrlem 7740 |
Copyright terms: Public domain | W3C validator |