Theorem ssnel 4673

Description: Relationship between subset and elementhood. In the context of ordinals this can be seen as an ordering law. (Contributed by Jim Kingdon, 22-Jul-2019.)

Assertion

Ref	Expression
ssnel	⊢ (𝐴 ⊆ 𝐵 → ¬ 𝐵 ∈ 𝐴)

Proof of Theorem ssnel

Step	Hyp	Ref	Expression
1		elirr 4645	. 2 ⊢ ¬ 𝐵 ∈ 𝐵
2		ssel 3222	. 2 ⊢ (𝐴 ⊆ 𝐵 → (𝐵 ∈ 𝐴 → 𝐵 ∈ 𝐵))
3	1, 2	mtoi 670	1 ⊢ (𝐴 ⊆ 𝐵 → ¬ 𝐵 ∈ 𝐴)

Syntax hints:  ¬ wn 3   → wi 4   ∈ wcel 2202   ⊆ wss 3201

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-ext 2213  ax-setind 4641

This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-ral 2516  df-v 2805  df-dif 3203  df-in 3207  df-ss 3214  df-sn 3679

This theorem is referenced by:  nntri1  6707  pw1ne3  7491  3nelsucpw1  7495  3nsssucpw1  7497  nninfctlemfo  12674