![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > elssabg | GIF version |
Description: Membership in a class abstraction involving a subset. Unlike elabg 2906, 𝐴 does not have to be a set. (Contributed by NM, 29-Aug-2006.) |
Ref | Expression |
---|---|
elssabg.1 | ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓)) |
Ref | Expression |
---|---|
elssabg | ⊢ (𝐵 ∈ 𝑉 → (𝐴 ∈ {𝑥 ∣ (𝑥 ⊆ 𝐵 ∧ 𝜑)} ↔ (𝐴 ⊆ 𝐵 ∧ 𝜓))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ssexg 4168 | . . . 4 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ 𝑉) → 𝐴 ∈ V) | |
2 | 1 | expcom 116 | . . 3 ⊢ (𝐵 ∈ 𝑉 → (𝐴 ⊆ 𝐵 → 𝐴 ∈ V)) |
3 | 2 | adantrd 279 | . 2 ⊢ (𝐵 ∈ 𝑉 → ((𝐴 ⊆ 𝐵 ∧ 𝜓) → 𝐴 ∈ V)) |
4 | sseq1 3202 | . . . 4 ⊢ (𝑥 = 𝐴 → (𝑥 ⊆ 𝐵 ↔ 𝐴 ⊆ 𝐵)) | |
5 | elssabg.1 | . . . 4 ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓)) | |
6 | 4, 5 | anbi12d 473 | . . 3 ⊢ (𝑥 = 𝐴 → ((𝑥 ⊆ 𝐵 ∧ 𝜑) ↔ (𝐴 ⊆ 𝐵 ∧ 𝜓))) |
7 | 6 | elab3g 2911 | . 2 ⊢ (((𝐴 ⊆ 𝐵 ∧ 𝜓) → 𝐴 ∈ V) → (𝐴 ∈ {𝑥 ∣ (𝑥 ⊆ 𝐵 ∧ 𝜑)} ↔ (𝐴 ⊆ 𝐵 ∧ 𝜓))) |
8 | 3, 7 | syl 14 | 1 ⊢ (𝐵 ∈ 𝑉 → (𝐴 ∈ {𝑥 ∣ (𝑥 ⊆ 𝐵 ∧ 𝜑)} ↔ (𝐴 ⊆ 𝐵 ∧ 𝜓))) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1364 ∈ wcel 2164 {cab 2179 Vcvv 2760 ⊆ wss 3153 |
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-io 710 ax-5 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-ext 2175 ax-sep 4147 |
This theorem depends on definitions: df-bi 117 df-tru 1367 df-nf 1472 df-sb 1774 df-clab 2180 df-cleq 2186 df-clel 2189 df-nfc 2325 df-v 2762 df-in 3159 df-ss 3166 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |