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 2909 | . . . 4 ⊢ Ⅎ𝑥{𝑥 ∣ 𝜑} | |
3 | 1, 2 | nfel 2921 | . . 3 ⊢ Ⅎ𝑥 𝐴 ∈ {𝑥 ∣ 𝜑} |
4 | elabgf.2 | . . 3 ⊢ Ⅎ𝑥𝜓 | |
5 | 3, 4 | nfbi 1906 | . 2 ⊢ Ⅎ𝑥(𝐴 ∈ {𝑥 ∣ 𝜑} ↔ 𝜓) |
6 | eleq1 2826 | . . 3 ⊢ (𝑥 = 𝐴 → (𝑥 ∈ {𝑥 ∣ 𝜑} ↔ 𝐴 ∈ {𝑥 ∣ 𝜑})) | |
7 | elabgf.3 | . . 3 ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓)) | |
8 | 6, 7 | bibi12d 346 | . 2 ⊢ (𝑥 = 𝐴 → ((𝑥 ∈ {𝑥 ∣ 𝜑} ↔ 𝜑) ↔ (𝐴 ∈ {𝑥 ∣ 𝜑} ↔ 𝜓))) |
9 | abid 2719 | . 2 ⊢ (𝑥 ∈ {𝑥 ∣ 𝜑} ↔ 𝜑) | |
10 | 1, 5, 8, 9 | vtoclgf 3503 | 1 ⊢ (𝐴 ∈ 𝐵 → (𝐴 ∈ {𝑥 ∣ 𝜑} ↔ 𝜓)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 = wceq 1539 Ⅎwnf 1786 ∈ wcel 2106 {cab 2715 Ⅎwnfc 2887 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-tru 1542 df-ex 1783 df-nf 1787 df-sb 2068 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-v 3434 |
This theorem is referenced by: elabf 3606 elab3gf 3615 elrabf 3620 currysetlem 35134 currysetlem1 35136 |
Copyright terms: Public domain | W3C validator |