| Mathbox for BTernaryTau |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > rankscottu | Structured version Visualization version GIF version | ||
| Description: An upper bound on the rank of a Scott's trick set. (Contributed by BTernaryTau, 4-Jul-2026.) |
| Ref | Expression |
|---|---|
| rankscottu | ⊢ (𝐴 ∈ 𝐵 → (rank‘Scott 𝐵) ⊆ suc (rank‘𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | id 23 | . . . . . . 7 ⊢ (𝑥 ∈ Scott 𝐵 → 𝑥 ∈ Scott 𝐵) | |
| 2 | 1 | scottrankd 9986 | . . . . . 6 ⊢ (𝑥 ∈ Scott 𝐵 → (rank‘Scott 𝐵) = suc (rank‘𝑥)) |
| 3 | 2 | adantr 486 | . . . . 5 ⊢ ((𝑥 ∈ Scott 𝐵 ∧ 𝐴 ∈ 𝐵) → (rank‘Scott 𝐵) = suc (rank‘𝑥)) |
| 4 | elscottrankss 35872 | . . . . . 6 ⊢ ((𝑥 ∈ Scott 𝐵 ∧ 𝐴 ∈ 𝐵) → (rank‘𝑥) ⊆ (rank‘𝐴)) | |
| 5 | rankon 9840 | . . . . . . . 8 ⊢ (rank‘𝑥) ∈ On | |
| 6 | 5 | onordi 6502 | . . . . . . 7 ⊢ Ord (rank‘𝑥) |
| 7 | rankon 9840 | . . . . . . . 8 ⊢ (rank‘𝐴) ∈ On | |
| 8 | 7 | onordi 6502 | . . . . . . 7 ⊢ Ord (rank‘𝐴) |
| 9 | ordsucsssuc 7868 | . . . . . . 7 ⊢ ((Ord (rank‘𝑥) ∧ Ord (rank‘𝐴)) → ((rank‘𝑥) ⊆ (rank‘𝐴) ↔ suc (rank‘𝑥) ⊆ suc (rank‘𝐴))) | |
| 10 | 6, 8, 9 | mp2an 705 | . . . . . 6 ⊢ ((rank‘𝑥) ⊆ (rank‘𝐴) ↔ suc (rank‘𝑥) ⊆ suc (rank‘𝐴)) |
| 11 | 4, 10 | sylib 221 | . . . . 5 ⊢ ((𝑥 ∈ Scott 𝐵 ∧ 𝐴 ∈ 𝐵) → suc (rank‘𝑥) ⊆ suc (rank‘𝐴)) |
| 12 | 3, 11 | eqsstrd 3947 | . . . 4 ⊢ ((𝑥 ∈ Scott 𝐵 ∧ 𝐴 ∈ 𝐵) → (rank‘Scott 𝐵) ⊆ suc (rank‘𝐴)) |
| 13 | 12 | ex 418 | . . 3 ⊢ (𝑥 ∈ Scott 𝐵 → (𝐴 ∈ 𝐵 → (rank‘Scott 𝐵) ⊆ suc (rank‘𝐴))) |
| 14 | 13 | exlimiv 1965 | . 2 ⊢ (∃𝑥 𝑥 ∈ Scott 𝐵 → (𝐴 ∈ 𝐵 → (rank‘Scott 𝐵) ⊆ suc (rank‘𝐴))) |
| 15 | neq0 4302 | . . . . 5 ⊢ (¬ Scott 𝐵 = ∅ ↔ ∃𝑥 𝑥 ∈ Scott 𝐵) | |
| 16 | 15 | con1bii 359 | . . . 4 ⊢ (¬ ∃𝑥 𝑥 ∈ Scott 𝐵 ↔ Scott 𝐵 = ∅) |
| 17 | scottex 9970 | . . . . . 6 ⊢ Scott 𝐵 ∈ V | |
| 18 | 17 | rankeq0 9914 | . . . . 5 ⊢ (Scott 𝐵 = ∅ ↔ (rank‘Scott 𝐵) = ∅) |
| 19 | 0ss 4353 | . . . . . 6 ⊢ ∅ ⊆ suc (rank‘𝐴) | |
| 20 | sseq1 3938 | . . . . . 6 ⊢ ((rank‘Scott 𝐵) = ∅ → ((rank‘Scott 𝐵) ⊆ suc (rank‘𝐴) ↔ ∅ ⊆ suc (rank‘𝐴))) | |
| 21 | 19, 20 | mpbiri 261 | . . . . 5 ⊢ ((rank‘Scott 𝐵) = ∅ → (rank‘Scott 𝐵) ⊆ suc (rank‘𝐴)) |
| 22 | 18, 21 | sylbi 220 | . . . 4 ⊢ (Scott 𝐵 = ∅ → (rank‘Scott 𝐵) ⊆ suc (rank‘𝐴)) |
| 23 | 16, 22 | sylbi 220 | . . 3 ⊢ (¬ ∃𝑥 𝑥 ∈ Scott 𝐵 → (rank‘Scott 𝐵) ⊆ suc (rank‘𝐴)) |
| 24 | 23 | a1d 26 | . 2 ⊢ (¬ ∃𝑥 𝑥 ∈ Scott 𝐵 → (𝐴 ∈ 𝐵 → (rank‘Scott 𝐵) ⊆ suc (rank‘𝐴))) |
| 25 | 14, 24 | pm2.61i 184 | 1 ⊢ (𝐴 ∈ 𝐵 → (rank‘Scott 𝐵) ⊆ suc (rank‘𝐴)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∃wex 1812 ∈ wcel 2147 ⊆ wss 3900 ∅c0 4281 Ord word 6387 suc csuc 6390 ‘cfv 6566 rankcrnk 9804 Scott cscott 9965 |
| 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-rep 5238 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-reg 9623 ax-inf2 9679 |
| 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 4841 df-uni 4873 df-int 4913 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-pred 6330 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-ov 7454 df-om 7912 df-2nd 8036 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-rdg 8456 df-r1 9805 df-rank 9806 df-scott 9966 |
| This theorem is used by: scottssr1 35881 rankkardu 35980 |
| Copyright terms: Public domain | W3C validator |