| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > elabgf | Structured version Visualization version GIF version | ||
| Description: Membership in a class abstraction, using implicit substitution. Compare Theorem 6.13 of [Quine] p. 44. This version has bound-variable hypotheses in place of distinct variable restrictions. (Contributed by NM, 21-Sep-2003.) (Revised by Mario Carneiro, 12-Oct-2016.) |
| Ref | Expression |
|---|---|
| elabgf.1 | ⊢ Ⅎ𝑥𝐴 |
| elabgf.2 | ⊢ Ⅎ𝑥𝜓 |
| elabgf.3 | ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓)) |
| Ref | Expression |
|---|---|
| elabgf | ⊢ (𝐴 ∈ 𝐵 → (𝐴 ∈ {𝑥 ∣ 𝜑} ↔ 𝜓)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elabgf.1 | . 2 ⊢ Ⅎ𝑥𝐴 | |
| 2 | nfab1 2903 | . . . 4 ⊢ Ⅎ𝑥{𝑥 ∣ 𝜑} | |
| 3 | 1, 2 | nfel 2915 | . . 3 ⊢ Ⅎ𝑥 𝐴 ∈ {𝑥 ∣ 𝜑} |
| 4 | elabgf.2 | . . 3 ⊢ Ⅎ𝑥𝜓 | |
| 5 | 3, 4 | nfbi 1910 | . 2 ⊢ Ⅎ𝑥(𝐴 ∈ {𝑥 ∣ 𝜑} ↔ 𝜓) |
| 6 | eleq1 2827 | . . 3 ⊢ (𝑥 = 𝐴 → (𝑥 ∈ {𝑥 ∣ 𝜑} ↔ 𝐴 ∈ {𝑥 ∣ 𝜑})) | |
| 7 | elabgf.3 | . . 3 ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓)) | |
| 8 | 6, 7 | bibi12d 346 | . 2 ⊢ (𝑥 = 𝐴 → ((𝑥 ∈ {𝑥 ∣ 𝜑} ↔ 𝜑) ↔ (𝐴 ∈ {𝑥 ∣ 𝜑} ↔ 𝜓))) |
| 9 | abid 2721 | . 2 ⊢ (𝑥 ∈ {𝑥 ∣ 𝜑} ↔ 𝜑) | |
| 10 | 1, 5, 8, 9 | vtoclgf 3513 | 1 ⊢ (𝐴 ∈ 𝐵 → (𝐴 ∈ {𝑥 ∣ 𝜑} ↔ 𝜓)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 207 = wceq 1547 Ⅎwnf 1790 ∈ wcel 2119 {cab 2717 Ⅎwnfc 2886 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2711 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-tru 1550 df-ex 1787 df-nf 1791 df-sb 2074 df-clab 2718 df-cleq 2731 df-clel 2814 df-nfc 2888 df-v 3433 |
| This theorem is referenced by: elabf 3613 elab3gf 3622 elrabf 3626 currysetlem 37298 currysetlem1 37300 |
| Copyright terms: Public domain | W3C validator |