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

Theorem rankr1ai 9833
Description: One direction of rankr1a 9875. (Contributed by Mario Carneiro, 28-May-2013.) (Revised by Mario Carneiro, 17-Nov-2014.)
Assertion
Ref Expression
rankr1ai (𝐴 ∈ (𝑅1‘𝐵) → (rank‘𝐴) ∈ 𝐵)

Proof of Theorem rankr1ai
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 elfvdm 6942 . . 3 (𝐴 ∈ (𝑅1‘𝐵) → 𝐵 ∈ dom 𝑅1)
2 r1val1 9820 . . . . . 6 (𝐵 ∈ dom 𝑅1 → (𝑅1‘𝐵) = ∪ 𝑥 ∈ 𝐵 𝒫 (𝑅1‘𝑥))
32eleq2d 2850 . . . . 5 (𝐵 ∈ dom 𝑅1 → (𝐴 ∈ (𝑅1‘𝐵) ↔ 𝐴 ∈ ∪ 𝑥 ∈ 𝐵 𝒫 (𝑅1‘𝑥)))
4 eliun 4958 . . . . 5 (𝐴 ∈ ∪ 𝑥 ∈ 𝐵 𝒫 (𝑅1‘𝑥) ↔ ∃𝑥 ∈ 𝐵 𝐴 ∈ 𝒫 (𝑅1‘𝑥))
53, 4bitrdi 290 . . . 4 (𝐵 ∈ dom 𝑅1 → (𝐴 ∈ (𝑅1‘𝐵) ↔ ∃𝑥 ∈ 𝐵 𝐴 ∈ 𝒫 (𝑅1‘𝑥)))
6 r1dmlim 9799 . . . . . . . . . 10 Lim dom 𝑅1
7 limord 6442 . . . . . . . . . 10 (Lim dom 𝑅1 → Ord dom 𝑅1)
86, 7ax-mp 5 . . . . . . . . 9 Ord dom 𝑅1
9 ordtr1 6425 . . . . . . . . 9 (Ord dom 𝑅1 → ((𝑥 ∈ 𝐵 ∧ 𝐵 ∈ dom 𝑅1) → 𝑥 ∈ dom 𝑅1))
108, 9ax-mp 5 . . . . . . . 8 ((𝑥 ∈ 𝐵 ∧ 𝐵 ∈ dom 𝑅1) → 𝑥 ∈ dom 𝑅1)
1110ancoms 464 . . . . . . 7 ((𝐵 ∈ dom 𝑅1 ∧ 𝑥 ∈ 𝐵) → 𝑥 ∈ dom 𝑅1)
12 r1sucg 9803 . . . . . . . 8 (𝑥 ∈ dom 𝑅1 → (𝑅1‘suc 𝑥) = 𝒫 (𝑅1‘𝑥))
1312eleq2d 2850 . . . . . . 7 (𝑥 ∈ dom 𝑅1 → (𝐴 ∈ (𝑅1‘suc 𝑥) ↔ 𝐴 ∈ 𝒫 (𝑅1‘𝑥)))
1411, 13syl 18 . . . . . 6 ((𝐵 ∈ dom 𝑅1 ∧ 𝑥 ∈ 𝐵) → (𝐴 ∈ (𝑅1‘suc 𝑥) ↔ 𝐴 ∈ 𝒫 (𝑅1‘𝑥)))
15 ordsson 7821 . . . . . . . . . 10 (Ord dom 𝑅1 → dom 𝑅1 ⊆ On)
168, 15ax-mp 5 . . . . . . . . 9 dom 𝑅1 ⊆ On
1716, 11sselid 3911 . . . . . . . 8 ((𝐵 ∈ dom 𝑅1 ∧ 𝑥 ∈ 𝐵) → 𝑥 ∈ On)
18 rabid 3436 . . . . . . . . 9 (𝑥 ∈ {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} ↔ (𝑥 ∈ On ∧ 𝐴 ∈ (𝑅1‘suc 𝑥)))
19 intss1 4926 . . . . . . . . 9 (𝑥 ∈ {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} → ∩ {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} ⊆ 𝑥)
2018, 19sylbir 238 . . . . . . . 8 ((𝑥 ∈ On ∧ 𝐴 ∈ (𝑅1‘suc 𝑥)) → ∩ {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} ⊆ 𝑥)
2117, 20sylan 592 . . . . . . 7 (((𝐵 ∈ dom 𝑅1 ∧ 𝑥 ∈ 𝐵) ∧ 𝐴 ∈ (𝑅1‘suc 𝑥)) → ∩ {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} ⊆ 𝑥)
2221ex 418 . . . . . 6 ((𝐵 ∈ dom 𝑅1 ∧ 𝑥 ∈ 𝐵) → (𝐴 ∈ (𝑅1‘suc 𝑥) → ∩ {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} ⊆ 𝑥))
2314, 22sylbird 263 . . . . 5 ((𝐵 ∈ dom 𝑅1 ∧ 𝑥 ∈ 𝐵) → (𝐴 ∈ 𝒫 (𝑅1‘𝑥) → ∩ {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} ⊆ 𝑥))
2423reximdva 3179 . . . 4 (𝐵 ∈ dom 𝑅1 → (∃𝑥 ∈ 𝐵 𝐴 ∈ 𝒫 (𝑅1‘𝑥) → ∃𝑥 ∈ 𝐵 ∩ {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} ⊆ 𝑥))
255, 24sylbid 243 . . 3 (𝐵 ∈ dom 𝑅1 → (𝐴 ∈ (𝑅1‘𝐵) → ∃𝑥 ∈ 𝐵 ∩ {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} ⊆ 𝑥))
261, 25mpcom 39 . 2 (𝐴 ∈ (𝑅1‘𝐵) → ∃𝑥 ∈ 𝐵 ∩ {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} ⊆ 𝑥)
27 r1elwf 9831 . . . . . . 7 (𝐴 ∈ (𝑅1‘𝐵) → 𝐴 ∈ ∪ (𝑅1 “ On))
28 rankvalb 9832 . . . . . . 7 (𝐴 ∈ ∪ (𝑅1 “ On) → (rank‘𝐴) = ∩ {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)})
2927, 28syl 18 . . . . . 6 (𝐴 ∈ (𝑅1‘𝐵) → (rank‘𝐴) = ∩ {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)})
3029sseq1d 3944 . . . . 5 (𝐴 ∈ (𝑅1‘𝐵) → ((rank‘𝐴) ⊆ 𝑥 ↔ ∩ {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} ⊆ 𝑥))
3130adantr 486 . . . 4 ((𝐴 ∈ (𝑅1‘𝐵) ∧ 𝑥 ∈ 𝐵) → ((rank‘𝐴) ⊆ 𝑥 ↔ ∩ {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} ⊆ 𝑥))
32 rankon 9830 . . . . . . 7 (rank‘𝐴) ∈ On
3316, 1sselid 3911 . . . . . . 7 (𝐴 ∈ (𝑅1‘𝐵) → 𝐵 ∈ On)
34 ontr2 6429 . . . . . . 7 (((rank‘𝐴) ∈ On ∧ 𝐵 ∈ On) → (((rank‘𝐴) ⊆ 𝑥 ∧ 𝑥 ∈ 𝐵) → (rank‘𝐴) ∈ 𝐵))
3532, 33, 34sylancr 599 . . . . . 6 (𝐴 ∈ (𝑅1‘𝐵) → (((rank‘𝐴) ⊆ 𝑥 ∧ 𝑥 ∈ 𝐵) → (rank‘𝐴) ∈ 𝐵))
3635expcomd 422 . . . . 5 (𝐴 ∈ (𝑅1‘𝐵) → (𝑥 ∈ 𝐵 → ((rank‘𝐴) ⊆ 𝑥 → (rank‘𝐴) ∈ 𝐵)))
3736imp 412 . . . 4 ((𝐴 ∈ (𝑅1‘𝐵) ∧ 𝑥 ∈ 𝐵) → ((rank‘𝐴) ⊆ 𝑥 → (rank‘𝐴) ∈ 𝐵))
3831, 37sylbird 263 . . 3 ((𝐴 ∈ (𝑅1‘𝐵) ∧ 𝑥 ∈ 𝐵) → (∩ {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} ⊆ 𝑥 → (rank‘𝐴) ∈ 𝐵))
3938rexlimdva 3167 . 2 (𝐴 ∈ (𝑅1‘𝐵) → (∃𝑥 ∈ 𝐵 ∩ {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} ⊆ 𝑥 → (rank‘𝐴) ∈ 𝐵))
4026, 39mpd 16 1 (𝐴 ∈ (𝑅1‘𝐵) → (rank‘𝐴) ∈ 𝐵)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∃wrex 3090  {crab 3416   ⊆ wss 3900  𝒫 cpw 4560  ∪ cuni 4870  ∩ cint 4910  ∪ ciun 4954  dom cdm 5655   “ cima 5658  Ord word 6379  Oncon0 6380  Lim wlim 6381  suc csuc 6382  ‘cfv 6558  𝑅1cr1 9793  rankcrnk 9794
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-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7775
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 4839  df-uni 4871  df-int 4911  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-tr 5216  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6322  df-ord 6383  df-on 6384  df-lim 6385  df-suc 6386  df-iota 6512  df-fun 6560  df-fn 6561  df-f 6562  df-f1 6563  df-fo 6564  df-f1o 6565  df-fv 6566  df-ov 7446  df-om 7902  df-2nd 8026  df-frecs 8327  df-wrecs 8358  df-recs 8407  df-rdg 8446  df-r1 9795  df-rank 9796
This theorem is used by:  rankr1ag  9837  tcrank  9928  r1filimi  9930  dfac12lem1  10249  dfac12lem2  10250  r1limwun  10848  inatsk  10890  onvf1odlem4  36034  aomclem4  44252  r1rankcld  45421
  Copyright terms: Public domain W3C validator