nnsseleq - Intuitionistic Logic Explorer

	Intuitionistic Logic Explorer		< Previous Next > Nearby theorems
Mirrors > Home > ILE Home > Th. List > nnsseleq		GIF version

Theorem nnsseleq 6734

Description: For natural numbers, inclusion is equivalent to membership or equality. (Contributed by Jim Kingdon, 16-Sep-2021.)

**Assertion**
Ref	Expression
nnsseleq	⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴 ⊆ 𝐵 ↔ (𝐴 ∈ 𝐵 ∨ 𝐴 = 𝐵)))

**Proof of Theorem nnsseleq**
Step	Hyp	Ref	Expression
1		nntri1 6729	. . 3 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴 ⊆ 𝐵 ↔ ¬ 𝐵 ∈ 𝐴))
2		nntri3or 6726	. . . . . 6 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴 ∈ 𝐵 ∨ 𝐴 = 𝐵 ∨ 𝐵 ∈ 𝐴))
3		df-3or 1006	. . . . . 6 ⊢ ((𝐴 ∈ 𝐵 ∨ 𝐴 = 𝐵 ∨ 𝐵 ∈ 𝐴) ↔ ((𝐴 ∈ 𝐵 ∨ 𝐴 = 𝐵) ∨ 𝐵 ∈ 𝐴))
4	2, 3	sylib 122	. . . . 5 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → ((𝐴 ∈ 𝐵 ∨ 𝐴 = 𝐵) ∨ 𝐵 ∈ 𝐴))
5	4	orcomd 737	. . . 4 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐵 ∈ 𝐴 ∨ (𝐴 ∈ 𝐵 ∨ 𝐴 = 𝐵)))
6	5	ord 732	. . 3 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (¬ 𝐵 ∈ 𝐴 → (𝐴 ∈ 𝐵 ∨ 𝐴 = 𝐵)))
7	1, 6	sylbid 150	. 2 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴 ⊆ 𝐵 → (𝐴 ∈ 𝐵 ∨ 𝐴 = 𝐵)))
8		nnord 4734	. . . . 5 ⊢ (𝐵 ∈ ω → Ord 𝐵)
9	8	adantl 277	. . . 4 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → Ord 𝐵)
10		ordelss 4500	. . . . 5 ⊢ ((Ord 𝐵 ∧ 𝐴 ∈ 𝐵) → 𝐴 ⊆ 𝐵)
11	10	ex 115	. . . 4 ⊢ (Ord 𝐵 → (𝐴 ∈ 𝐵 → 𝐴 ⊆ 𝐵))
12	9, 11	syl 14	. . 3 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴 ∈ 𝐵 → 𝐴 ⊆ 𝐵))
13		eqimss 3292	. . . 4 ⊢ (𝐴 = 𝐵 → 𝐴 ⊆ 𝐵)
14	13	a1i 9	. . 3 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴 = 𝐵 → 𝐴 ⊆ 𝐵))
15	12, 14	jaod 725	. 2 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → ((𝐴 ∈ 𝐵 ∨ 𝐴 = 𝐵) → 𝐴 ⊆ 𝐵))
16	7, 15	impbid 129	1 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴 ⊆ 𝐵 ↔ (𝐴 ∈ 𝐵 ∨ 𝐴 = 𝐵)))

Colors of variables: wff set class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ↔ wb 105 ∨ wo 716 ∨ w3o 1004 = wceq 1398 ∈ wcel 2203 ⊆ wss 3211 Ord word 4483 ωcom 4712

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-13 2205 ax-14 2206 ax-ext 2214 ax-sep 4228 ax-nul 4236 ax-pow 4287 ax-pr 4322 ax-un 4554 ax-setind 4659 ax-iinf 4710

This theorem depends on definitions: df-bi 117 df-3or 1006 df-3an 1007 df-tru 1401 df-nf 1510 df-sb 1812 df-clab 2219 df-cleq 2225 df-clel 2228 df-nfc 2373 df-ne 2413 df-ral 2525 df-rex 2526 df-v 2815 df-dif 3213 df-un 3215 df-in 3217 df-ss 3224 df-nul 3509 df-pw 3671 df-sn 3695 df-pr 3696 df-uni 3915 df-int 3950 df-tr 4209 df-iord 4487 df-on 4489 df-suc 4492 df-iom 4713

This theorem is referenced by: nnsssuc 6735 frec2uzled 10791

W3C validator