Theorem r111 9749

Description: The cumulative hierarchy is a one-to-one function. (Contributed by Mario Carneiro, 19-Apr-2013.)

Assertion

Ref	Expression
r111	⊢ 𝑅1:On–1-1→V

Proof of Theorem r111

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

Step	Hyp	Ref	Expression
1		r1fnon 9741	. . 3 ⊢ 𝑅1 Fn On
2		dffn2 6710	. . 3 ⊢ (𝑅1 Fn On ↔ 𝑅1:On⟶V)
3	1, 2	mpbi 233	. 2 ⊢ 𝑅1:On⟶V
4		eloni 6373	. . . . 5 ⊢ (𝑥 ∈ On → Ord 𝑥)
5		eloni 6373	. . . . 5 ⊢ (𝑦 ∈ On → Ord 𝑦)
6		ordtri3or 6396	. . . . 5 ⊢ ((Ord 𝑥 ∧ Ord 𝑦) → (𝑥 ∈ 𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦 ∈ 𝑥))
7	4, 5, 6	syl2an 607	. . . 4 ⊢ ((𝑥 ∈ On ∧ 𝑦 ∈ On) → (𝑥 ∈ 𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦 ∈ 𝑥))
8		sdomirr 9104	. . . . . . . . 9 ⊢ ¬ (𝑅1‘𝑦) ≺ (𝑅1‘𝑦)
9		r1sdom 9748	. . . . . . . . . 10 ⊢ ((𝑦 ∈ On ∧ 𝑥 ∈ 𝑦) → (𝑅1‘𝑥) ≺ (𝑅1‘𝑦))
10		breq1 5116	. . . . . . . . . 10 ⊢ ((𝑅1‘𝑥) = (𝑅1‘𝑦) → ((𝑅1‘𝑥) ≺ (𝑅1‘𝑦) ↔ (𝑅1‘𝑦) ≺ (𝑅1‘𝑦)))
11	9, 10	syl5ibcom 248	. . . . . . . . 9 ⊢ ((𝑦 ∈ On ∧ 𝑥 ∈ 𝑦) → ((𝑅1‘𝑥) = (𝑅1‘𝑦) → (𝑅1‘𝑦) ≺ (𝑅1‘𝑦)))
12	8, 11	mtoi 202	. . . . . . . 8 ⊢ ((𝑦 ∈ On ∧ 𝑥 ∈ 𝑦) → ¬ (𝑅1‘𝑥) = (𝑅1‘𝑦))
13	12	3adant1 1146	. . . . . . 7 ⊢ ((𝑥 ∈ On ∧ 𝑦 ∈ On ∧ 𝑥 ∈ 𝑦) → ¬ (𝑅1‘𝑥) = (𝑅1‘𝑦))
14	13	pm2.21d 122	. . . . . 6 ⊢ ((𝑥 ∈ On ∧ 𝑦 ∈ On ∧ 𝑥 ∈ 𝑦) → ((𝑅1‘𝑥) = (𝑅1‘𝑦) → 𝑥 = 𝑦))
15	14	3expia 1137	. . . . 5 ⊢ ((𝑥 ∈ On ∧ 𝑦 ∈ On) → (𝑥 ∈ 𝑦 → ((𝑅1‘𝑥) = (𝑅1‘𝑦) → 𝑥 = 𝑦)))
16		ax1w 13	. . . . 5 ⊢ ((𝑥 ∈ On ∧ 𝑦 ∈ On) → (𝑥 = 𝑦 → ((𝑅1‘𝑥) = (𝑅1‘𝑦) → 𝑥 = 𝑦)))
17		r1sdom 9748	. . . . . . . . . 10 ⊢ ((𝑥 ∈ On ∧ 𝑦 ∈ 𝑥) → (𝑅1‘𝑦) ≺ (𝑅1‘𝑥))
18		breq2 5117	. . . . . . . . . 10 ⊢ ((𝑅1‘𝑥) = (𝑅1‘𝑦) → ((𝑅1‘𝑦) ≺ (𝑅1‘𝑥) ↔ (𝑅1‘𝑦) ≺ (𝑅1‘𝑦)))
19	17, 18	syl5ibcom 248	. . . . . . . . 9 ⊢ ((𝑥 ∈ On ∧ 𝑦 ∈ 𝑥) → ((𝑅1‘𝑥) = (𝑅1‘𝑦) → (𝑅1‘𝑦) ≺ (𝑅1‘𝑦)))
20	8, 19	mtoi 202	. . . . . . . 8 ⊢ ((𝑥 ∈ On ∧ 𝑦 ∈ 𝑥) → ¬ (𝑅1‘𝑥) = (𝑅1‘𝑦))
21	20	3adant2 1147	. . . . . . 7 ⊢ ((𝑥 ∈ On ∧ 𝑦 ∈ On ∧ 𝑦 ∈ 𝑥) → ¬ (𝑅1‘𝑥) = (𝑅1‘𝑦))
22	21	pm2.21d 122	. . . . . 6 ⊢ ((𝑥 ∈ On ∧ 𝑦 ∈ On ∧ 𝑦 ∈ 𝑥) → ((𝑅1‘𝑥) = (𝑅1‘𝑦) → 𝑥 = 𝑦))
23	22	3expia 1137	. . . . 5 ⊢ ((𝑥 ∈ On ∧ 𝑦 ∈ On) → (𝑦 ∈ 𝑥 → ((𝑅1‘𝑥) = (𝑅1‘𝑦) → 𝑥 = 𝑦)))
24	15, 16, 23	3jaod 1454	. . . 4 ⊢ ((𝑥 ∈ On ∧ 𝑦 ∈ On) → ((𝑥 ∈ 𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦 ∈ 𝑥) → ((𝑅1‘𝑥) = (𝑅1‘𝑦) → 𝑥 = 𝑦)))
25	7, 24	mpd 16	. . 3 ⊢ ((𝑥 ∈ On ∧ 𝑦 ∈ On) → ((𝑅1‘𝑥) = (𝑅1‘𝑦) → 𝑥 = 𝑦))
26	25	rgen2 3211	. 2 ⊢ ∀𝑥 ∈ On ∀𝑦 ∈ On ((𝑅1‘𝑥) = (𝑅1‘𝑦) → 𝑥 = 𝑦)
27		dff13 7255	. 2 ⊢ (𝑅1:On–1-1→V ↔ (𝑅1:On⟶V ∧ ∀𝑥 ∈ On ∀𝑦 ∈ On ((𝑅1‘𝑥) = (𝑅1‘𝑦) → 𝑥 = 𝑦)))
28	3, 26, 27	mpbir2an 723	1 ⊢ 𝑅1:On–1-1→V

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 400   ∨ w3o 1100   ∧ w3a 1101   = wceq 1567   ∈ wcel 2149  ∀wral 3085  Vcvv 3463   class class class wbr 5113  Ord word 6362  Oncon0 6363   Fn wfn 6534  ⟶wf 6535  –1-1→wf1 6536  ‘cfv 6539   ≺ csdm 8944  𝑅₁cr1 9736

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-rep 5242  ax-sep 5261  ax-nul 5273  ax-pow 5339  ax-pr 5407  ax-un 7735

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-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-ral 3086  df-rex 3096  df-reu 3377  df-rab 3424  df-v 3465  df-sbc 3754  df-csb 3862  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-pss 3933  df-nul 4295  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4877  df-iun 4962  df-br 5114  df-opab 5178  df-mpt 5197  df-tr 5223  df-id 5559  df-eprel 5564  df-po 5572  df-so 5573  df-fr 5617  df-we 5619  df-xp 5670  df-rel 5671  df-cnv 5672  df-co 5673  df-dm 5674  df-rn 5675  df-res 5676  df-ima 5677  df-pred 6305  df-ord 6366  df-on 6367  df-lim 6368  df-suc 6369  df-iota 6495  df-fun 6541  df-fn 6542  df-f 6543  df-f1 6544  df-fo 6545  df-f1o 6546  df-fv 6547  df-ov 7416  df-2nd 7989  df-frecs 8280  df-wrecs 8311  df-recs 8360  df-rdg 8399  df-er 8696  df-en 8946  df-dom 8947  df-sdom 8948  df-r1 9738

This theorem is referenced by:  tskinf  10756  grothomex  10816  rankeq1o  36598  elhf  36601  hfninf  36613