Theorem bj-nnen2lp 16499

Description: A version of en2lp 4650 for natural numbers, which does not require ax-setind 4633.

Note: using this theorem and bj-nnelirr 16498, one can remove dependency on ax-setind 4633 from nntri2 6657 and nndcel 6663; one can actually remove more dependencies from these. (Contributed by BJ, 28-Nov-2019.) (Proof modification is discouraged.)

Assertion

Ref	Expression
bj-nnen2lp	⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → ¬ (𝐴 ∈ 𝐵 ∧ 𝐵 ∈ 𝐴))

Proof of Theorem bj-nnen2lp

Step	Hyp	Ref	Expression
1		bj-nnelirr 16498	. . 3 ⊢ (𝐵 ∈ ω → ¬ 𝐵 ∈ 𝐵)
2	1	adantl 277	. 2 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → ¬ 𝐵 ∈ 𝐵)
3		bj-nntrans 16496	. . . . 5 ⊢ (𝐵 ∈ ω → (𝐴 ∈ 𝐵 → 𝐴 ⊆ 𝐵))
4	3	adantl 277	. . . 4 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴 ∈ 𝐵 → 𝐴 ⊆ 𝐵))
5		ssel 3219	. . . 4 ⊢ (𝐴 ⊆ 𝐵 → (𝐵 ∈ 𝐴 → 𝐵 ∈ 𝐵))
6	4, 5	syl6 33	. . 3 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴 ∈ 𝐵 → (𝐵 ∈ 𝐴 → 𝐵 ∈ 𝐵)))
7	6	impd 254	. 2 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → ((𝐴 ∈ 𝐵 ∧ 𝐵 ∈ 𝐴) → 𝐵 ∈ 𝐵))
8	2, 7	mtod 667	1 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → ¬ (𝐴 ∈ 𝐵 ∧ 𝐵 ∈ 𝐴))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 104   ∈ wcel 2200   ⊆ wss 3198  ωcom 4686

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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-nul 4213  ax-pr 4297  ax-un 4528  ax-bd0 16358  ax-bdor 16361  ax-bdn 16362  ax-bdal 16363  ax-bdex 16364  ax-bdeq 16365  ax-bdel 16366  ax-bdsb 16367  ax-bdsep 16429  ax-infvn 16486

This theorem depends on definitions:  df-bi 117  df-tru 1398  df-nf 1507  df-sb 1809  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-rab 2517  df-v 2802  df-dif 3200  df-un 3202  df-in 3204  df-ss 3211  df-nul 3493  df-sn 3673  df-pr 3674  df-uni 3892  df-int 3927  df-suc 4466  df-iom 4687  df-bdc 16386  df-bj-ind 16472

This theorem is referenced by:  bj-peano4  16500