| 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 2898 | . . . 4 ⊢ Ⅎ𝑥{𝑥 ∣ 𝜑} | |
| 3 | 1, 2 | nfel 2911 | . . 3 ⊢ Ⅎ𝑥 𝐴 ∈ {𝑥 ∣ 𝜑} |
| 4 | elabgf.2 | . . 3 ⊢ Ⅎ𝑥𝜓 | |
| 5 | 3, 4 | nfbi 1904 | . 2 ⊢ Ⅎ𝑥(𝐴 ∈ {𝑥 ∣ 𝜑} ↔ 𝜓) |
| 6 | eleq1 2822 | . . 3 ⊢ (𝑥 = 𝐴 → (𝑥 ∈ {𝑥 ∣ 𝜑} ↔ 𝐴 ∈ {𝑥 ∣ 𝜑})) | |
| 7 | elabgf.3 | . . 3 ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓)) | |
| 8 | 6, 7 | bibi12d 345 | . 2 ⊢ (𝑥 = 𝐴 → ((𝑥 ∈ {𝑥 ∣ 𝜑} ↔ 𝜑) ↔ (𝐴 ∈ {𝑥 ∣ 𝜑} ↔ 𝜓))) |
| 9 | abid 2716 | . 2 ⊢ (𝑥 ∈ {𝑥 ∣ 𝜑} ↔ 𝜑) | |
| 10 | 1, 5, 8, 9 | vtoclgf 3523 | 1 ⊢ (𝐴 ∈ 𝐵 → (𝐴 ∈ {𝑥 ∣ 𝜑} ↔ 𝜓)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 = wceq 1541 Ⅎwnf 1784 ∈ wcel 2113 {cab 2712 Ⅎwnfc 2881 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2706 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-tru 1544 df-ex 1781 df-nf 1785 df-sb 2068 df-clab 2713 df-cleq 2726 df-clel 2809 df-nfc 2883 df-v 3440 |
| This theorem is referenced by: elabf 3628 elab3gf 3637 elrabf 3641 currysetlem 37089 currysetlem1 37091 |
| Copyright terms: Public domain | W3C validator |