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

Theorem rankr1ai 9786
Description: One direction of rankr1a 9827. (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 6911 . . 3 (𝐴 ∈ (𝑅1‘𝐵) → 𝐵 ∈ dom 𝑅1)
2 r1val1 9774 . . . . . 6 (𝐵 ∈ dom 𝑅1 → (𝑅1‘𝐵) = ∪ 𝑥 ∈ 𝐵 𝒫 (𝑅1‘𝑥))
32eleq2d 2847 . . . . 5 (𝐵 ∈ dom 𝑅1 → (𝐴 ∈ (𝑅1‘𝐵) ↔ 𝐴 ∈ ∪ 𝑥 ∈ 𝐵 𝒫 (𝑅1‘𝑥)))
4 eliun 4955 . . . . 5 (𝐴 ∈ ∪ 𝑥 ∈ 𝐵 𝒫 (𝑅1‘𝑥) ↔ ∃𝑥 ∈ 𝐵 𝐴 ∈ 𝒫 (𝑅1‘𝑥))
53, 4bitrdi 290 . . . 4 (𝐵 ∈ dom 𝑅1 → (𝐴 ∈ (𝑅1‘𝐵) ↔ ∃𝑥 ∈ 𝐵 𝐴 ∈ 𝒫 (𝑅1‘𝑥)))
6 r1funlim 9754 . . . . . . . . . . 11 (Fun 𝑅1 ∧ Lim dom 𝑅1)
76simpri 491 . . . . . . . . . 10 Lim dom 𝑅1
8 limord 6417 . . . . . . . . . 10 (Lim dom 𝑅1 → Ord dom 𝑅1)
97, 8ax-mp 5 . . . . . . . . 9 Ord dom 𝑅1
10 ordtr1 6400 . . . . . . . . 9 (Ord dom 𝑅1 → ((𝑥 ∈ 𝐵 ∧ 𝐵 ∈ dom 𝑅1) → 𝑥 ∈ dom 𝑅1))
119, 10ax-mp 5 . . . . . . . 8 ((𝑥 ∈ 𝐵 ∧ 𝐵 ∈ dom 𝑅1) → 𝑥 ∈ dom 𝑅1)
1211ancoms 464 . . . . . . 7 ((𝐵 ∈ dom 𝑅1 ∧ 𝑥 ∈ 𝐵) → 𝑥 ∈ dom 𝑅1)
13 r1sucg 9757 . . . . . . . 8 (𝑥 ∈ dom 𝑅1 → (𝑅1‘suc 𝑥) = 𝒫 (𝑅1‘𝑥))
1413eleq2d 2847 . . . . . . 7 (𝑥 ∈ dom 𝑅1 → (𝐴 ∈ (𝑅1‘suc 𝑥) ↔ 𝐴 ∈ 𝒫 (𝑅1‘𝑥)))
1512, 14syl 18 . . . . . 6 ((𝐵 ∈ dom 𝑅1 ∧ 𝑥 ∈ 𝐵) → (𝐴 ∈ (𝑅1‘suc 𝑥) ↔ 𝐴 ∈ 𝒫 (𝑅1‘𝑥)))
16 ordsson 7786 . . . . . . . . . 10 (Ord dom 𝑅1 → dom 𝑅1 ⊆ On)
179, 16ax-mp 5 . . . . . . . . 9 dom 𝑅1 ⊆ On
1817, 12sselid 3929 . . . . . . . 8 ((𝐵 ∈ dom 𝑅1 ∧ 𝑥 ∈ 𝐵) → 𝑥 ∈ On)
19 rabid 3433 . . . . . . . . 9 (𝑥 ∈ {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} ↔ (𝑥 ∈ On ∧ 𝐴 ∈ (𝑅1‘suc 𝑥)))
20 intss1 4923 . . . . . . . . 9 (𝑥 ∈ {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} → ∩ {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} ⊆ 𝑥)
2119, 20sylbir 238 . . . . . . . 8 ((𝑥 ∈ On ∧ 𝐴 ∈ (𝑅1‘suc 𝑥)) → ∩ {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} ⊆ 𝑥)
2218, 21sylan 592 . . . . . . 7 (((𝐵 ∈ dom 𝑅1 ∧ 𝑥 ∈ 𝐵) ∧ 𝐴 ∈ (𝑅1‘suc 𝑥)) → ∩ {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} ⊆ 𝑥)
2322ex 418 . . . . . 6 ((𝐵 ∈ dom 𝑅1 ∧ 𝑥 ∈ 𝐵) → (𝐴 ∈ (𝑅1‘suc 𝑥) → ∩ {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} ⊆ 𝑥))
2415, 23sylbird 263 . . . . 5 ((𝐵 ∈ dom 𝑅1 ∧ 𝑥 ∈ 𝐵) → (𝐴 ∈ 𝒫 (𝑅1‘𝑥) → ∩ {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} ⊆ 𝑥))
2524reximdva 3176 . . . 4 (𝐵 ∈ dom 𝑅1 → (∃𝑥 ∈ 𝐵 𝐴 ∈ 𝒫 (𝑅1‘𝑥) → ∃𝑥 ∈ 𝐵 ∩ {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} ⊆ 𝑥))
265, 25sylbid 243 . . 3 (𝐵 ∈ dom 𝑅1 → (𝐴 ∈ (𝑅1‘𝐵) → ∃𝑥 ∈ 𝐵 ∩ {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} ⊆ 𝑥))
271, 26mpcom 39 . 2 (𝐴 ∈ (𝑅1‘𝐵) → ∃𝑥 ∈ 𝐵 ∩ {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} ⊆ 𝑥)
28 r1elwf 9784 . . . . . . 7 (𝐴 ∈ (𝑅1‘𝐵) → 𝐴 ∈ ∪ (𝑅1 “ On))
29 rankvalb 9785 . . . . . . 7 (𝐴 ∈ ∪ (𝑅1 “ On) → (rank‘𝐴) = ∩ {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)})
3028, 29syl 18 . . . . . 6 (𝐴 ∈ (𝑅1‘𝐵) → (rank‘𝐴) = ∩ {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)})
3130sseq1d 3962 . . . . 5 (𝐴 ∈ (𝑅1‘𝐵) → ((rank‘𝐴) ⊆ 𝑥 ↔ ∩ {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} ⊆ 𝑥))
3231adantr 486 . . . 4 ((𝐴 ∈ (𝑅1‘𝐵) ∧ 𝑥 ∈ 𝐵) → ((rank‘𝐴) ⊆ 𝑥 ↔ ∩ {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} ⊆ 𝑥))
33 rankon 9783 . . . . . . 7 (rank‘𝐴) ∈ On
3417, 1sselid 3929 . . . . . . 7 (𝐴 ∈ (𝑅1‘𝐵) → 𝐵 ∈ On)
35 ontr2 6404 . . . . . . 7 (((rank‘𝐴) ∈ On ∧ 𝐵 ∈ On) → (((rank‘𝐴) ⊆ 𝑥 ∧ 𝑥 ∈ 𝐵) → (rank‘𝐴) ∈ 𝐵))
3633, 34, 35sylancr 599 . . . . . 6 (𝐴 ∈ (𝑅1‘𝐵) → (((rank‘𝐴) ⊆ 𝑥 ∧ 𝑥 ∈ 𝐵) → (rank‘𝐴) ∈ 𝐵))
3736expcomd 422 . . . . 5 (𝐴 ∈ (𝑅1‘𝐵) → (𝑥 ∈ 𝐵 → ((rank‘𝐴) ⊆ 𝑥 → (rank‘𝐴) ∈ 𝐵)))
3837imp 412 . . . 4 ((𝐴 ∈ (𝑅1‘𝐵) ∧ 𝑥 ∈ 𝐵) → ((rank‘𝐴) ⊆ 𝑥 → (rank‘𝐴) ∈ 𝐵))
3932, 38sylbird 263 . . 3 ((𝐴 ∈ (𝑅1‘𝐵) ∧ 𝑥 ∈ 𝐵) → (∩ {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} ⊆ 𝑥 → (rank‘𝐴) ∈ 𝐵))
4039rexlimdva 3164 . 2 (𝐴 ∈ (𝑅1‘𝐵) → (∃𝑥 ∈ 𝐵 ∩ {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} ⊆ 𝑥 → (rank‘𝐴) ∈ 𝐵))
4127, 40mpd 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 2145  ∃wrex 3087  {crab 3413   ⊆ wss 3899  𝒫 cpw 4557  ∪ cuni 4867  ∩ cint 4907  ∪ ciun 4951  dom cdm 5651   “ cima 5654  Ord word 6354  Oncon0 6355  Lim wlim 6356  suc csuc 6357  Fun wfun 6525  ‘cfv 6531  𝑅1cr1 9750  rankcrnk 9751
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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7740
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 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-int 4908  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-pred 6297  df-ord 6358  df-on 6359  df-lim 6360  df-suc 6361  df-iota 6487  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-ov 7415  df-om 7867  df-2nd 7991  df-frecs 8283  df-wrecs 8314  df-recs 8363  df-rdg 8402  df-r1 9752  df-rank 9753
This theorem is used by:  rankr1ag  9790  tcrank  9880  r1filimi  9882  dfac12lem1  10200  dfac12lem2  10201  r1limwun  10799  inatsk  10841  onvf1odlem4  35855  aomclem4  44014  r1rankcld  45185
  Copyright terms: Public domain W3C validator