Theorem oismo 9500

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 5237 (the second statement is trivial under ax-rep 5237). (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 7772	. . . . . 6 ⊢ E We On
2		wess 5646	. . . . . 6 ⊢ (𝐴 ⊆ On → ( E We On → E We 𝐴))
3	1, 2	mpi 21	. . . . 5 ⊢ (𝐴 ⊆ On → E We 𝐴)
4		epse 5642	. . . . 5 ⊢ E Se 𝐴
5		oismo.1	. . . . . 6 ⊢ 𝐹 = OrdIso( E , 𝐴)
6	5	oiiso2 9491	. . . . 5 ⊢ (( E We 𝐴 ∧ E Se 𝐴) → 𝐹 Isom E , E (dom 𝐹, ran 𝐹))
7	3, 4, 6	sylancl 597	. . . 4 ⊢ (𝐴 ⊆ On → 𝐹 Isom E , E (dom 𝐹, ran 𝐹))
8	5	oicl 9489	. . . . 5 ⊢ Ord dom 𝐹
9	5	oif 9490	. . . . . . 7 ⊢ 𝐹:dom 𝐹⟶𝐴
10		frn 6713	. . . . . . 7 ⊢ (𝐹:dom 𝐹⟶𝐴 → ran 𝐹 ⊆ 𝐴)
11	9, 10	ax-mp 5	. . . . . 6 ⊢ ran 𝐹 ⊆ 𝐴
12		id 23	. . . . . 6 ⊢ (𝐴 ⊆ On → 𝐴 ⊆ On)
13	11, 12	sstrid 3947	. . . . 5 ⊢ (𝐴 ⊆ On → ran 𝐹 ⊆ On)
14		smoiso2 8354	. . . . 5 ⊢ ((Ord dom 𝐹 ∧ ran 𝐹 ⊆ On) → ((𝐹:dom 𝐹–onto→ran 𝐹 ∧ Smo 𝐹) ↔ 𝐹 Isom E , E (dom 𝐹, ran 𝐹)))
15	8, 13, 14	sylancr 598	. . . 4 ⊢ (𝐴 ⊆ On → ((𝐹:dom 𝐹–onto→ran 𝐹 ∧ Smo 𝐹) ↔ 𝐹 Isom E , E (dom 𝐹, ran 𝐹)))
16	7, 15	mpbird 260	. . 3 ⊢ (𝐴 ⊆ On → (𝐹:dom 𝐹–onto→ran 𝐹 ∧ Smo 𝐹))
17	16	simprd 500	. 2 ⊢ (𝐴 ⊆ On → Smo 𝐹)
18	11	a1i 11	. . 3 ⊢ (𝐴 ⊆ On → ran 𝐹 ⊆ 𝐴)
19		simprl 782	. . . . . 6 ⊢ ((𝐴 ⊆ On ∧ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ ran 𝐹)) → 𝑥 ∈ 𝐴)
20	3	adantr 485	. . . . . . . 8 ⊢ ((𝐴 ⊆ On ∧ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ ran 𝐹)) → E We 𝐴)
21	4	a1i 11	. . . . . . . 8 ⊢ ((𝐴 ⊆ On ∧ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ ran 𝐹)) → E Se 𝐴)
22		ffn 6705	. . . . . . . . . . 11 ⊢ (𝐹:dom 𝐹⟶𝐴 → 𝐹 Fn dom 𝐹)
23	9, 22	mp1i 14	. . . . . . . . . 10 ⊢ ((𝐴 ⊆ On ∧ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ ran 𝐹)) → 𝐹 Fn dom 𝐹)
24		simplrr 789	. . . . . . . . . . . . 13 ⊢ (((𝐴 ⊆ On ∧ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ ran 𝐹)) ∧ 𝑦 ∈ dom 𝐹) → ¬ 𝑥 ∈ ran 𝐹)
25	3	ad2antrr 738	. . . . . . . . . . . . . . 15 ⊢ (((𝐴 ⊆ On ∧ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ ran 𝐹)) ∧ 𝑦 ∈ dom 𝐹) → E We 𝐴)
26	4	a1i 11	. . . . . . . . . . . . . . 15 ⊢ (((𝐴 ⊆ On ∧ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ ran 𝐹)) ∧ 𝑦 ∈ dom 𝐹) → E Se 𝐴)
27		simplrl 788	. . . . . . . . . . . . . . 15 ⊢ (((𝐴 ⊆ On ∧ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ ran 𝐹)) ∧ 𝑦 ∈ dom 𝐹) → 𝑥 ∈ 𝐴)
28		simpr 489	. . . . . . . . . . . . . . 15 ⊢ (((𝐴 ⊆ On ∧ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ ran 𝐹)) ∧ 𝑦 ∈ dom 𝐹) → 𝑦 ∈ dom 𝐹)
29	5	oiiniseg 9493	. . . . . . . . . . . . . . 15 ⊢ ((( E We 𝐴 ∧ E Se 𝐴) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ dom 𝐹)) → ((𝐹‘𝑦) E 𝑥 ∨ 𝑥 ∈ ran 𝐹))
30	25, 26, 27, 28, 29	syl22anc 851	. . . . . . . . . . . . . 14 ⊢ (((𝐴 ⊆ On ∧ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ ran 𝐹)) ∧ 𝑦 ∈ dom 𝐹) → ((𝐹‘𝑦) E 𝑥 ∨ 𝑥 ∈ ran 𝐹))
31	30	ord 877	. . . . . . . . . . . . 13 ⊢ (((𝐴 ⊆ On ∧ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ ran 𝐹)) ∧ 𝑦 ∈ dom 𝐹) → (¬ (𝐹‘𝑦) E 𝑥 → 𝑥 ∈ ran 𝐹))
32	24, 31	mt3d 149	. . . . . . . . . . . 12 ⊢ (((𝐴 ⊆ On ∧ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ ran 𝐹)) ∧ 𝑦 ∈ dom 𝐹) → (𝐹‘𝑦) E 𝑥)
33		epel 5563	. . . . . . . . . . . 12 ⊢ ((𝐹‘𝑦) E 𝑥 ↔ (𝐹‘𝑦) ∈ 𝑥)
34	32, 33	sylib 221	. . . . . . . . . . 11 ⊢ (((𝐴 ⊆ On ∧ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ ran 𝐹)) ∧ 𝑦 ∈ dom 𝐹) → (𝐹‘𝑦) ∈ 𝑥)
35	34	ralrimiva 3156	. . . . . . . . . 10 ⊢ ((𝐴 ⊆ On ∧ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ ran 𝐹)) → ∀𝑦 ∈ dom 𝐹(𝐹‘𝑦) ∈ 𝑥)
36		ffnfv 7114	. . . . . . . . . 10 ⊢ (𝐹:dom 𝐹⟶𝑥 ↔ (𝐹 Fn dom 𝐹 ∧ ∀𝑦 ∈ dom 𝐹(𝐹‘𝑦) ∈ 𝑥))
37	23, 35, 36	sylanbrc 594	. . . . . . . . 9 ⊢ ((𝐴 ⊆ On ∧ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ ran 𝐹)) → 𝐹:dom 𝐹⟶𝑥)
38	9, 22	mp1i 14	. . . . . . . . . . . . . 14 ⊢ (((𝐴 ⊆ On ∧ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ ran 𝐹)) ∧ 𝑦 ∈ dom 𝐹) → 𝐹 Fn dom 𝐹)
39	17	ad2antrr 738	. . . . . . . . . . . . . 14 ⊢ (((𝐴 ⊆ On ∧ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ ran 𝐹)) ∧ 𝑦 ∈ dom 𝐹) → Smo 𝐹)
40		smogt 8352	. . . . . . . . . . . . . 14 ⊢ ((𝐹 Fn dom 𝐹 ∧ Smo 𝐹 ∧ 𝑦 ∈ dom 𝐹) → 𝑦 ⊆ (𝐹‘𝑦))
41	38, 39, 28, 40	syl3anc 1397	. . . . . . . . . . . . 13 ⊢ (((𝐴 ⊆ On ∧ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ ran 𝐹)) ∧ 𝑦 ∈ dom 𝐹) → 𝑦 ⊆ (𝐹‘𝑦))
42		ordelon 6384	. . . . . . . . . . . . . . 15 ⊢ ((Ord dom 𝐹 ∧ 𝑦 ∈ dom 𝐹) → 𝑦 ∈ On)
43	8, 28, 42	sylancr 598	. . . . . . . . . . . . . 14 ⊢ (((𝐴 ⊆ On ∧ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ ran 𝐹)) ∧ 𝑦 ∈ dom 𝐹) → 𝑦 ∈ On)
44		simpll 778	. . . . . . . . . . . . . . 15 ⊢ (((𝐴 ⊆ On ∧ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ ran 𝐹)) ∧ 𝑦 ∈ dom 𝐹) → 𝐴 ⊆ On)
45	44, 27	sseldd 3937	. . . . . . . . . . . . . 14 ⊢ (((𝐴 ⊆ On ∧ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ ran 𝐹)) ∧ 𝑦 ∈ dom 𝐹) → 𝑥 ∈ On)
46		ontr2 6409	. . . . . . . . . . . . . 14 ⊢ ((𝑦 ∈ On ∧ 𝑥 ∈ On) → ((𝑦 ⊆ (𝐹‘𝑦) ∧ (𝐹‘𝑦) ∈ 𝑥) → 𝑦 ∈ 𝑥))
47	43, 45, 46	syl2anc 595	. . . . . . . . . . . . 13 ⊢ (((𝐴 ⊆ On ∧ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ ran 𝐹)) ∧ 𝑦 ∈ dom 𝐹) → ((𝑦 ⊆ (𝐹‘𝑦) ∧ (𝐹‘𝑦) ∈ 𝑥) → 𝑦 ∈ 𝑥))
48	41, 34, 47	mp2and 711	. . . . . . . . . . . 12 ⊢ (((𝐴 ⊆ On ∧ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ ran 𝐹)) ∧ 𝑦 ∈ dom 𝐹) → 𝑦 ∈ 𝑥)
49	48	ex 417	. . . . . . . . . . 11 ⊢ ((𝐴 ⊆ On ∧ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ ran 𝐹)) → (𝑦 ∈ dom 𝐹 → 𝑦 ∈ 𝑥))
50	49	ssrdv 3942	. . . . . . . . . 10 ⊢ ((𝐴 ⊆ On ∧ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ ran 𝐹)) → dom 𝐹 ⊆ 𝑥)
51	19, 50	ssexd 5294	. . . . . . . . 9 ⊢ ((𝐴 ⊆ On ∧ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ ran 𝐹)) → dom 𝐹 ∈ V)
52		fex2 7931	. . . . . . . . 9 ⊢ ((𝐹:dom 𝐹⟶𝑥 ∧ dom 𝐹 ∈ V ∧ 𝑥 ∈ 𝐴) → 𝐹 ∈ V)
53	37, 51, 19, 52	syl3anc 1397	. . . . . . . 8 ⊢ ((𝐴 ⊆ On ∧ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ ran 𝐹)) → 𝐹 ∈ V)
54	5	ordtype2 9494	. . . . . . . 8 ⊢ (( E We 𝐴 ∧ E Se 𝐴 ∧ 𝐹 ∈ V) → 𝐹 Isom E , E (dom 𝐹, 𝐴))
55	20, 21, 53, 54	syl3anc 1397	. . . . . . 7 ⊢ ((𝐴 ⊆ On ∧ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ ran 𝐹)) → 𝐹 Isom E , E (dom 𝐹, 𝐴))
56		isof1o 7321	. . . . . . 7 ⊢ (𝐹 Isom E , E (dom 𝐹, 𝐴) → 𝐹:dom 𝐹–1-1-onto→𝐴)
57		f1ofo 6828	. . . . . . 7 ⊢ (𝐹:dom 𝐹–1-1-onto→𝐴 → 𝐹:dom 𝐹–onto→𝐴)
58		forn 6795	. . . . . . 7 ⊢ (𝐹:dom 𝐹–onto→𝐴 → ran 𝐹 = 𝐴)
59	55, 56, 57, 58	4syl 20	. . . . . 6 ⊢ ((𝐴 ⊆ On ∧ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ ran 𝐹)) → ran 𝐹 = 𝐴)
60	19, 59	eleqtrrd 2865	. . . . 5 ⊢ ((𝐴 ⊆ On ∧ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ ran 𝐹)) → 𝑥 ∈ ran 𝐹)
61	60	expr 461	. . . 4 ⊢ ((𝐴 ⊆ On ∧ 𝑥 ∈ 𝐴) → (¬ 𝑥 ∈ ran 𝐹 → 𝑥 ∈ ran 𝐹))
62	61	pm2.18d 128	. . 3 ⊢ ((𝐴 ⊆ On ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ ran 𝐹)
63	18, 62	eqelssd 3957	. 2 ⊢ (𝐴 ⊆ On → ran 𝐹 = 𝐴)
64	17, 63	jca 520	1 ⊢ (𝐴 ⊆ On → (Smo 𝐹 ∧ ran 𝐹 = 𝐴))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 400   ∨ wo 860   = wceq 1569   ∈ wcel 2142  ∀wral 3078  Vcvv 3454   ⊆ wss 3904   class class class wbr 5108   E cep 5559   Se wse 5611   We wwe 5612  dom cdm 5660  ran crn 5661  Ord word 6359  Oncon0 6360   Fn wfn 6531  ⟶wf 6532  –onto→wfo 6534  –1-1-onto→wf1o 6535  ‘cfv 6536   Isom wiso 6537  Smo wsmo 8330  OrdIsocoi 9469

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-sep 5256  ax-nul 5268  ax-pow 5335  ax-pr 5403  ax-un 7734

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1103  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-nf 1813  df-sb 2096  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rmo 3368  df-reu 3369  df-rab 3416  df-v 3456  df-sbc 3744  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-pss 3924  df-nul 4286  df-if 4487  df-pw 4563  df-sn 4589  df-pr 4591  df-op 4595  df-uni 4872  df-iun 4957  df-br 5109  df-opab 5173  df-mpt 5192  df-tr 5218  df-id 5555  df-eprel 5560  df-po 5568  df-so 5569  df-fr 5613  df-se 5614  df-we 5615  df-xp 5666  df-rel 5667  df-cnv 5668  df-co 5669  df-dm 5670  df-rn 5671  df-res 5672  df-ima 5673  df-pred 6302  df-ord 6363  df-on 6364  df-lim 6365  df-suc 6366  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-isom 6545  df-riota 7369  df-ov 7415  df-2nd 7985  df-frecs 8276  df-wrecs 8307  df-smo 8331  df-recs 8356  df-oi 9470

This theorem is used by:  oiid  9501  hsmexlem1  10416  hsmexlem2  10417