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 2825, 𝐴 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 4062 | . . . 4 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ 𝑉) → 𝐴 ∈ V) | |
2 | 1 | expcom 115 | . . 3 ⊢ (𝐵 ∈ 𝑉 → (𝐴 ⊆ 𝐵 → 𝐴 ∈ V)) |
3 | 2 | adantrd 277 | . 2 ⊢ (𝐵 ∈ 𝑉 → ((𝐴 ⊆ 𝐵 ∧ 𝜓) → 𝐴 ∈ V)) |
4 | sseq1 3115 | . . . 4 ⊢ (𝑥 = 𝐴 → (𝑥 ⊆ 𝐵 ↔ 𝐴 ⊆ 𝐵)) | |
5 | elssabg.1 | . . . 4 ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓)) | |
6 | 4, 5 | anbi12d 464 | . . 3 ⊢ (𝑥 = 𝐴 → ((𝑥 ⊆ 𝐵 ∧ 𝜑) ↔ (𝐴 ⊆ 𝐵 ∧ 𝜓))) |
7 | 6 | elab3g 2830 | . 2 ⊢ (((𝐴 ⊆ 𝐵 ∧ 𝜓) → 𝐴 ∈ V) → (𝐴 ∈ {𝑥 ∣ (𝑥 ⊆ 𝐵 ∧ 𝜑)} ↔ (𝐴 ⊆ 𝐵 ∧ 𝜓))) |
8 | 3, 7 | syl 14 | 1 ⊢ (𝐵 ∈ 𝑉 → (𝐴 ∈ {𝑥 ∣ (𝑥 ⊆ 𝐵 ∧ 𝜑)} ↔ (𝐴 ⊆ 𝐵 ∧ 𝜓))) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ↔ wb 104 = wceq 1331 ∈ wcel 1480 {cab 2123 Vcvv 2681 ⊆ wss 3066 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-io 698 ax-5 1423 ax-7 1424 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-8 1482 ax-10 1483 ax-11 1484 ax-i12 1485 ax-bndl 1486 ax-4 1487 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2119 ax-sep 4041 |
This theorem depends on definitions: df-bi 116 df-tru 1334 df-nf 1437 df-sb 1736 df-clab 2124 df-cleq 2130 df-clel 2133 df-nfc 2268 df-v 2683 df-in 3072 df-ss 3079 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |