Theorem rankval2b 9816

Description: Value of an alternate definition of the rank function. Definition of [BellMachover] p. 478. This variant of rankval2 9808 does not use Regularity, and so requires the assumption that 𝐴 is in the range of 𝑅₁. (Contributed by BTernaryTau, 19-Jan-2026.)

Assertion

Ref	Expression
rankval2b	⊢ (𝐴 ∈ ∪ (𝑅1 “ On) → (rank‘𝐴) = ∩ {𝑥 ∈ On ∣ 𝐴 ⊆ (𝑅1‘𝑥)})

Distinct variable group:   𝑥,𝐴

Proof of Theorem rankval2b

Step	Hyp	Ref	Expression
1		rankvalb 9787	. 2 ⊢ (𝐴 ∈ ∪ (𝑅1 “ On) → (rank‘𝐴) = ∩ {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)})
2		r1suc 9760	. . . . . 6 ⊢ (𝑥 ∈ On → (𝑅1‘suc 𝑥) = 𝒫 (𝑅1‘𝑥))
3	2	eleq2d 2847	. . . . 5 ⊢ (𝑥 ∈ On → (𝐴 ∈ (𝑅1‘suc 𝑥) ↔ 𝐴 ∈ 𝒫 (𝑅1‘𝑥)))
4		fvex 6890	. . . . . 6 ⊢ (𝑅1‘𝑥) ∈ V
5	4	elpw2 5296	. . . . 5 ⊢ (𝐴 ∈ 𝒫 (𝑅1‘𝑥) ↔ 𝐴 ⊆ (𝑅1‘𝑥))
6	3, 5	bitrdi 290	. . . 4 ⊢ (𝑥 ∈ On → (𝐴 ∈ (𝑅1‘suc 𝑥) ↔ 𝐴 ⊆ (𝑅1‘𝑥)))
7	6	rabbiia 3417	. . 3 ⊢ {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} = {𝑥 ∈ On ∣ 𝐴 ⊆ (𝑅1‘𝑥)}
8	7	inteqi 4911	. 2 ⊢ ∩ {𝑥 ∈ On ∣ 𝐴 ∈ (𝑅1‘suc 𝑥)} = ∩ {𝑥 ∈ On ∣ 𝐴 ⊆ (𝑅1‘𝑥)}
9	1, 8	eqtrdi 2812	1 ⊢ (𝐴 ∈ ∪ (𝑅1 “ On) → (rank‘𝐴) = ∩ {𝑥 ∈ On ∣ 𝐴 ⊆ (𝑅1‘𝑥)})

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2145  {crab 3413   ⊆ wss 3899  𝒫 cpw 4557  ∪ cuni 4867  ∩ cint 4907   “ cima 5654  Oncon0 6355  suc csuc 6357  ‘cfv 6531  𝑅₁cr1 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-rep 5232  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:  rankval4b  9861