Mathbox for Rohan Ridenour |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > scottrankd | Structured version Visualization version GIF version |
Description: Rank of a nonempty Scott's trick set. (Contributed by Rohan Ridenour, 11-Aug-2023.) |
Ref | Expression |
---|---|
scottrankd.1 | ⊢ (𝜑 → 𝐵 ∈ Scott 𝐴) |
Ref | Expression |
---|---|
scottrankd | ⊢ (𝜑 → (rank‘Scott 𝐴) = suc (rank‘𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | scottex2 40656 | . . . 4 ⊢ Scott 𝐴 ∈ V | |
2 | 1 | rankval4 9289 | . . 3 ⊢ (rank‘Scott 𝐴) = ∪ 𝑥 ∈ Scott 𝐴 suc (rank‘𝑥) |
3 | 2 | a1i 11 | . 2 ⊢ (𝜑 → (rank‘Scott 𝐴) = ∪ 𝑥 ∈ Scott 𝐴 suc (rank‘𝑥)) |
4 | scottrankd.1 | . . . . . . 7 ⊢ (𝜑 → 𝐵 ∈ Scott 𝐴) | |
5 | 4 | adantr 483 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ Scott 𝐴) → 𝐵 ∈ Scott 𝐴) |
6 | simpr 487 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ Scott 𝐴) → 𝑥 ∈ Scott 𝐴) | |
7 | 5, 6 | scottelrankd 40658 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ Scott 𝐴) → (rank‘𝐵) ⊆ (rank‘𝑥)) |
8 | 6, 5 | scottelrankd 40658 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ Scott 𝐴) → (rank‘𝑥) ⊆ (rank‘𝐵)) |
9 | 7, 8 | eqssd 3977 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ Scott 𝐴) → (rank‘𝐵) = (rank‘𝑥)) |
10 | 9 | suceqd 40638 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ Scott 𝐴) → suc (rank‘𝐵) = suc (rank‘𝑥)) |
11 | 10 | iuneq2dv 4936 | . 2 ⊢ (𝜑 → ∪ 𝑥 ∈ Scott 𝐴 suc (rank‘𝐵) = ∪ 𝑥 ∈ Scott 𝐴 suc (rank‘𝑥)) |
12 | 4 | ne0d 4294 | . . 3 ⊢ (𝜑 → Scott 𝐴 ≠ ∅) |
13 | iunconst 4921 | . . 3 ⊢ (Scott 𝐴 ≠ ∅ → ∪ 𝑥 ∈ Scott 𝐴 suc (rank‘𝐵) = suc (rank‘𝐵)) | |
14 | 12, 13 | syl 17 | . 2 ⊢ (𝜑 → ∪ 𝑥 ∈ Scott 𝐴 suc (rank‘𝐵) = suc (rank‘𝐵)) |
15 | 3, 11, 14 | 3eqtr2d 2861 | 1 ⊢ (𝜑 → (rank‘Scott 𝐴) = suc (rank‘𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 = wceq 1536 ∈ wcel 2113 ≠ wne 3015 ∅c0 4284 ∪ ciun 4912 suc csuc 6186 ‘cfv 6348 rankcrnk 9185 Scott cscott 40646 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1969 ax-7 2014 ax-8 2115 ax-9 2123 ax-10 2144 ax-11 2160 ax-12 2176 ax-ext 2792 ax-rep 5183 ax-sep 5196 ax-nul 5203 ax-pow 5259 ax-pr 5323 ax-un 7454 ax-reg 9049 ax-inf2 9097 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1083 df-3an 1084 df-tru 1539 df-ex 1780 df-nf 1784 df-sb 2069 df-mo 2621 df-eu 2653 df-clab 2799 df-cleq 2813 df-clel 2892 df-nfc 2962 df-ne 3016 df-ral 3142 df-rex 3143 df-reu 3144 df-rab 3146 df-v 3493 df-sbc 3769 df-csb 3877 df-dif 3932 df-un 3934 df-in 3936 df-ss 3945 df-pss 3947 df-nul 4285 df-if 4461 df-pw 4534 df-sn 4561 df-pr 4563 df-tp 4565 df-op 4567 df-uni 4832 df-int 4870 df-iun 4914 df-br 5060 df-opab 5122 df-mpt 5140 df-tr 5166 df-id 5453 df-eprel 5458 df-po 5467 df-so 5468 df-fr 5507 df-we 5509 df-xp 5554 df-rel 5555 df-cnv 5556 df-co 5557 df-dm 5558 df-rn 5559 df-res 5560 df-ima 5561 df-pred 6141 df-ord 6187 df-on 6188 df-lim 6189 df-suc 6190 df-iota 6307 df-fun 6350 df-fn 6351 df-f 6352 df-f1 6353 df-fo 6354 df-f1o 6355 df-fv 6356 df-om 7574 df-wrecs 7940 df-recs 8001 df-rdg 8039 df-r1 9186 df-rank 9187 df-scott 40647 |
This theorem is referenced by: gruscottcld 40660 |
Copyright terms: Public domain | W3C validator |