Metamath Proof Explorer


Theorem elelssini

Description: Transport two memberships, one by equality and the other by inclusion, and intersect the containers. Proof supplied by Owen Orger. AI assistance from OpenAI Codex in preparation and verification. (Contributed by Owen Orger, 11-Nov-2026)

Ref Expression
Hypotheses elelssini.1 ⊢ A ∈ B
elelssini.2 ⊢ B = C
elelssini.3 ⊢ A ∈ D
elelssini.4 ⊢ D ⊆ E
Assertion elelssini ⊢ A ∈ C ∩ E

Proof

Step Hyp Ref Expression
1 elelssini.1 ⊢ A ∈ B
2 elelssini.2 ⊢ B = C
3 elelssini.3 ⊢ A ∈ D
4 elelssini.4 ⊢ D ⊆ E
5 1 2 eleqtri ⊢ A ∈ C
6 4 3 sselii ⊢ A ∈ E
7 5 6 elini ⊢ A ∈ C ∩ E