| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > rabbi | GIF version | ||
| Description: Equivalent wff's correspond to equal restricted class abstractions. Closed theorem form of rabbidva 2790. (Contributed by NM, 25-Nov-2013.) |
| Ref | Expression |
|---|---|
| rabbi | ⊢ (∀𝑥 ∈ 𝐴 (𝜓 ↔ 𝜒) ↔ {𝑥 ∈ 𝐴 ∣ 𝜓} = {𝑥 ∈ 𝐴 ∣ 𝜒}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | abbi 2345 | . 2 ⊢ (∀𝑥((𝑥 ∈ 𝐴 ∧ 𝜓) ↔ (𝑥 ∈ 𝐴 ∧ 𝜒)) ↔ {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜓)} = {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜒)}) | |
| 2 | df-ral 2515 | . . 3 ⊢ (∀𝑥 ∈ 𝐴 (𝜓 ↔ 𝜒) ↔ ∀𝑥(𝑥 ∈ 𝐴 → (𝜓 ↔ 𝜒))) | |
| 3 | pm5.32 453 | . . . 4 ⊢ ((𝑥 ∈ 𝐴 → (𝜓 ↔ 𝜒)) ↔ ((𝑥 ∈ 𝐴 ∧ 𝜓) ↔ (𝑥 ∈ 𝐴 ∧ 𝜒))) | |
| 4 | 3 | albii 1518 | . . 3 ⊢ (∀𝑥(𝑥 ∈ 𝐴 → (𝜓 ↔ 𝜒)) ↔ ∀𝑥((𝑥 ∈ 𝐴 ∧ 𝜓) ↔ (𝑥 ∈ 𝐴 ∧ 𝜒))) |
| 5 | 2, 4 | bitri 184 | . 2 ⊢ (∀𝑥 ∈ 𝐴 (𝜓 ↔ 𝜒) ↔ ∀𝑥((𝑥 ∈ 𝐴 ∧ 𝜓) ↔ (𝑥 ∈ 𝐴 ∧ 𝜒))) |
| 6 | df-rab 2519 | . . 3 ⊢ {𝑥 ∈ 𝐴 ∣ 𝜓} = {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜓)} | |
| 7 | df-rab 2519 | . . 3 ⊢ {𝑥 ∈ 𝐴 ∣ 𝜒} = {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜒)} | |
| 8 | 6, 7 | eqeq12i 2245 | . 2 ⊢ ({𝑥 ∈ 𝐴 ∣ 𝜓} = {𝑥 ∈ 𝐴 ∣ 𝜒} ↔ {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜓)} = {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜒)}) |
| 9 | 1, 5, 8 | 3bitr4i 212 | 1 ⊢ (∀𝑥 ∈ 𝐴 (𝜓 ↔ 𝜒) ↔ {𝑥 ∈ 𝐴 ∣ 𝜓} = {𝑥 ∈ 𝐴 ∣ 𝜒}) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 ∀wal 1395 = wceq 1397 ∈ wcel 2202 {cab 2217 ∀wral 2510 {crab 2514 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-11 1554 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-ext 2213 |
| This theorem depends on definitions: df-bi 117 df-tru 1400 df-nf 1509 df-sb 1811 df-clab 2218 df-cleq 2224 df-ral 2515 df-rab 2519 |
| This theorem is referenced by: rabbidva 2790 exmidonfinlem 7403 |
| Copyright terms: Public domain | W3C validator |