Theorem subelofr-P5.CL 641

Description: Closed Form of subelofr-P5.CL 641

Assertion

Ref	Expression
subelofr-P5.CL	⊢ (𝑡 = 𝑢 → (𝑤 ∈ 𝑡 ↔ 𝑤 ∈ 𝑢))

Proof of Theorem subelofr-P5.CL

Step	Hyp	Ref	Expression
1		rcp-NDASM1of1 192	. 2 ⊢ (𝑡 = 𝑢 → 𝑡 = 𝑢)
2	1	subelofr-P5 640	1 ⊢ (𝑡 = 𝑢 → (𝑤 ∈ 𝑡 ↔ 𝑤 ∈ 𝑢))

Syntax hints:   = wff-equals 6   ∈ wff-elemof 7   → wff-imp 10   ↔ wff-bi 104

This theorem was proved from axioms:  ax-L1 11  ax-L2 12  ax-L3 13  ax-MP 14  ax-GEN 15  ax-L4 16  ax-L5 17  ax-L6 18  ax-L7 19  ax-L8-inr 21

This theorem depends on definitions:  df-bi-D2.1 107  df-and-D2.2 133  df-or-D2.3 145  df-true-D2.4 155  df-rcp-AND3 161  df-exists-D5.1 596

This theorem is referenced by:  example-E6.01a  706