Theorem r111 9819

Description: The cumulative hierarchy of sets is a one-to-one function. Use r1fun 9808 or r1fnon 9810 (which require fewer axioms) when sufficient. (Contributed by Mario Carneiro, 19-Apr-2013.)

Assertion

Ref	Expression
r111	⊢ 𝑅1:On⟶1-1V

Proof of Theorem r111

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

Step	Hyp	Ref	Expression
1		r1fnon 9810	. . 3 ⊢ 𝑅1 Fn On
2		dffn2 6741	. . 3 ⊢ (𝑅1 Fn On ↔ 𝑅1:On⟶V)
3	1, 2	mpbi 233	. 2 ⊢ 𝑅1:On⟶V
4		eloni 6398	. . . . 5 ⊢ (𝑥 ∈ On → Ord 𝑥)
5		eloni 6398	. . . . 5 ⊢ (𝑦 ∈ On → Ord 𝑦)
6		ordtri3or 6421	. . . . 5 ⊢ ((Ord 𝑥 ∧ Ord 𝑦) → (𝑥 ∈ 𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦 ∈ 𝑥))
7	4, 5, 6	syl2an 608	. . . 4 ⊢ ((𝑥 ∈ On ∧ 𝑦 ∈ On) → (𝑥 ∈ 𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦 ∈ 𝑥))
8		sdomirr 9171	. . . . . . . . 9 ⊢ ¬ (𝑅1‘𝑦) ≺ (𝑅1‘𝑦)
9		r1sdom 9818	. . . . . . . . . 10 ⊢ ((𝑦 ∈ On ∧ 𝑥 ∈ 𝑦) → (𝑅1‘𝑥) ≺ (𝑅1‘𝑦))
10		breq1 5111	. . . . . . . . . 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 1148	. . . . . . 7 ⊢ ((𝑥 ∈ On ∧ 𝑦 ∈ On ∧ 𝑥 ∈ 𝑦) → ¬ (𝑅1‘𝑥) = (𝑅1‘𝑦))
14	13	pm2.21d 122	. . . . . 6 ⊢ ((𝑥 ∈ On ∧ 𝑦 ∈ On ∧ 𝑥 ∈ 𝑦) → ((𝑅1‘𝑥) = (𝑅1‘𝑦) → 𝑥 = 𝑦))
15	14	3expia 1139	. . . . 5 ⊢ ((𝑥 ∈ On ∧ 𝑦 ∈ On) → (𝑥 ∈ 𝑦 → ((𝑅1‘𝑥) = (𝑅1‘𝑦) → 𝑥 = 𝑦)))
16		ax1w 13	. . . . 5 ⊢ ((𝑥 ∈ On ∧ 𝑦 ∈ On) → (𝑥 = 𝑦 → ((𝑅1‘𝑥) = (𝑅1‘𝑦) → 𝑥 = 𝑦)))
17		r1sdom 9818	. . . . . . . . . 10 ⊢ ((𝑥 ∈ On ∧ 𝑦 ∈ 𝑥) → (𝑅1‘𝑦) ≺ (𝑅1‘𝑥))
18		breq2 5112	. . . . . . . . . 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 1149	. . . . . . 7 ⊢ ((𝑥 ∈ On ∧ 𝑦 ∈ On ∧ 𝑦 ∈ 𝑥) → ¬ (𝑅1‘𝑥) = (𝑅1‘𝑦))
22	21	pm2.21d 122	. . . . . 6 ⊢ ((𝑥 ∈ On ∧ 𝑦 ∈ On ∧ 𝑦 ∈ 𝑥) → ((𝑅1‘𝑥) = (𝑅1‘𝑦) → 𝑥 = 𝑦))
23	22	3expia 1139	. . . . 5 ⊢ ((𝑥 ∈ On ∧ 𝑦 ∈ On) → (𝑦 ∈ 𝑥 → ((𝑅1‘𝑥) = (𝑅1‘𝑦) → 𝑥 = 𝑦)))
24	15, 16, 23	3jaod 1457	. . . 4 ⊢ ((𝑥 ∈ On ∧ 𝑦 ∈ On) → ((𝑥 ∈ 𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦 ∈ 𝑥) → ((𝑅1‘𝑥) = (𝑅1‘𝑦) → 𝑥 = 𝑦)))
25	7, 24	mpd 16	. . 3 ⊢ ((𝑥 ∈ On ∧ 𝑦 ∈ On) → ((𝑅1‘𝑥) = (𝑅1‘𝑦) → 𝑥 = 𝑦))
26	25	rgen2 3206	. 2 ⊢ ∀𝑥 ∈ On ∀𝑦 ∈ On ((𝑅1‘𝑥) = (𝑅1‘𝑦) → 𝑥 = 𝑦)
27		dff13 7289	. 2 ⊢ (𝑅1:On⟶1-1V ↔ (𝑅1:On⟶V ∧ ∀𝑥 ∈ On ∀𝑦 ∈ On ((𝑅1‘𝑥) = (𝑅1‘𝑦) → 𝑥 = 𝑦)))
28	3, 26, 27	mpbir2an 724	1 ⊢ 𝑅1:On⟶1-1V

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   ∨ w3o 1102   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147  ∀wral 3080  Vcvv 3454   class class class wbr 5108  Ord word 6387  Oncon0 6388   Fn wfn 6561  ⟶wf 6562  ⟶1-1wf1 6563  ‘cfv 6566   ≺ csdm 9010  𝑅₁cr1 9803

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5238  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-pred 6330  df-ord 6391  df-on 6392  df-lim 6393  df-suc 6394  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-ov 7454  df-2nd 8036  df-frecs 8337  df-wrecs 8368  df-recs 8417  df-rdg 8456  df-er 8755  df-en 9012  df-dom 9013  df-sdom 9014  df-r1 9805

This theorem is used by:  elhfOLD  9945  tskinf  10893  grothomex  10953  rncardr1prc  35891