Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > inex1g | GIF version |
Description: Closed-form, generalized Separation Scheme. (Contributed by NM, 7-Apr-1995.) |
Ref | Expression |
---|---|
inex1g | ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∩ 𝐵) ∈ V) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ineq1 3270 | . . 3 ⊢ (𝑥 = 𝐴 → (𝑥 ∩ 𝐵) = (𝐴 ∩ 𝐵)) | |
2 | 1 | eleq1d 2208 | . 2 ⊢ (𝑥 = 𝐴 → ((𝑥 ∩ 𝐵) ∈ V ↔ (𝐴 ∩ 𝐵) ∈ V)) |
3 | vex 2689 | . . 3 ⊢ 𝑥 ∈ V | |
4 | 3 | inex1 4062 | . 2 ⊢ (𝑥 ∩ 𝐵) ∈ V |
5 | 2, 4 | vtoclg 2746 | 1 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∩ 𝐵) ∈ V) |
Colors of variables: wff set class |
Syntax hints: → wi 4 = wceq 1331 ∈ wcel 1480 Vcvv 2686 ∩ cin 3070 |
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 2121 ax-sep 4046 |
This theorem depends on definitions: df-bi 116 df-tru 1334 df-nf 1437 df-sb 1736 df-clab 2126 df-cleq 2132 df-clel 2135 df-nfc 2270 df-v 2688 df-in 3077 |
This theorem is referenced by: onin 4308 dmresexg 4842 funimaexg 5207 offval 5989 offval3 6032 ssenen 6745 ressval2 12019 eltg 12221 eltg3 12226 ntrval 12279 restco 12343 |
Copyright terms: Public domain | W3C validator |