Theorem dfon2 36177

Description: On consists of all sets that contain all its transitive proper subsets. This definition comes from J. R. Isbell, "A Definition of Ordinal Numbers", American Mathematical Monthly, vol 67 (1960), pp. 51-52. (Contributed by Scott Fenton, 20-Feb-2011.)

Assertion

Ref	Expression
dfon2	⊢ On = {𝑥 ∣ ∀𝑦((𝑦 ⊊ 𝑥 ∧ Tr 𝑦) → 𝑦 ∈ 𝑥)}

Distinct variable group:   𝑥,𝑦

Proof of Theorem dfon2

Dummy variables 𝑧 𝑤 𝑡 𝑢 𝑣 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-on 6361	. 2 ⊢ On = {𝑥 ∣ Ord 𝑥}
2		tz7.7 6383	. . . . . . . . 9 ⊢ ((Ord 𝑥 ∧ Tr 𝑦) → (𝑦 ∈ 𝑥 ↔ (𝑦 ⊆ 𝑥 ∧ 𝑦 ≠ 𝑥)))
3		df-pss 3933	. . . . . . . . 9 ⊢ (𝑦 ⊊ 𝑥 ↔ (𝑦 ⊆ 𝑥 ∧ 𝑦 ≠ 𝑥))
4	2, 3	bitr4di 292	. . . . . . . 8 ⊢ ((Ord 𝑥 ∧ Tr 𝑦) → (𝑦 ∈ 𝑥 ↔ 𝑦 ⊊ 𝑥))
5	4	exbiri 822	. . . . . . 7 ⊢ (Ord 𝑥 → (Tr 𝑦 → (𝑦 ⊊ 𝑥 → 𝑦 ∈ 𝑥)))
6	5	com23 87	. . . . . 6 ⊢ (Ord 𝑥 → (𝑦 ⊊ 𝑥 → (Tr 𝑦 → 𝑦 ∈ 𝑥)))
7	6	impd 415	. . . . 5 ⊢ (Ord 𝑥 → ((𝑦 ⊊ 𝑥 ∧ Tr 𝑦) → 𝑦 ∈ 𝑥))
8	7	alrimiv 1954	. . . 4 ⊢ (Ord 𝑥 → ∀𝑦((𝑦 ⊊ 𝑥 ∧ Tr 𝑦) → 𝑦 ∈ 𝑥))
9		vex 3467	. . . . . . 7 ⊢ 𝑥 ∈ V
10		dfon2lem3 36170	. . . . . . 7 ⊢ (𝑥 ∈ V → (∀𝑦((𝑦 ⊊ 𝑥 ∧ Tr 𝑦) → 𝑦 ∈ 𝑥) → (Tr 𝑥 ∧ ∀𝑧 ∈ 𝑥 ¬ 𝑧 ∈ 𝑧)))
11	9, 10	ax-mp 5	. . . . . 6 ⊢ (∀𝑦((𝑦 ⊊ 𝑥 ∧ Tr 𝑦) → 𝑦 ∈ 𝑥) → (Tr 𝑥 ∧ ∀𝑧 ∈ 𝑥 ¬ 𝑧 ∈ 𝑧))
12	11	simpld 499	. . . . 5 ⊢ (∀𝑦((𝑦 ⊊ 𝑥 ∧ Tr 𝑦) → 𝑦 ∈ 𝑥) → Tr 𝑥)
13	9	dfon2lem7 36174	. . . . . . . 8 ⊢ (∀𝑦((𝑦 ⊊ 𝑥 ∧ Tr 𝑦) → 𝑦 ∈ 𝑥) → (𝑡 ∈ 𝑥 → ∀𝑢((𝑢 ⊊ 𝑡 ∧ Tr 𝑢) → 𝑢 ∈ 𝑡)))
14	13	ralrimiv 3162	. . . . . . 7 ⊢ (∀𝑦((𝑦 ⊊ 𝑥 ∧ Tr 𝑦) → 𝑦 ∈ 𝑥) → ∀𝑡 ∈ 𝑥 ∀𝑢((𝑢 ⊊ 𝑡 ∧ Tr 𝑢) → 𝑢 ∈ 𝑡))
15		dfon2lem9 36176	. . . . . . . 8 ⊢ (∀𝑡 ∈ 𝑥 ∀𝑢((𝑢 ⊊ 𝑡 ∧ Tr 𝑢) → 𝑢 ∈ 𝑡) → E Fr 𝑥)
16		psseq2 4053	. . . . . . . . . . . . . . . 16 ⊢ (𝑡 = 𝑧 → (𝑢 ⊊ 𝑡 ↔ 𝑢 ⊊ 𝑧))
17	16	anbi1d 642	. . . . . . . . . . . . . . 15 ⊢ (𝑡 = 𝑧 → ((𝑢 ⊊ 𝑡 ∧ Tr 𝑢) ↔ (𝑢 ⊊ 𝑧 ∧ Tr 𝑢)))
18		elequ2 2164	. . . . . . . . . . . . . . 15 ⊢ (𝑡 = 𝑧 → (𝑢 ∈ 𝑡 ↔ 𝑢 ∈ 𝑧))
19	17, 18	imbi12d 347	. . . . . . . . . . . . . 14 ⊢ (𝑡 = 𝑧 → (((𝑢 ⊊ 𝑡 ∧ Tr 𝑢) → 𝑢 ∈ 𝑡) ↔ ((𝑢 ⊊ 𝑧 ∧ Tr 𝑢) → 𝑢 ∈ 𝑧)))
20	19	albidv 1947	. . . . . . . . . . . . 13 ⊢ (𝑡 = 𝑧 → (∀𝑢((𝑢 ⊊ 𝑡 ∧ Tr 𝑢) → 𝑢 ∈ 𝑡) ↔ ∀𝑢((𝑢 ⊊ 𝑧 ∧ Tr 𝑢) → 𝑢 ∈ 𝑧)))
21		psseq1 4052	. . . . . . . . . . . . . . . 16 ⊢ (𝑢 = 𝑣 → (𝑢 ⊊ 𝑧 ↔ 𝑣 ⊊ 𝑧))
22		treq 5226	. . . . . . . . . . . . . . . 16 ⊢ (𝑢 = 𝑣 → (Tr 𝑢 ↔ Tr 𝑣))
23	21, 22	anbi12d 643	. . . . . . . . . . . . . . 15 ⊢ (𝑢 = 𝑣 → ((𝑢 ⊊ 𝑧 ∧ Tr 𝑢) ↔ (𝑣 ⊊ 𝑧 ∧ Tr 𝑣)))
24		elequ1 2156	. . . . . . . . . . . . . . 15 ⊢ (𝑢 = 𝑣 → (𝑢 ∈ 𝑧 ↔ 𝑣 ∈ 𝑧))
25	23, 24	imbi12d 347	. . . . . . . . . . . . . 14 ⊢ (𝑢 = 𝑣 → (((𝑢 ⊊ 𝑧 ∧ Tr 𝑢) → 𝑢 ∈ 𝑧) ↔ ((𝑣 ⊊ 𝑧 ∧ Tr 𝑣) → 𝑣 ∈ 𝑧)))
26	25	cbvalvw 2063	. . . . . . . . . . . . 13 ⊢ (∀𝑢((𝑢 ⊊ 𝑧 ∧ Tr 𝑢) → 𝑢 ∈ 𝑧) ↔ ∀𝑣((𝑣 ⊊ 𝑧 ∧ Tr 𝑣) → 𝑣 ∈ 𝑧))
27	20, 26	bitrdi 290	. . . . . . . . . . . 12 ⊢ (𝑡 = 𝑧 → (∀𝑢((𝑢 ⊊ 𝑡 ∧ Tr 𝑢) → 𝑢 ∈ 𝑡) ↔ ∀𝑣((𝑣 ⊊ 𝑧 ∧ Tr 𝑣) → 𝑣 ∈ 𝑧)))
28	27	rspccv 3587	. . . . . . . . . . 11 ⊢ (∀𝑡 ∈ 𝑥 ∀𝑢((𝑢 ⊊ 𝑡 ∧ Tr 𝑢) → 𝑢 ∈ 𝑡) → (𝑧 ∈ 𝑥 → ∀𝑣((𝑣 ⊊ 𝑧 ∧ Tr 𝑣) → 𝑣 ∈ 𝑧)))
29		psseq2 4053	. . . . . . . . . . . . . . . 16 ⊢ (𝑡 = 𝑤 → (𝑢 ⊊ 𝑡 ↔ 𝑢 ⊊ 𝑤))
30	29	anbi1d 642	. . . . . . . . . . . . . . 15 ⊢ (𝑡 = 𝑤 → ((𝑢 ⊊ 𝑡 ∧ Tr 𝑢) ↔ (𝑢 ⊊ 𝑤 ∧ Tr 𝑢)))
31		elequ2 2164	. . . . . . . . . . . . . . 15 ⊢ (𝑡 = 𝑤 → (𝑢 ∈ 𝑡 ↔ 𝑢 ∈ 𝑤))
32	30, 31	imbi12d 347	. . . . . . . . . . . . . 14 ⊢ (𝑡 = 𝑤 → (((𝑢 ⊊ 𝑡 ∧ Tr 𝑢) → 𝑢 ∈ 𝑡) ↔ ((𝑢 ⊊ 𝑤 ∧ Tr 𝑢) → 𝑢 ∈ 𝑤)))
33	32	albidv 1947	. . . . . . . . . . . . 13 ⊢ (𝑡 = 𝑤 → (∀𝑢((𝑢 ⊊ 𝑡 ∧ Tr 𝑢) → 𝑢 ∈ 𝑡) ↔ ∀𝑢((𝑢 ⊊ 𝑤 ∧ Tr 𝑢) → 𝑢 ∈ 𝑤)))
34		psseq1 4052	. . . . . . . . . . . . . . . 16 ⊢ (𝑢 = 𝑦 → (𝑢 ⊊ 𝑤 ↔ 𝑦 ⊊ 𝑤))
35		treq 5226	. . . . . . . . . . . . . . . 16 ⊢ (𝑢 = 𝑦 → (Tr 𝑢 ↔ Tr 𝑦))
36	34, 35	anbi12d 643	. . . . . . . . . . . . . . 15 ⊢ (𝑢 = 𝑦 → ((𝑢 ⊊ 𝑤 ∧ Tr 𝑢) ↔ (𝑦 ⊊ 𝑤 ∧ Tr 𝑦)))
37		elequ1 2156	. . . . . . . . . . . . . . 15 ⊢ (𝑢 = 𝑦 → (𝑢 ∈ 𝑤 ↔ 𝑦 ∈ 𝑤))
38	36, 37	imbi12d 347	. . . . . . . . . . . . . 14 ⊢ (𝑢 = 𝑦 → (((𝑢 ⊊ 𝑤 ∧ Tr 𝑢) → 𝑢 ∈ 𝑤) ↔ ((𝑦 ⊊ 𝑤 ∧ Tr 𝑦) → 𝑦 ∈ 𝑤)))
39	38	cbvalvw 2063	. . . . . . . . . . . . 13 ⊢ (∀𝑢((𝑢 ⊊ 𝑤 ∧ Tr 𝑢) → 𝑢 ∈ 𝑤) ↔ ∀𝑦((𝑦 ⊊ 𝑤 ∧ Tr 𝑦) → 𝑦 ∈ 𝑤))
40	33, 39	bitrdi 290	. . . . . . . . . . . 12 ⊢ (𝑡 = 𝑤 → (∀𝑢((𝑢 ⊊ 𝑡 ∧ Tr 𝑢) → 𝑢 ∈ 𝑡) ↔ ∀𝑦((𝑦 ⊊ 𝑤 ∧ Tr 𝑦) → 𝑦 ∈ 𝑤)))
41	40	rspccv 3587	. . . . . . . . . . 11 ⊢ (∀𝑡 ∈ 𝑥 ∀𝑢((𝑢 ⊊ 𝑡 ∧ Tr 𝑢) → 𝑢 ∈ 𝑡) → (𝑤 ∈ 𝑥 → ∀𝑦((𝑦 ⊊ 𝑤 ∧ Tr 𝑦) → 𝑦 ∈ 𝑤)))
42	28, 41	anim12d 620	. . . . . . . . . 10 ⊢ (∀𝑡 ∈ 𝑥 ∀𝑢((𝑢 ⊊ 𝑡 ∧ Tr 𝑢) → 𝑢 ∈ 𝑡) → ((𝑧 ∈ 𝑥 ∧ 𝑤 ∈ 𝑥) → (∀𝑣((𝑣 ⊊ 𝑧 ∧ Tr 𝑣) → 𝑣 ∈ 𝑧) ∧ ∀𝑦((𝑦 ⊊ 𝑤 ∧ Tr 𝑦) → 𝑦 ∈ 𝑤))))
43		vex 3467	. . . . . . . . . . 11 ⊢ 𝑧 ∈ V
44		vex 3467	. . . . . . . . . . 11 ⊢ 𝑤 ∈ V
45	43, 44	dfon2lem5 36172	. . . . . . . . . 10 ⊢ ((∀𝑣((𝑣 ⊊ 𝑧 ∧ Tr 𝑣) → 𝑣 ∈ 𝑧) ∧ ∀𝑦((𝑦 ⊊ 𝑤 ∧ Tr 𝑦) → 𝑦 ∈ 𝑤)) → (𝑧 ∈ 𝑤 ∨ 𝑧 = 𝑤 ∨ 𝑤 ∈ 𝑧))
46	42, 45	syl6 36	. . . . . . . . 9 ⊢ (∀𝑡 ∈ 𝑥 ∀𝑢((𝑢 ⊊ 𝑡 ∧ Tr 𝑢) → 𝑢 ∈ 𝑡) → ((𝑧 ∈ 𝑥 ∧ 𝑤 ∈ 𝑥) → (𝑧 ∈ 𝑤 ∨ 𝑧 = 𝑤 ∨ 𝑤 ∈ 𝑧)))
47	46	ralrimivv 3212	. . . . . . . 8 ⊢ (∀𝑡 ∈ 𝑥 ∀𝑢((𝑢 ⊊ 𝑡 ∧ Tr 𝑢) → 𝑢 ∈ 𝑡) → ∀𝑧 ∈ 𝑥 ∀𝑤 ∈ 𝑥 (𝑧 ∈ 𝑤 ∨ 𝑧 = 𝑤 ∨ 𝑤 ∈ 𝑧))
48	15, 47	jca 520	. . . . . . 7 ⊢ (∀𝑡 ∈ 𝑥 ∀𝑢((𝑢 ⊊ 𝑡 ∧ Tr 𝑢) → 𝑢 ∈ 𝑡) → ( E Fr 𝑥 ∧ ∀𝑧 ∈ 𝑥 ∀𝑤 ∈ 𝑥 (𝑧 ∈ 𝑤 ∨ 𝑧 = 𝑤 ∨ 𝑤 ∈ 𝑧)))
49	14, 48	syl 18	. . . . . 6 ⊢ (∀𝑦((𝑦 ⊊ 𝑥 ∧ Tr 𝑦) → 𝑦 ∈ 𝑥) → ( E Fr 𝑥 ∧ ∀𝑧 ∈ 𝑥 ∀𝑤 ∈ 𝑥 (𝑧 ∈ 𝑤 ∨ 𝑧 = 𝑤 ∨ 𝑤 ∈ 𝑧)))
50		dfwe2 7769	. . . . . . 7 ⊢ ( E We 𝑥 ↔ ( E Fr 𝑥 ∧ ∀𝑧 ∈ 𝑥 ∀𝑤 ∈ 𝑥 (𝑧 E 𝑤 ∨ 𝑧 = 𝑤 ∨ 𝑤 E 𝑧)))
51		epel 5562	. . . . . . . . . 10 ⊢ (𝑧 E 𝑤 ↔ 𝑧 ∈ 𝑤)
52		biid 264	. . . . . . . . . 10 ⊢ (𝑧 = 𝑤 ↔ 𝑧 = 𝑤)
53		epel 5562	. . . . . . . . . 10 ⊢ (𝑤 E 𝑧 ↔ 𝑤 ∈ 𝑧)
54	51, 52, 53	3orbi123i 1172	. . . . . . . . 9 ⊢ ((𝑧 E 𝑤 ∨ 𝑧 = 𝑤 ∨ 𝑤 E 𝑧) ↔ (𝑧 ∈ 𝑤 ∨ 𝑧 = 𝑤 ∨ 𝑤 ∈ 𝑧))
55	54	2ralbii 3146	. . . . . . . 8 ⊢ (∀𝑧 ∈ 𝑥 ∀𝑤 ∈ 𝑥 (𝑧 E 𝑤 ∨ 𝑧 = 𝑤 ∨ 𝑤 E 𝑧) ↔ ∀𝑧 ∈ 𝑥 ∀𝑤 ∈ 𝑥 (𝑧 ∈ 𝑤 ∨ 𝑧 = 𝑤 ∨ 𝑤 ∈ 𝑧))
56	55	anbi2i 634	. . . . . . 7 ⊢ (( E Fr 𝑥 ∧ ∀𝑧 ∈ 𝑥 ∀𝑤 ∈ 𝑥 (𝑧 E 𝑤 ∨ 𝑧 = 𝑤 ∨ 𝑤 E 𝑧)) ↔ ( E Fr 𝑥 ∧ ∀𝑧 ∈ 𝑥 ∀𝑤 ∈ 𝑥 (𝑧 ∈ 𝑤 ∨ 𝑧 = 𝑤 ∨ 𝑤 ∈ 𝑧)))
57	50, 56	bitri 278	. . . . . 6 ⊢ ( E We 𝑥 ↔ ( E Fr 𝑥 ∧ ∀𝑧 ∈ 𝑥 ∀𝑤 ∈ 𝑥 (𝑧 ∈ 𝑤 ∨ 𝑧 = 𝑤 ∨ 𝑤 ∈ 𝑧)))
58	49, 57	sylibr 237	. . . . 5 ⊢ (∀𝑦((𝑦 ⊊ 𝑥 ∧ Tr 𝑦) → 𝑦 ∈ 𝑥) → E We 𝑥)
59		df-ord 6360	. . . . 5 ⊢ (Ord 𝑥 ↔ (Tr 𝑥 ∧ E We 𝑥))
60	12, 58, 59	sylanbrc 594	. . . 4 ⊢ (∀𝑦((𝑦 ⊊ 𝑥 ∧ Tr 𝑦) → 𝑦 ∈ 𝑥) → Ord 𝑥)
61	8, 60	impbii 212	. . 3 ⊢ (Ord 𝑥 ↔ ∀𝑦((𝑦 ⊊ 𝑥 ∧ Tr 𝑦) → 𝑦 ∈ 𝑥))
62	61	abbii 2836	. 2 ⊢ {𝑥 ∣ Ord 𝑥} = {𝑥 ∣ ∀𝑦((𝑦 ⊊ 𝑥 ∧ Tr 𝑦) → 𝑦 ∈ 𝑥)}
63	1, 62	eqtri 2792	1 ⊢ On = {𝑥 ∣ ∀𝑦((𝑦 ⊊ 𝑥 ∧ Tr 𝑦) → 𝑦 ∈ 𝑥)}

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 400   ∨ w3o 1100  ∀wal 1565   = wceq 1567   ∈ wcel 2149  {cab 2747   ≠ wne 2964  ∀wral 3085  Vcvv 3463   ⊆ wss 3913   ⊊ wpss 3914   class class class wbr 5110  Tr wtr 5219   E cep 5558   Fr wfr 5609   We wwe 5611  Ord word 6356  Oncon0 6357

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-sep 5258  ax-pr 5402  ax-un 7730

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-ral 3086  df-rex 3096  df-rab 3424  df-v 3465  df-sbc 3754  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-pss 3933  df-nul 4295  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-tp 4596  df-op 4598  df-uni 4874  df-int 4914  df-iun 4959  df-iin 4960  df-br 5111  df-opab 5175  df-tr 5220  df-eprel 5559  df-po 5567  df-so 5568  df-fr 5612  df-we 5614  df-ord 6360  df-on 6361  df-suc 6363

This theorem is referenced by:  dfon3  36277