Metamath Proof Explorer


Theorem eleqssii

Description: Transport membership by equality of the containing class and then by inclusion. Proof supplied by Owen Orger. AI assistance from OpenAI Codex in preparation and verification. (Contributed by Owen Orger, 11-Nov-2026)

Ref Expression
Hypotheses eleqssii.1
|- A e. B
eleqssii.2
|- B = C
eleqssii.3
|- C C_ D
Assertion eleqssii
|- A e. D

Proof

Step Hyp Ref Expression
1 eleqssii.1
 |-  A e. B
2 eleqssii.2
 |-  B = C
3 eleqssii.3
 |-  C C_ D
4 1 2 eleqtri
 |-  A e. C
5 3 4 sselii
 |-  A e. D