Theorem bj-nntrans 14706

Description: A natural number is a transitive set. (Contributed by BJ, 22-Nov-2019.) (Proof modification is discouraged.)

Assertion

Ref	Expression
bj-nntrans	⊢ (𝐴 ∈ ω → (𝐵 ∈ 𝐴 → 𝐵 ⊆ 𝐴))

Proof of Theorem bj-nntrans

Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ral0 3525	. . 3 ⊢ ∀𝑥 ∈ ∅ 𝑥 ⊆ ∅
2		df-suc 4372	. . . . . . 7 ⊢ suc 𝑧 = (𝑧 ∪ {𝑧})
3	2	eleq2i 2244	. . . . . 6 ⊢ (𝑥 ∈ suc 𝑧 ↔ 𝑥 ∈ (𝑧 ∪ {𝑧}))
4		elun 3277	. . . . . . 7 ⊢ (𝑥 ∈ (𝑧 ∪ {𝑧}) ↔ (𝑥 ∈ 𝑧 ∨ 𝑥 ∈ {𝑧}))
5		sssucid 4416	. . . . . . . . . 10 ⊢ 𝑧 ⊆ suc 𝑧
6		sstr2 3163	. . . . . . . . . 10 ⊢ (𝑥 ⊆ 𝑧 → (𝑧 ⊆ suc 𝑧 → 𝑥 ⊆ suc 𝑧))
7	5, 6	mpi 15	. . . . . . . . 9 ⊢ (𝑥 ⊆ 𝑧 → 𝑥 ⊆ suc 𝑧)
8	7	imim2i 12	. . . . . . . 8 ⊢ ((𝑥 ∈ 𝑧 → 𝑥 ⊆ 𝑧) → (𝑥 ∈ 𝑧 → 𝑥 ⊆ suc 𝑧))
9		elsni 3611	. . . . . . . . . 10 ⊢ (𝑥 ∈ {𝑧} → 𝑥 = 𝑧)
10	9, 5	eqsstrdi 3208	. . . . . . . . 9 ⊢ (𝑥 ∈ {𝑧} → 𝑥 ⊆ suc 𝑧)
11	10	a1i 9	. . . . . . . 8 ⊢ ((𝑥 ∈ 𝑧 → 𝑥 ⊆ 𝑧) → (𝑥 ∈ {𝑧} → 𝑥 ⊆ suc 𝑧))
12	8, 11	jaod 717	. . . . . . 7 ⊢ ((𝑥 ∈ 𝑧 → 𝑥 ⊆ 𝑧) → ((𝑥 ∈ 𝑧 ∨ 𝑥 ∈ {𝑧}) → 𝑥 ⊆ suc 𝑧))
13	4, 12	biimtrid 152	. . . . . 6 ⊢ ((𝑥 ∈ 𝑧 → 𝑥 ⊆ 𝑧) → (𝑥 ∈ (𝑧 ∪ {𝑧}) → 𝑥 ⊆ suc 𝑧))
14	3, 13	biimtrid 152	. . . . 5 ⊢ ((𝑥 ∈ 𝑧 → 𝑥 ⊆ 𝑧) → (𝑥 ∈ suc 𝑧 → 𝑥 ⊆ suc 𝑧))
15	14	ralimi2 2537	. . . 4 ⊢ (∀𝑥 ∈ 𝑧 𝑥 ⊆ 𝑧 → ∀𝑥 ∈ suc 𝑧𝑥 ⊆ suc 𝑧)
16	15	rgenw 2532	. . 3 ⊢ ∀𝑧 ∈ ω (∀𝑥 ∈ 𝑧 𝑥 ⊆ 𝑧 → ∀𝑥 ∈ suc 𝑧𝑥 ⊆ suc 𝑧)
17		bdcv 14603	. . . . . 6 ⊢ BOUNDED 𝑦
18	17	bdss 14619	. . . . 5 ⊢ BOUNDED 𝑥 ⊆ 𝑦
19	18	ax-bdal 14573	. . . 4 ⊢ BOUNDED ∀𝑥 ∈ 𝑦 𝑥 ⊆ 𝑦
20		nfv 1528	. . . 4 ⊢ Ⅎ𝑦∀𝑥 ∈ ∅ 𝑥 ⊆ ∅
21		nfv 1528	. . . 4 ⊢ Ⅎ𝑦∀𝑥 ∈ 𝑧 𝑥 ⊆ 𝑧
22		nfv 1528	. . . 4 ⊢ Ⅎ𝑦∀𝑥 ∈ suc 𝑧𝑥 ⊆ suc 𝑧
23		sseq2 3180	. . . . . 6 ⊢ (𝑦 = ∅ → (𝑥 ⊆ 𝑦 ↔ 𝑥 ⊆ ∅))
24	23	raleqbi1dv 2681	. . . . 5 ⊢ (𝑦 = ∅ → (∀𝑥 ∈ 𝑦 𝑥 ⊆ 𝑦 ↔ ∀𝑥 ∈ ∅ 𝑥 ⊆ ∅))
25	24	biimprd 158	. . . 4 ⊢ (𝑦 = ∅ → (∀𝑥 ∈ ∅ 𝑥 ⊆ ∅ → ∀𝑥 ∈ 𝑦 𝑥 ⊆ 𝑦))
26		sseq2 3180	. . . . . 6 ⊢ (𝑦 = 𝑧 → (𝑥 ⊆ 𝑦 ↔ 𝑥 ⊆ 𝑧))
27	26	raleqbi1dv 2681	. . . . 5 ⊢ (𝑦 = 𝑧 → (∀𝑥 ∈ 𝑦 𝑥 ⊆ 𝑦 ↔ ∀𝑥 ∈ 𝑧 𝑥 ⊆ 𝑧))
28	27	biimpd 144	. . . 4 ⊢ (𝑦 = 𝑧 → (∀𝑥 ∈ 𝑦 𝑥 ⊆ 𝑦 → ∀𝑥 ∈ 𝑧 𝑥 ⊆ 𝑧))
29		sseq2 3180	. . . . . 6 ⊢ (𝑦 = suc 𝑧 → (𝑥 ⊆ 𝑦 ↔ 𝑥 ⊆ suc 𝑧))
30	29	raleqbi1dv 2681	. . . . 5 ⊢ (𝑦 = suc 𝑧 → (∀𝑥 ∈ 𝑦 𝑥 ⊆ 𝑦 ↔ ∀𝑥 ∈ suc 𝑧𝑥 ⊆ suc 𝑧))
31	30	biimprd 158	. . . 4 ⊢ (𝑦 = suc 𝑧 → (∀𝑥 ∈ suc 𝑧𝑥 ⊆ suc 𝑧 → ∀𝑥 ∈ 𝑦 𝑥 ⊆ 𝑦))
32		nfcv 2319	. . . 4 ⊢ Ⅎ𝑦𝐴
33		nfv 1528	. . . 4 ⊢ Ⅎ𝑦∀𝑥 ∈ 𝐴 𝑥 ⊆ 𝐴
34		sseq2 3180	. . . . . 6 ⊢ (𝑦 = 𝐴 → (𝑥 ⊆ 𝑦 ↔ 𝑥 ⊆ 𝐴))
35	34	raleqbi1dv 2681	. . . . 5 ⊢ (𝑦 = 𝐴 → (∀𝑥 ∈ 𝑦 𝑥 ⊆ 𝑦 ↔ ∀𝑥 ∈ 𝐴 𝑥 ⊆ 𝐴))
36	35	biimpd 144	. . . 4 ⊢ (𝑦 = 𝐴 → (∀𝑥 ∈ 𝑦 𝑥 ⊆ 𝑦 → ∀𝑥 ∈ 𝐴 𝑥 ⊆ 𝐴))
37	19, 20, 21, 22, 25, 28, 31, 32, 33, 36	bj-bdfindisg 14703	. . 3 ⊢ ((∀𝑥 ∈ ∅ 𝑥 ⊆ ∅ ∧ ∀𝑧 ∈ ω (∀𝑥 ∈ 𝑧 𝑥 ⊆ 𝑧 → ∀𝑥 ∈ suc 𝑧𝑥 ⊆ suc 𝑧)) → (𝐴 ∈ ω → ∀𝑥 ∈ 𝐴 𝑥 ⊆ 𝐴))
38	1, 16, 37	mp2an 426	. 2 ⊢ (𝐴 ∈ ω → ∀𝑥 ∈ 𝐴 𝑥 ⊆ 𝐴)
39		nfv 1528	. . 3 ⊢ Ⅎ𝑥 𝐵 ⊆ 𝐴
40		sseq1 3179	. . 3 ⊢ (𝑥 = 𝐵 → (𝑥 ⊆ 𝐴 ↔ 𝐵 ⊆ 𝐴))
41	39, 40	rspc 2836	. 2 ⊢ (𝐵 ∈ 𝐴 → (∀𝑥 ∈ 𝐴 𝑥 ⊆ 𝐴 → 𝐵 ⊆ 𝐴))
42	38, 41	syl5com 29	1 ⊢ (𝐴 ∈ ω → (𝐵 ∈ 𝐴 → 𝐵 ⊆ 𝐴))

Syntax hints:   → wi 4   ∨ wo 708   = wceq 1353   ∈ wcel 2148  ∀wral 2455   ∪ cun 3128   ⊆ wss 3130  ∅c0 3423  {csn 3593  suc csuc 4366  ωcom 4590

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 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-nul 4130  ax-pr 4210  ax-un 4434  ax-bd0 14568  ax-bdor 14571  ax-bdal 14573  ax-bdex 14574  ax-bdeq 14575  ax-bdel 14576  ax-bdsb 14577  ax-bdsep 14639  ax-infvn 14696

This theorem depends on definitions:  df-bi 117  df-tru 1356  df-nf 1461  df-sb 1763  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ral 2460  df-rex 2461  df-rab 2464  df-v 2740  df-dif 3132  df-un 3134  df-in 3136  df-ss 3143  df-nul 3424  df-sn 3599  df-pr 3600  df-uni 3811  df-int 3846  df-suc 4372  df-iom 4591  df-bdc 14596  df-bj-ind 14682

This theorem is referenced by:  bj-nntrans2  14707  bj-nnelirr  14708  bj-nnen2lp  14709