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

Theorem rankwflembOLD 9805
Description: Obsolete version of rankwflemb 9804 as of 29-Sep-2026. (Contributed by NM, 11-Oct-2003.) (Revised by Mario Carneiro, 16-Nov-2014.) (Proof modification is discouraged.) (New usage is discouraged.)
Assertion
Ref Expression
rankwflembOLD (𝐴 ∈ ∪ (𝑅1 “ On) ↔ ∃𝑥 ∈ On 𝐴 ∈ (𝑅1‘suc 𝑥))
Distinct variable group:   𝑥,𝐴

Proof of Theorem rankwflembOLD
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 eluni 4869 . . 3 (𝐴 ∈ ∪ (𝑅1 “ On) ↔ ∃𝑦(𝐴 ∈ 𝑦 ∧ 𝑦 ∈ (𝑅1 “ On)))
2 eleq2 2849 . . . . . . . 8 ((𝑅1‘𝑥) = 𝑦 → (𝐴 ∈ (𝑅1‘𝑥) ↔ 𝐴 ∈ 𝑦))
32biimprcd 253 . . . . . . 7 (𝐴 ∈ 𝑦 → ((𝑅1‘𝑥) = 𝑦 → 𝐴 ∈ (𝑅1‘𝑥)))
4 r1tr 9787 . . . . . . . . . . 11 Tr (𝑅1‘𝑥)
5 trss 5221 . . . . . . . . . . 11 (Tr (𝑅1‘𝑥) → (𝐴 ∈ (𝑅1‘𝑥) → 𝐴 ⊆ (𝑅1‘𝑥)))
64, 5ax-mp 5 . . . . . . . . . 10 (𝐴 ∈ (𝑅1‘𝑥) → 𝐴 ⊆ (𝑅1‘𝑥))
7 elpwg 4559 . . . . . . . . . 10 (𝐴 ∈ (𝑅1‘𝑥) → (𝐴 ∈ 𝒫 (𝑅1‘𝑥) ↔ 𝐴 ⊆ (𝑅1‘𝑥)))
86, 7mpbird 260 . . . . . . . . 9 (𝐴 ∈ (𝑅1‘𝑥) → 𝐴 ∈ 𝒫 (𝑅1‘𝑥))
9 elfvdm 6920 . . . . . . . . . 10 (𝐴 ∈ (𝑅1‘𝑥) → 𝑥 ∈ dom 𝑅1)
10 r1sucg 9780 . . . . . . . . . 10 (𝑥 ∈ dom 𝑅1 → (𝑅1‘suc 𝑥) = 𝒫 (𝑅1‘𝑥))
119, 10syl 18 . . . . . . . . 9 (𝐴 ∈ (𝑅1‘𝑥) → (𝑅1‘suc 𝑥) = 𝒫 (𝑅1‘𝑥))
128, 11eleqtrrd 2863 . . . . . . . 8 (𝐴 ∈ (𝑅1‘𝑥) → 𝐴 ∈ (𝑅1‘suc 𝑥))
1312a1i 11 . . . . . . 7 (𝑥 ∈ On → (𝐴 ∈ (𝑅1‘𝑥) → 𝐴 ∈ (𝑅1‘suc 𝑥)))
143, 13syl9 78 . . . . . 6 (𝐴 ∈ 𝑦 → (𝑥 ∈ On → ((𝑅1‘𝑥) = 𝑦 → 𝐴 ∈ (𝑅1‘suc 𝑥))))
1514reximdvai 3173 . . . . 5 (𝐴 ∈ 𝑦 → (∃𝑥 ∈ On (𝑅1‘𝑥) = 𝑦 → ∃𝑥 ∈ On 𝐴 ∈ (𝑅1‘suc 𝑥)))
16 r1fun 9775 . . . . . 6 Fun 𝑅1
17 fvelima 6951 . . . . . 6 ((Fun 𝑅1 ∧ 𝑦 ∈ (𝑅1 “ On)) → ∃𝑥 ∈ On (𝑅1‘𝑥) = 𝑦)
1816, 17mpan 703 . . . . 5 (𝑦 ∈ (𝑅1 “ On) → ∃𝑥 ∈ On (𝑅1‘𝑥) = 𝑦)
1915, 18impel 515 . . . 4 ((𝐴 ∈ 𝑦 ∧ 𝑦 ∈ (𝑅1 “ On)) → ∃𝑥 ∈ On 𝐴 ∈ (𝑅1‘suc 𝑥))
2019exlimiv 1962 . . 3 (∃𝑦(𝐴 ∈ 𝑦 ∧ 𝑦 ∈ (𝑅1 “ On)) → ∃𝑥 ∈ On 𝐴 ∈ (𝑅1‘suc 𝑥))
211, 20sylbi 220 . 2 (𝐴 ∈ ∪ (𝑅1 “ On) → ∃𝑥 ∈ On 𝐴 ∈ (𝑅1‘suc 𝑥))
22 elfvdm 6920 . . . . . 6 (𝐴 ∈ (𝑅1‘suc 𝑥) → suc 𝑥 ∈ dom 𝑅1)
23 fvelrn 7077 . . . . . 6 ((Fun 𝑅1 ∧ suc 𝑥 ∈ dom 𝑅1) → (𝑅1‘suc 𝑥) ∈ ran 𝑅1)
2416, 22, 23sylancr 599 . . . . 5 (𝐴 ∈ (𝑅1‘suc 𝑥) → (𝑅1‘suc 𝑥) ∈ ran 𝑅1)
25 df-ima 5663 . . . . . 6 (𝑅1 “ On) = ran (𝑅1 ↾ On)
26 funrel 6557 . . . . . . . . 9 (Fun 𝑅1 → Rel 𝑅1)
2716, 26ax-mp 5 . . . . . . . 8 Rel 𝑅1
28 r1dmlim 9776 . . . . . . . . 9 Lim dom 𝑅1
29 limord 6424 . . . . . . . . 9 (Lim dom 𝑅1 → Ord dom 𝑅1)
30 ordsson 7798 . . . . . . . . 9 (Ord dom 𝑅1 → dom 𝑅1 ⊆ On)
3128, 29, 30mp2b 10 . . . . . . . 8 dom 𝑅1 ⊆ On
32 relssres 6010 . . . . . . . 8 ((Rel 𝑅1 ∧ dom 𝑅1 ⊆ On) → (𝑅1 ↾ On) = 𝑅1)
3327, 31, 32mp2an 705 . . . . . . 7 (𝑅1 ↾ On) = 𝑅1
3433rneqi 5918 . . . . . 6 ran (𝑅1 ↾ On) = ran 𝑅1
3525, 34eqtri 2783 . . . . 5 (𝑅1 “ On) = ran 𝑅1
3624, 35eleqtrrdi 2871 . . . 4 (𝐴 ∈ (𝑅1‘suc 𝑥) → (𝑅1‘suc 𝑥) ∈ (𝑅1 “ On))
37 elunii 4871 . . . 4 ((𝐴 ∈ (𝑅1‘suc 𝑥) ∧ (𝑅1‘suc 𝑥) ∈ (𝑅1 “ On)) → 𝐴 ∈ ∪ (𝑅1 “ On))
3836, 37mpdan 700 . . 3 (𝐴 ∈ (𝑅1‘suc 𝑥) → 𝐴 ∈ ∪ (𝑅1 “ On))
3938rexlimivw 3159 . 2 (∃𝑥 ∈ On 𝐴 ∈ (𝑅1‘suc 𝑥) → 𝐴 ∈ ∪ (𝑅1 “ On))
4021, 39impbii 212 1 (𝐴 ∈ ∪ (𝑅1 “ On) ↔ ∃𝑥 ∈ On 𝐴 ∈ (𝑅1‘suc 𝑥))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1569  ∃wex 1811   ∈ wcel 2144  ∃wrex 3086   ⊆ wss 3895  𝒫 cpw 4556  ∪ cuni 4866  Tr wtr 5211  dom cdm 5650  ran crn 5651   ↾ cres 5652   “ cima 5653  Rel wrel 5655  Ord word 6361  Oncon0 6362  Lim wlim 6363  suc csuc 6364  Fun wfun 6533  ‘cfv 6539  𝑅1cr1 9770
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7752
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-pss 4014  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5545  df-eprel 5550  df-po 5558  df-so 5559  df-fr 5603  df-we 5605  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-pred 6304  df-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  df-iota 6494  df-fun 6541  df-fn 6542  df-f 6543  df-f1 6544  df-fo 6545  df-f1o 6546  df-fv 6547  df-ov 7424  df-om 7879  df-2nd 8003  df-frecs 8303  df-wrecs 8334  df-recs 8383  df-rdg 8422  df-r1 9772
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator