Users' Mathboxes Mathbox for Owen Orger < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  elelssini Structured version   Visualization version   GIF version

Theorem elelssini 44496
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.)
Hypotheses
Ref Expression
elelssini.1 𝐴 ∈ 𝐵
elelssini.2 𝐵 = 𝐶
elelssini.3 𝐴 ∈ 𝐷
elelssini.4 𝐷 ⊆ 𝐸
Assertion
Ref Expression
elelssini 𝐴 ∈ (𝐶 ∩ 𝐸)

Proof of Theorem elelssini
StepHypRef Expression
1 elelssini.1 . . 3 𝐴 ∈ 𝐵
2 elelssini.2 . . 3 𝐵 = 𝐶
31, 2eleqtri 2862 . 2 𝐴 ∈ 𝐶
4 elelssini.4 . . 3 𝐷 ⊆ 𝐸
5 elelssini.3 . . 3 𝐴 ∈ 𝐷
64, 5sselii 3910 . 2 𝐴 ∈ 𝐸
73, 6elini 4099 1 𝐴 ∈ (𝐶 ∩ 𝐸)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   = wceq 1570   ∈ wcel 2147   ⊆ wss 3900   ∩ cin 4092
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735
This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-v 3456  df-ss 3901  df-in 4094
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator