Theorem phplem4OLD 9257

Description: Obsolete version of phplem2 9245 as of 4-Nov-2024. (Contributed by NM, 28-May-1998.) (Revised by Mario Carneiro, 24-Jun-2015.) (Proof modification is discouraged.) (New usage is discouraged.)

Hypotheses

Ref	Expression
phplem2OLD.1	⊢ 𝐴 ∈ V
phplem2OLD.2	⊢ 𝐵 ∈ V

Assertion

Ref	Expression
phplem4OLD	⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (suc 𝐴 ≈ suc 𝐵 → 𝐴 ≈ 𝐵))

Proof of Theorem phplem4OLD

Dummy variable 𝑓 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		bren 8995	. 2 ⊢ (suc 𝐴 ≈ suc 𝐵 ↔ ∃𝑓 𝑓:suc 𝐴–1-1-onto→suc 𝐵)
2		f1of1 6847	. . . . . . . . . 10 ⊢ (𝑓:suc 𝐴–1-1-onto→suc 𝐵 → 𝑓:suc 𝐴–1-1→suc 𝐵)
3	2	adantl 481	. . . . . . . . 9 ⊢ ((𝐴 ∈ ω ∧ 𝑓:suc 𝐴–1-1-onto→suc 𝐵) → 𝑓:suc 𝐴–1-1→suc 𝐵)
4		phplem2OLD.2	. . . . . . . . . 10 ⊢ 𝐵 ∈ V
5	4	sucex 7826	. . . . . . . . 9 ⊢ suc 𝐵 ∈ V
6		sssucid 6464	. . . . . . . . . 10 ⊢ 𝐴 ⊆ suc 𝐴
7		phplem2OLD.1	. . . . . . . . . 10 ⊢ 𝐴 ∈ V
8		f1imaen2g 9055	. . . . . . . . . 10 ⊢ (((𝑓:suc 𝐴–1-1→suc 𝐵 ∧ suc 𝐵 ∈ V) ∧ (𝐴 ⊆ suc 𝐴 ∧ 𝐴 ∈ V)) → (𝑓 “ 𝐴) ≈ 𝐴)
9	6, 7, 8	mpanr12 705	. . . . . . . . 9 ⊢ ((𝑓:suc 𝐴–1-1→suc 𝐵 ∧ suc 𝐵 ∈ V) → (𝑓 “ 𝐴) ≈ 𝐴)
10	3, 5, 9	sylancl 586	. . . . . . . 8 ⊢ ((𝐴 ∈ ω ∧ 𝑓:suc 𝐴–1-1-onto→suc 𝐵) → (𝑓 “ 𝐴) ≈ 𝐴)
11	10	ensymd 9045	. . . . . . 7 ⊢ ((𝐴 ∈ ω ∧ 𝑓:suc 𝐴–1-1-onto→suc 𝐵) → 𝐴 ≈ (𝑓 “ 𝐴))
12		nnord 7895	. . . . . . . . . 10 ⊢ (𝐴 ∈ ω → Ord 𝐴)
13		orddif 6480	. . . . . . . . . 10 ⊢ (Ord 𝐴 → 𝐴 = (suc 𝐴 ∖ {𝐴}))
14	12, 13	syl 17	. . . . . . . . 9 ⊢ (𝐴 ∈ ω → 𝐴 = (suc 𝐴 ∖ {𝐴}))
15	14	imaeq2d 6078	. . . . . . . 8 ⊢ (𝐴 ∈ ω → (𝑓 “ 𝐴) = (𝑓 “ (suc 𝐴 ∖ {𝐴})))
16		f1ofn 6849	. . . . . . . . . . 11 ⊢ (𝑓:suc 𝐴–1-1-onto→suc 𝐵 → 𝑓 Fn suc 𝐴)
17	7	sucid 6466	. . . . . . . . . . 11 ⊢ 𝐴 ∈ suc 𝐴
18		fnsnfv 6988	. . . . . . . . . . 11 ⊢ ((𝑓 Fn suc 𝐴 ∧ 𝐴 ∈ suc 𝐴) → {(𝑓‘𝐴)} = (𝑓 “ {𝐴}))
19	16, 17, 18	sylancl 586	. . . . . . . . . 10 ⊢ (𝑓:suc 𝐴–1-1-onto→suc 𝐵 → {(𝑓‘𝐴)} = (𝑓 “ {𝐴}))
20	19	difeq2d 4126	. . . . . . . . 9 ⊢ (𝑓:suc 𝐴–1-1-onto→suc 𝐵 → ((𝑓 “ suc 𝐴) ∖ {(𝑓‘𝐴)}) = ((𝑓 “ suc 𝐴) ∖ (𝑓 “ {𝐴})))
21		imadmrn 6088	. . . . . . . . . . . 12 ⊢ (𝑓 “ dom 𝑓) = ran 𝑓
22	21	eqcomi 2746	. . . . . . . . . . 11 ⊢ ran 𝑓 = (𝑓 “ dom 𝑓)
23		f1ofo 6855	. . . . . . . . . . . 12 ⊢ (𝑓:suc 𝐴–1-1-onto→suc 𝐵 → 𝑓:suc 𝐴–onto→suc 𝐵)
24		forn 6823	. . . . . . . . . . . 12 ⊢ (𝑓:suc 𝐴–onto→suc 𝐵 → ran 𝑓 = suc 𝐵)
25	23, 24	syl 17	. . . . . . . . . . 11 ⊢ (𝑓:suc 𝐴–1-1-onto→suc 𝐵 → ran 𝑓 = suc 𝐵)
26		f1odm 6852	. . . . . . . . . . . 12 ⊢ (𝑓:suc 𝐴–1-1-onto→suc 𝐵 → dom 𝑓 = suc 𝐴)
27	26	imaeq2d 6078	. . . . . . . . . . 11 ⊢ (𝑓:suc 𝐴–1-1-onto→suc 𝐵 → (𝑓 “ dom 𝑓) = (𝑓 “ suc 𝐴))
28	22, 25, 27	3eqtr3a 2801	. . . . . . . . . 10 ⊢ (𝑓:suc 𝐴–1-1-onto→suc 𝐵 → suc 𝐵 = (𝑓 “ suc 𝐴))
29	28	difeq1d 4125	. . . . . . . . 9 ⊢ (𝑓:suc 𝐴–1-1-onto→suc 𝐵 → (suc 𝐵 ∖ {(𝑓‘𝐴)}) = ((𝑓 “ suc 𝐴) ∖ {(𝑓‘𝐴)}))
30		dff1o3 6854	. . . . . . . . . 10 ⊢ (𝑓:suc 𝐴–1-1-onto→suc 𝐵 ↔ (𝑓:suc 𝐴–onto→suc 𝐵 ∧ Fun ◡𝑓))
31		imadif 6650	. . . . . . . . . 10 ⊢ (Fun ◡𝑓 → (𝑓 “ (suc 𝐴 ∖ {𝐴})) = ((𝑓 “ suc 𝐴) ∖ (𝑓 “ {𝐴})))
32	30, 31	simplbiim 504	. . . . . . . . 9 ⊢ (𝑓:suc 𝐴–1-1-onto→suc 𝐵 → (𝑓 “ (suc 𝐴 ∖ {𝐴})) = ((𝑓 “ suc 𝐴) ∖ (𝑓 “ {𝐴})))
33	20, 29, 32	3eqtr4rd 2788	. . . . . . . 8 ⊢ (𝑓:suc 𝐴–1-1-onto→suc 𝐵 → (𝑓 “ (suc 𝐴 ∖ {𝐴})) = (suc 𝐵 ∖ {(𝑓‘𝐴)}))
34	15, 33	sylan9eq 2797	. . . . . . 7 ⊢ ((𝐴 ∈ ω ∧ 𝑓:suc 𝐴–1-1-onto→suc 𝐵) → (𝑓 “ 𝐴) = (suc 𝐵 ∖ {(𝑓‘𝐴)}))
35	11, 34	breqtrd 5169	. . . . . 6 ⊢ ((𝐴 ∈ ω ∧ 𝑓:suc 𝐴–1-1-onto→suc 𝐵) → 𝐴 ≈ (suc 𝐵 ∖ {(𝑓‘𝐴)}))
36		fnfvelrn 7100	. . . . . . . . . 10 ⊢ ((𝑓 Fn suc 𝐴 ∧ 𝐴 ∈ suc 𝐴) → (𝑓‘𝐴) ∈ ran 𝑓)
37	16, 17, 36	sylancl 586	. . . . . . . . 9 ⊢ (𝑓:suc 𝐴–1-1-onto→suc 𝐵 → (𝑓‘𝐴) ∈ ran 𝑓)
38	24	eleq2d 2827	. . . . . . . . . 10 ⊢ (𝑓:suc 𝐴–onto→suc 𝐵 → ((𝑓‘𝐴) ∈ ran 𝑓 ↔ (𝑓‘𝐴) ∈ suc 𝐵))
39	23, 38	syl 17	. . . . . . . . 9 ⊢ (𝑓:suc 𝐴–1-1-onto→suc 𝐵 → ((𝑓‘𝐴) ∈ ran 𝑓 ↔ (𝑓‘𝐴) ∈ suc 𝐵))
40	37, 39	mpbid 232	. . . . . . . 8 ⊢ (𝑓:suc 𝐴–1-1-onto→suc 𝐵 → (𝑓‘𝐴) ∈ suc 𝐵)
41		fvex 6919	. . . . . . . . 9 ⊢ (𝑓‘𝐴) ∈ V
42	4, 41	phplem3OLD 9256	. . . . . . . 8 ⊢ ((𝐵 ∈ ω ∧ (𝑓‘𝐴) ∈ suc 𝐵) → 𝐵 ≈ (suc 𝐵 ∖ {(𝑓‘𝐴)}))
43	40, 42	sylan2 593	. . . . . . 7 ⊢ ((𝐵 ∈ ω ∧ 𝑓:suc 𝐴–1-1-onto→suc 𝐵) → 𝐵 ≈ (suc 𝐵 ∖ {(𝑓‘𝐴)}))
44	43	ensymd 9045	. . . . . 6 ⊢ ((𝐵 ∈ ω ∧ 𝑓:suc 𝐴–1-1-onto→suc 𝐵) → (suc 𝐵 ∖ {(𝑓‘𝐴)}) ≈ 𝐵)
45		entr 9046	. . . . . 6 ⊢ ((𝐴 ≈ (suc 𝐵 ∖ {(𝑓‘𝐴)}) ∧ (suc 𝐵 ∖ {(𝑓‘𝐴)}) ≈ 𝐵) → 𝐴 ≈ 𝐵)
46	35, 44, 45	syl2an 596	. . . . 5 ⊢ (((𝐴 ∈ ω ∧ 𝑓:suc 𝐴–1-1-onto→suc 𝐵) ∧ (𝐵 ∈ ω ∧ 𝑓:suc 𝐴–1-1-onto→suc 𝐵)) → 𝐴 ≈ 𝐵)
47	46	anandirs 679	. . . 4 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ 𝑓:suc 𝐴–1-1-onto→suc 𝐵) → 𝐴 ≈ 𝐵)
48	47	ex 412	. . 3 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝑓:suc 𝐴–1-1-onto→suc 𝐵 → 𝐴 ≈ 𝐵))
49	48	exlimdv 1933	. 2 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (∃𝑓 𝑓:suc 𝐴–1-1-onto→suc 𝐵 → 𝐴 ≈ 𝐵))
50	1, 49	biimtrid 242	1 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (suc 𝐴 ≈ suc 𝐵 → 𝐴 ≈ 𝐵))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1540  ∃wex 1779   ∈ wcel 2108  Vcvv 3480   ∖ cdif 3948   ⊆ wss 3951  {csn 4626   class class class wbr 5143  ^◡ccnv 5684  dom cdm 5685  ran crn 5686   “ cima 5688  Ord word 6383  suc csuc 6386  Fun wfun 6555   Fn wfn 6556  –1-1→wf1 6558  –onto→wfo 6559  –1-1-onto→wf1o 6560  ‘cfv 6561  ωcom 7887   ≈ cen 8982

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2708  ax-sep 5296  ax-nul 5306  ax-pow 5365  ax-pr 5432  ax-un 7755

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2540  df-eu 2569  df-clab 2715  df-cleq 2729  df-clel 2816  df-nfc 2892  df-ne 2941  df-ral 3062  df-rex 3071  df-rab 3437  df-v 3482  df-dif 3954  df-un 3956  df-in 3958  df-ss 3968  df-nul 4334  df-if 4526  df-pw 4602  df-sn 4627  df-pr 4629  df-op 4633  df-uni 4908  df-br 5144  df-opab 5206  df-tr 5260  df-id 5578  df-eprel 5584  df-po 5592  df-so 5593  df-fr 5637  df-we 5639  df-xp 5691  df-rel 5692  df-cnv 5693  df-co 5694  df-dm 5695  df-rn 5696  df-res 5697  df-ima 5698  df-ord 6387  df-on 6388  df-suc 6390  df-iota 6514  df-fun 6563  df-fn 6564  df-f 6565  df-f1 6566  df-fo 6567  df-f1o 6568  df-fv 6569  df-om 7888  df-er 8745  df-en 8986

This theorem is referenced by:  nneneqOLD  9258