Theorem oismo 8328

Description: When 𝐴 is a subclass of On, 𝐹 is a strictly monotone ordinal functions, and it is also complete (it is an isomorphism onto all of 𝐴). The proof avoids ax-rep 4699 (the second statement is trivial under ax-rep 4699). (Contributed by Mario Carneiro, 26-Jun-2015.)

Hypothesis

Ref	Expression
oismo.1	⊢ 𝐹 = OrdIso( E , 𝐴)

Assertion

Ref	Expression
oismo	⊢ (𝐴 ⊆ On → (Smo 𝐹 ∧ ran 𝐹 = 𝐴))

Proof of Theorem oismo

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

Step	Hyp	Ref	Expression
1		epweon 6875	. . . . . 6 ⊢ E We On
2		wess 5025	. . . . . 6 ⊢ (𝐴 ⊆ On → ( E We On → E We 𝐴))
3	1, 2	mpi 20	. . . . 5 ⊢ (𝐴 ⊆ On → E We 𝐴)
4		epse 5021	. . . . 5 ⊢ E Se 𝐴
5		oismo.1	. . . . . 6 ⊢ 𝐹 = OrdIso( E , 𝐴)
6	5	oiiso2 8319	. . . . 5 ⊢ (( E We 𝐴 ∧ E Se 𝐴) → 𝐹 Isom E , E (dom 𝐹, ran 𝐹))
7	3, 4, 6	sylancl 693	. . . 4 ⊢ (𝐴 ⊆ On → 𝐹 Isom E , E (dom 𝐹, ran 𝐹))
8	5	oicl 8317	. . . . 5 ⊢ Ord dom 𝐹
9	5	oif 8318	. . . . . . 7 ⊢ 𝐹:dom 𝐹⟶𝐴
10		frn 5966	. . . . . . 7 ⊢ (𝐹:dom 𝐹⟶𝐴 → ran 𝐹 ⊆ 𝐴)
11	9, 10	ax-mp 5	. . . . . 6 ⊢ ran 𝐹 ⊆ 𝐴
12		id 22	. . . . . 6 ⊢ (𝐴 ⊆ On → 𝐴 ⊆ On)
13	11, 12	syl5ss 3579	. . . . 5 ⊢ (𝐴 ⊆ On → ran 𝐹 ⊆ On)
14		smoiso2 7353	. . . . 5 ⊢ ((Ord dom 𝐹 ∧ ran 𝐹 ⊆ On) → ((𝐹:dom 𝐹–onto→ran 𝐹 ∧ Smo 𝐹) ↔ 𝐹 Isom E , E (dom 𝐹, ran 𝐹)))
15	8, 13, 14	sylancr 694	. . . 4 ⊢ (𝐴 ⊆ On → ((𝐹:dom 𝐹–onto→ran 𝐹 ∧ Smo 𝐹) ↔ 𝐹 Isom E , E (dom 𝐹, ran 𝐹)))
16	7, 15	mpbird 246	. . 3 ⊢ (𝐴 ⊆ On → (𝐹:dom 𝐹–onto→ran 𝐹 ∧ Smo 𝐹))
17	16	simprd 478	. 2 ⊢ (𝐴 ⊆ On → Smo 𝐹)
18	11	a1i 11	. . 3 ⊢ (𝐴 ⊆ On → ran 𝐹 ⊆ 𝐴)
19		simprl 790	. . . . . . . 8 ⊢ ((𝐴 ⊆ On ∧ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ ran 𝐹)) → 𝑥 ∈ 𝐴)
20	3	adantr 480	. . . . . . . . . 10 ⊢ ((𝐴 ⊆ On ∧ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ ran 𝐹)) → E We 𝐴)
21	4	a1i 11	. . . . . . . . . 10 ⊢ ((𝐴 ⊆ On ∧ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ ran 𝐹)) → E Se 𝐴)
22		ffn 5958	. . . . . . . . . . . . 13 ⊢ (𝐹:dom 𝐹⟶𝐴 → 𝐹 Fn dom 𝐹)
23	9, 22	mp1i 13	. . . . . . . . . . . 12 ⊢ ((𝐴 ⊆ On ∧ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ ran 𝐹)) → 𝐹 Fn dom 𝐹)
24		simplrr 797	. . . . . . . . . . . . . . 15 ⊢ (((𝐴 ⊆ On ∧ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ ran 𝐹)) ∧ 𝑦 ∈ dom 𝐹) → ¬ 𝑥 ∈ ran 𝐹)
25	3	ad2antrr 758	. . . . . . . . . . . . . . . . 17 ⊢ (((𝐴 ⊆ On ∧ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ ran 𝐹)) ∧ 𝑦 ∈ dom 𝐹) → E We 𝐴)
26	4	a1i 11	. . . . . . . . . . . . . . . . 17 ⊢ (((𝐴 ⊆ On ∧ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ ran 𝐹)) ∧ 𝑦 ∈ dom 𝐹) → E Se 𝐴)
27		simplrl 796	. . . . . . . . . . . . . . . . 17 ⊢ (((𝐴 ⊆ On ∧ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ ran 𝐹)) ∧ 𝑦 ∈ dom 𝐹) → 𝑥 ∈ 𝐴)
28		simpr 476	. . . . . . . . . . . . . . . . 17 ⊢ (((𝐴 ⊆ On ∧ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ ran 𝐹)) ∧ 𝑦 ∈ dom 𝐹) → 𝑦 ∈ dom 𝐹)
29	5	oiiniseg 8321	. . . . . . . . . . . . . . . . 17 ⊢ ((( E We 𝐴 ∧ E Se 𝐴) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ dom 𝐹)) → ((𝐹‘𝑦) E 𝑥 ∨ 𝑥 ∈ ran 𝐹))
30	25, 26, 27, 28, 29	syl22anc 1319	. . . . . . . . . . . . . . . 16 ⊢ (((𝐴 ⊆ On ∧ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ ran 𝐹)) ∧ 𝑦 ∈ dom 𝐹) → ((𝐹‘𝑦) E 𝑥 ∨ 𝑥 ∈ ran 𝐹))
31	30	ord 391	. . . . . . . . . . . . . . 15 ⊢ (((𝐴 ⊆ On ∧ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ ran 𝐹)) ∧ 𝑦 ∈ dom 𝐹) → (¬ (𝐹‘𝑦) E 𝑥 → 𝑥 ∈ ran 𝐹))
32	24, 31	mt3d 139	. . . . . . . . . . . . . 14 ⊢ (((𝐴 ⊆ On ∧ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ ran 𝐹)) ∧ 𝑦 ∈ dom 𝐹) → (𝐹‘𝑦) E 𝑥)
33		vex 3176	. . . . . . . . . . . . . . 15 ⊢ 𝑥 ∈ V
34	33	epelc 4951	. . . . . . . . . . . . . 14 ⊢ ((𝐹‘𝑦) E 𝑥 ↔ (𝐹‘𝑦) ∈ 𝑥)
35	32, 34	sylib 207	. . . . . . . . . . . . 13 ⊢ (((𝐴 ⊆ On ∧ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ ran 𝐹)) ∧ 𝑦 ∈ dom 𝐹) → (𝐹‘𝑦) ∈ 𝑥)
36	35	ralrimiva 2949	. . . . . . . . . . . 12 ⊢ ((𝐴 ⊆ On ∧ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ ran 𝐹)) → ∀𝑦 ∈ dom 𝐹(𝐹‘𝑦) ∈ 𝑥)
37		ffnfv 6295	. . . . . . . . . . . 12 ⊢ (𝐹:dom 𝐹⟶𝑥 ↔ (𝐹 Fn dom 𝐹 ∧ ∀𝑦 ∈ dom 𝐹(𝐹‘𝑦) ∈ 𝑥))
38	23, 36, 37	sylanbrc 695	. . . . . . . . . . 11 ⊢ ((𝐴 ⊆ On ∧ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ ran 𝐹)) → 𝐹:dom 𝐹⟶𝑥)
39	9, 22	mp1i 13	. . . . . . . . . . . . . . . 16 ⊢ (((𝐴 ⊆ On ∧ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ ran 𝐹)) ∧ 𝑦 ∈ dom 𝐹) → 𝐹 Fn dom 𝐹)
40	17	ad2antrr 758	. . . . . . . . . . . . . . . 16 ⊢ (((𝐴 ⊆ On ∧ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ ran 𝐹)) ∧ 𝑦 ∈ dom 𝐹) → Smo 𝐹)
41		smogt 7351	. . . . . . . . . . . . . . . 16 ⊢ ((𝐹 Fn dom 𝐹 ∧ Smo 𝐹 ∧ 𝑦 ∈ dom 𝐹) → 𝑦 ⊆ (𝐹‘𝑦))
42	39, 40, 28, 41	syl3anc 1318	. . . . . . . . . . . . . . 15 ⊢ (((𝐴 ⊆ On ∧ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ ran 𝐹)) ∧ 𝑦 ∈ dom 𝐹) → 𝑦 ⊆ (𝐹‘𝑦))
43		ordelon 5664	. . . . . . . . . . . . . . . . 17 ⊢ ((Ord dom 𝐹 ∧ 𝑦 ∈ dom 𝐹) → 𝑦 ∈ On)
44	8, 28, 43	sylancr 694	. . . . . . . . . . . . . . . 16 ⊢ (((𝐴 ⊆ On ∧ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ ran 𝐹)) ∧ 𝑦 ∈ dom 𝐹) → 𝑦 ∈ On)
45		simpll 786	. . . . . . . . . . . . . . . . 17 ⊢ (((𝐴 ⊆ On ∧ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ ran 𝐹)) ∧ 𝑦 ∈ dom 𝐹) → 𝐴 ⊆ On)
46	45, 27	sseldd 3569	. . . . . . . . . . . . . . . 16 ⊢ (((𝐴 ⊆ On ∧ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ ran 𝐹)) ∧ 𝑦 ∈ dom 𝐹) → 𝑥 ∈ On)
47		ontr2 5689	. . . . . . . . . . . . . . . 16 ⊢ ((𝑦 ∈ On ∧ 𝑥 ∈ On) → ((𝑦 ⊆ (𝐹‘𝑦) ∧ (𝐹‘𝑦) ∈ 𝑥) → 𝑦 ∈ 𝑥))
48	44, 46, 47	syl2anc 691	. . . . . . . . . . . . . . 15 ⊢ (((𝐴 ⊆ On ∧ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ ran 𝐹)) ∧ 𝑦 ∈ dom 𝐹) → ((𝑦 ⊆ (𝐹‘𝑦) ∧ (𝐹‘𝑦) ∈ 𝑥) → 𝑦 ∈ 𝑥))
49	42, 35, 48	mp2and 711	. . . . . . . . . . . . . 14 ⊢ (((𝐴 ⊆ On ∧ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ ran 𝐹)) ∧ 𝑦 ∈ dom 𝐹) → 𝑦 ∈ 𝑥)
50	49	ex 449	. . . . . . . . . . . . 13 ⊢ ((𝐴 ⊆ On ∧ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ ran 𝐹)) → (𝑦 ∈ dom 𝐹 → 𝑦 ∈ 𝑥))
51	50	ssrdv 3574	. . . . . . . . . . . 12 ⊢ ((𝐴 ⊆ On ∧ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ ran 𝐹)) → dom 𝐹 ⊆ 𝑥)
52	19, 51	ssexd 4733	. . . . . . . . . . 11 ⊢ ((𝐴 ⊆ On ∧ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ ran 𝐹)) → dom 𝐹 ∈ V)
53		fex2 7014	. . . . . . . . . . 11 ⊢ ((𝐹:dom 𝐹⟶𝑥 ∧ dom 𝐹 ∈ V ∧ 𝑥 ∈ 𝐴) → 𝐹 ∈ V)
54	38, 52, 19, 53	syl3anc 1318	. . . . . . . . . 10 ⊢ ((𝐴 ⊆ On ∧ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ ran 𝐹)) → 𝐹 ∈ V)
55	5	ordtype2 8322	. . . . . . . . . 10 ⊢ (( E We 𝐴 ∧ E Se 𝐴 ∧ 𝐹 ∈ V) → 𝐹 Isom E , E (dom 𝐹, 𝐴))
56	20, 21, 54, 55	syl3anc 1318	. . . . . . . . 9 ⊢ ((𝐴 ⊆ On ∧ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ ran 𝐹)) → 𝐹 Isom E , E (dom 𝐹, 𝐴))
57		isof1o 6473	. . . . . . . . 9 ⊢ (𝐹 Isom E , E (dom 𝐹, 𝐴) → 𝐹:dom 𝐹–1-1-onto→𝐴)
58		f1ofo 6057	. . . . . . . . 9 ⊢ (𝐹:dom 𝐹–1-1-onto→𝐴 → 𝐹:dom 𝐹–onto→𝐴)
59		forn 6031	. . . . . . . . 9 ⊢ (𝐹:dom 𝐹–onto→𝐴 → ran 𝐹 = 𝐴)
60	56, 57, 58, 59	4syl 19	. . . . . . . 8 ⊢ ((𝐴 ⊆ On ∧ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ ran 𝐹)) → ran 𝐹 = 𝐴)
61	19, 60	eleqtrrd 2691	. . . . . . 7 ⊢ ((𝐴 ⊆ On ∧ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ ran 𝐹)) → 𝑥 ∈ ran 𝐹)
62	61	expr 641	. . . . . 6 ⊢ ((𝐴 ⊆ On ∧ 𝑥 ∈ 𝐴) → (¬ 𝑥 ∈ ran 𝐹 → 𝑥 ∈ ran 𝐹))
63	62	pm2.18d 123	. . . . 5 ⊢ ((𝐴 ⊆ On ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ ran 𝐹)
64	63	ex 449	. . . 4 ⊢ (𝐴 ⊆ On → (𝑥 ∈ 𝐴 → 𝑥 ∈ ran 𝐹))
65	64	ssrdv 3574	. . 3 ⊢ (𝐴 ⊆ On → 𝐴 ⊆ ran 𝐹)
66	18, 65	eqssd 3585	. 2 ⊢ (𝐴 ⊆ On → ran 𝐹 = 𝐴)
67	17, 66	jca 553	1 ⊢ (𝐴 ⊆ On → (Smo 𝐹 ∧ ran 𝐹 = 𝐴))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 195   ∨ wo 382   ∧ wa 383   = wceq 1475   ∈ wcel 1977  ∀wral 2896  Vcvv 3173   ⊆ wss 3540   class class class wbr 4583   E cep 4947   Se wse 4995   We wwe 4996  dom cdm 5038  ran crn 5039  Ord word 5639  Oncon0 5640   Fn wfn 5799  ⟶wf 5800  –onto→wfo 5802  –1-1-onto→wf1o 5803  ‘cfv 5804   Isom wiso 5805  Smo wsmo 7329  OrdIsocoi 8297

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847

This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3or 1032  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-ral 2901  df-rex 2902  df-reu 2903  df-rmo 2904  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-pss 3556  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-tp 4130  df-op 4132  df-uni 4373  df-iun 4457  df-br 4584  df-opab 4644  df-mpt 4645  df-tr 4681  df-eprel 4949  df-id 4953  df-po 4959  df-so 4960  df-fr 4997  df-se 4998  df-we 4999  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-pred 5597  df-ord 5643  df-on 5644  df-lim 5645  df-suc 5646  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-isom 5813  df-riota 6511  df-wrecs 7294  df-smo 7330  df-recs 7355  df-oi 8298

This theorem is referenced by:  oiid  8329  hsmexlem1  9131  hsmexlem2  9132