MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  oaf1o Structured version   Visualization version   GIF version

Theorem oaf1o 8546
Description: Left addition by a constant is a bijection from ordinals to ordinals greater than the constant. (Contributed by Mario Carneiro, 30-May-2015.)
Assertion
Ref Expression
oaf1o (𝐴 ∈ On → (𝑥 ∈ On ↦ (𝐴 +o 𝑥)):On–1-1-onto→(On ∖ 𝐴))
Distinct variable group:   𝑥,𝐴

Proof of Theorem oaf1o
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 oacl 8517 . . . 4 ((𝐴 ∈ On ∧ 𝑥 ∈ On) → (𝐴 +o 𝑥) ∈ On)
2 oaword1 8535 . . . . 5 ((𝐴 ∈ On ∧ 𝑥 ∈ On) → 𝐴 ⊆ (𝐴 +o 𝑥))
3 ontri1 6387 . . . . . 6 ((𝐴 ∈ On ∧ (𝐴 +o 𝑥) ∈ On) → (𝐴 ⊆ (𝐴 +o 𝑥) ↔ ¬ (𝐴 +o 𝑥) ∈ 𝐴))
41, 3syldan 591 . . . . 5 ((𝐴 ∈ On ∧ 𝑥 ∈ On) → (𝐴 ⊆ (𝐴 +o 𝑥) ↔ ¬ (𝐴 +o 𝑥) ∈ 𝐴))
52, 4mpbid 231 . . . 4 ((𝐴 ∈ On ∧ 𝑥 ∈ On) → ¬ (𝐴 +o 𝑥) ∈ 𝐴)
61, 5eldifd 3955 . . 3 ((𝐴 ∈ On ∧ 𝑥 ∈ On) → (𝐴 +o 𝑥) ∈ (On ∖ 𝐴))
76ralrimiva 3145 . 2 (𝐴 ∈ On → ∀𝑥 ∈ On (𝐴 +o 𝑥) ∈ (On ∖ 𝐴))
8 simpl 483 . . . . 5 ((𝐴 ∈ On ∧ 𝑦 ∈ (On ∖ 𝐴)) → 𝐴 ∈ On)
9 eldifi 4122 . . . . . 6 (𝑦 ∈ (On ∖ 𝐴) → 𝑦 ∈ On)
109adantl 482 . . . . 5 ((𝐴 ∈ On ∧ 𝑦 ∈ (On ∖ 𝐴)) → 𝑦 ∈ On)
11 eldifn 4123 . . . . . . 7 (𝑦 ∈ (On ∖ 𝐴) → ¬ 𝑦𝐴)
1211adantl 482 . . . . . 6 ((𝐴 ∈ On ∧ 𝑦 ∈ (On ∖ 𝐴)) → ¬ 𝑦𝐴)
13 ontri1 6387 . . . . . . 7 ((𝐴 ∈ On ∧ 𝑦 ∈ On) → (𝐴𝑦 ↔ ¬ 𝑦𝐴))
1410, 13syldan 591 . . . . . 6 ((𝐴 ∈ On ∧ 𝑦 ∈ (On ∖ 𝐴)) → (𝐴𝑦 ↔ ¬ 𝑦𝐴))
1512, 14mpbird 256 . . . . 5 ((𝐴 ∈ On ∧ 𝑦 ∈ (On ∖ 𝐴)) → 𝐴𝑦)
16 oawordeu 8538 . . . . 5 (((𝐴 ∈ On ∧ 𝑦 ∈ On) ∧ 𝐴𝑦) → ∃!𝑥 ∈ On (𝐴 +o 𝑥) = 𝑦)
178, 10, 15, 16syl21anc 836 . . . 4 ((𝐴 ∈ On ∧ 𝑦 ∈ (On ∖ 𝐴)) → ∃!𝑥 ∈ On (𝐴 +o 𝑥) = 𝑦)
18 eqcom 2738 . . . . 5 ((𝐴 +o 𝑥) = 𝑦𝑦 = (𝐴 +o 𝑥))
1918reubii 3384 . . . 4 (∃!𝑥 ∈ On (𝐴 +o 𝑥) = 𝑦 ↔ ∃!𝑥 ∈ On 𝑦 = (𝐴 +o 𝑥))
2017, 19sylib 217 . . 3 ((𝐴 ∈ On ∧ 𝑦 ∈ (On ∖ 𝐴)) → ∃!𝑥 ∈ On 𝑦 = (𝐴 +o 𝑥))
2120ralrimiva 3145 . 2 (𝐴 ∈ On → ∀𝑦 ∈ (On ∖ 𝐴)∃!𝑥 ∈ On 𝑦 = (𝐴 +o 𝑥))
22 eqid 2731 . . 3 (𝑥 ∈ On ↦ (𝐴 +o 𝑥)) = (𝑥 ∈ On ↦ (𝐴 +o 𝑥))
2322f1ompt 7095 . 2 ((𝑥 ∈ On ↦ (𝐴 +o 𝑥)):On–1-1-onto→(On ∖ 𝐴) ↔ (∀𝑥 ∈ On (𝐴 +o 𝑥) ∈ (On ∖ 𝐴) ∧ ∀𝑦 ∈ (On ∖ 𝐴)∃!𝑥 ∈ On 𝑦 = (𝐴 +o 𝑥)))
247, 21, 23sylanbrc 583 1 (𝐴 ∈ On → (𝑥 ∈ On ↦ (𝐴 +o 𝑥)):On–1-1-onto→(On ∖ 𝐴))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 205  wa 396   = wceq 1541  wcel 2106  wral 3060  ∃!wreu 3373  cdif 3941  wss 3944  cmpt 5224  Oncon0 6353  1-1-ontowf1o 6531  (class class class)co 7393   +o coa 8445
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2702  ax-rep 5278  ax-sep 5292  ax-nul 5299  ax-pr 5420  ax-un 7708
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3or 1088  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2533  df-eu 2562  df-clab 2709  df-cleq 2723  df-clel 2809  df-nfc 2884  df-ne 2940  df-ral 3061  df-rex 3070  df-rmo 3375  df-reu 3376  df-rab 3432  df-v 3475  df-sbc 3774  df-csb 3890  df-dif 3947  df-un 3949  df-in 3951  df-ss 3961  df-pss 3963  df-nul 4319  df-if 4523  df-pw 4598  df-sn 4623  df-pr 4625  df-op 4629  df-uni 4902  df-int 4944  df-iun 4992  df-br 5142  df-opab 5204  df-mpt 5225  df-tr 5259  df-id 5567  df-eprel 5573  df-po 5581  df-so 5582  df-fr 5624  df-we 5626  df-xp 5675  df-rel 5676  df-cnv 5677  df-co 5678  df-dm 5679  df-rn 5680  df-res 5681  df-ima 5682  df-pred 6289  df-ord 6356  df-on 6357  df-lim 6358  df-suc 6359  df-iota 6484  df-fun 6534  df-fn 6535  df-f 6536  df-f1 6537  df-fo 6538  df-f1o 6539  df-fv 6540  df-ov 7396  df-oprab 7397  df-mpo 7398  df-om 7839  df-2nd 7958  df-frecs 8248  df-wrecs 8279  df-recs 8353  df-rdg 8392  df-oadd 8452
This theorem is referenced by:  oacomf1olem  8547
  Copyright terms: Public domain W3C validator