| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > scottexsOLD | Structured version Visualization version GIF version | ||
| Description: Obsolete theorem as of 27-Jul-2026. Use scottex 9967 with a class abstraction instead. (Contributed by NM, 13-Oct-2003.) (Proof modification is discouraged.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| scottexsOLD | ⊢ {𝑥 ∣ (𝜑 ∧ ∀𝑦([𝑦 / 𝑥]𝜑 → (rank‘𝑥) ⊆ (rank‘𝑦)))} ∈ V |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nfcv 2927 | . . . 4 ⊢ Ⅎ𝑧{𝑥 ∣ 𝜑} | |
| 2 | nfab1 2929 | . . . 4 ⊢ Ⅎ𝑥{𝑥 ∣ 𝜑} | |
| 3 | nfv 1949 | . . . . 5 ⊢ Ⅎ𝑥(rank‘𝑧) ⊆ (rank‘𝑦) | |
| 4 | 2, 3 | nfralw 3311 | . . . 4 ⊢ Ⅎ𝑥∀𝑦 ∈ {𝑥 ∣ 𝜑} (rank‘𝑧) ⊆ (rank‘𝑦) |
| 5 | nfv 1949 | . . . 4 ⊢ Ⅎ𝑧∀𝑦 ∈ {𝑥 ∣ 𝜑} (rank‘𝑥) ⊆ (rank‘𝑦) | |
| 6 | fveq2 6913 | . . . . . 6 ⊢ (𝑧 = 𝑥 → (rank‘𝑧) = (rank‘𝑥)) | |
| 7 | 6 | sseq1d 3941 | . . . . 5 ⊢ (𝑧 = 𝑥 → ((rank‘𝑧) ⊆ (rank‘𝑦) ↔ (rank‘𝑥) ⊆ (rank‘𝑦))) |
| 8 | 7 | ralbidv 3190 | . . . 4 ⊢ (𝑧 = 𝑥 → (∀𝑦 ∈ {𝑥 ∣ 𝜑} (rank‘𝑧) ⊆ (rank‘𝑦) ↔ ∀𝑦 ∈ {𝑥 ∣ 𝜑} (rank‘𝑥) ⊆ (rank‘𝑦))) |
| 9 | 1, 2, 4, 5, 8 | cbvrabw 3447 | . . 3 ⊢ {𝑧 ∈ {𝑥 ∣ 𝜑} ∣ ∀𝑦 ∈ {𝑥 ∣ 𝜑} (rank‘𝑧) ⊆ (rank‘𝑦)} = {𝑥 ∈ {𝑥 ∣ 𝜑} ∣ ∀𝑦 ∈ {𝑥 ∣ 𝜑} (rank‘𝑥) ⊆ (rank‘𝑦)} |
| 10 | df-rab 3414 | . . 3 ⊢ {𝑥 ∈ {𝑥 ∣ 𝜑} ∣ ∀𝑦 ∈ {𝑥 ∣ 𝜑} (rank‘𝑥) ⊆ (rank‘𝑦)} = {𝑥 ∣ (𝑥 ∈ {𝑥 ∣ 𝜑} ∧ ∀𝑦 ∈ {𝑥 ∣ 𝜑} (rank‘𝑥) ⊆ (rank‘𝑦))} | |
| 11 | abid 2746 | . . . . 5 ⊢ (𝑥 ∈ {𝑥 ∣ 𝜑} ↔ 𝜑) | |
| 12 | df-ral 3082 | . . . . . 6 ⊢ (∀𝑦 ∈ {𝑥 ∣ 𝜑} (rank‘𝑥) ⊆ (rank‘𝑦) ↔ ∀𝑦(𝑦 ∈ {𝑥 ∣ 𝜑} → (rank‘𝑥) ⊆ (rank‘𝑦))) | |
| 13 | df-sbc 3740 | . . . . . . . 8 ⊢ ([𝑦 / 𝑥]𝜑 ↔ 𝑦 ∈ {𝑥 ∣ 𝜑}) | |
| 14 | 13 | imbi1i 352 | . . . . . . 7 ⊢ (([𝑦 / 𝑥]𝜑 → (rank‘𝑥) ⊆ (rank‘𝑦)) ↔ (𝑦 ∈ {𝑥 ∣ 𝜑} → (rank‘𝑥) ⊆ (rank‘𝑦))) |
| 15 | 14 | albii 1852 | . . . . . 6 ⊢ (∀𝑦([𝑦 / 𝑥]𝜑 → (rank‘𝑥) ⊆ (rank‘𝑦)) ↔ ∀𝑦(𝑦 ∈ {𝑥 ∣ 𝜑} → (rank‘𝑥) ⊆ (rank‘𝑦))) |
| 16 | 12, 15 | bitr4i 281 | . . . . 5 ⊢ (∀𝑦 ∈ {𝑥 ∣ 𝜑} (rank‘𝑥) ⊆ (rank‘𝑦) ↔ ∀𝑦([𝑦 / 𝑥]𝜑 → (rank‘𝑥) ⊆ (rank‘𝑦))) |
| 17 | 11, 16 | anbi12i 640 | . . . 4 ⊢ ((𝑥 ∈ {𝑥 ∣ 𝜑} ∧ ∀𝑦 ∈ {𝑥 ∣ 𝜑} (rank‘𝑥) ⊆ (rank‘𝑦)) ↔ (𝜑 ∧ ∀𝑦([𝑦 / 𝑥]𝜑 → (rank‘𝑥) ⊆ (rank‘𝑦)))) |
| 18 | 17 | abbii 2831 | . . 3 ⊢ {𝑥 ∣ (𝑥 ∈ {𝑥 ∣ 𝜑} ∧ ∀𝑦 ∈ {𝑥 ∣ 𝜑} (rank‘𝑥) ⊆ (rank‘𝑦))} = {𝑥 ∣ (𝜑 ∧ ∀𝑦([𝑦 / 𝑥]𝜑 → (rank‘𝑥) ⊆ (rank‘𝑦)))} |
| 19 | 9, 10, 18 | 3eqtri 2791 | . 2 ⊢ {𝑧 ∈ {𝑥 ∣ 𝜑} ∣ ∀𝑦 ∈ {𝑥 ∣ 𝜑} (rank‘𝑧) ⊆ (rank‘𝑦)} = {𝑥 ∣ (𝜑 ∧ ∀𝑦([𝑦 / 𝑥]𝜑 → (rank‘𝑥) ⊆ (rank‘𝑦)))} |
| 20 | scottexOLD 9968 | . 2 ⊢ {𝑧 ∈ {𝑥 ∣ 𝜑} ∣ ∀𝑦 ∈ {𝑥 ∣ 𝜑} (rank‘𝑧) ⊆ (rank‘𝑦)} ∈ V | |
| 21 | 19, 20 | eqeltrri 2862 | 1 ⊢ {𝑥 ∣ (𝜑 ∧ ∀𝑦([𝑦 / 𝑥]𝜑 → (rank‘𝑥) ⊆ (rank‘𝑦)))} ∈ V |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∀wal 1568 ∈ wcel 2148 {cab 2742 ∀wral 3081 {crab 3413 Vcvv 3451 [wsbc 3739 ⊆ wss 3897 ‘cfv 6563 rankcrnk 9801 |
| 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 2150 ax-9 2158 ax-10 2181 ax-11 2198 ax-12 2217 ax-ext 2736 ax-rep 5235 ax-sep 5252 ax-nul 5263 ax-pow 5331 ax-pr 5395 ax-un 7780 ax-reg 9620 ax-inf2 9676 |
| 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 2568 df-eu 2598 df-clab 2743 df-cleq 2756 df-clel 2840 df-nfc 2914 df-ne 2961 df-ral 3082 df-rex 3092 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3849 df-ss 3898 df-pss 4014 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4483 df-pw 4559 df-sn 4586 df-pr 4588 df-op 4838 df-uni 4870 df-int 4910 df-iun 4955 df-br 5106 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 6327 df-ord 6388 df-on 6389 df-lim 6390 df-suc 6391 df-iota 6517 df-fun 6565 df-fn 6566 df-f 6567 df-f1 6568 df-fo 6569 df-f1o 6570 df-fv 6571 df-ov 7451 df-om 7909 df-2nd 8033 df-frecs 8334 df-wrecs 8365 df-recs 8414 df-rdg 8453 df-r1 9802 df-rank 9803 |
| This theorem is used by: htaOLD 9997 |
| Copyright terms: Public domain | W3C validator |