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

Theorem kardexOLD 9992
Description: Obsolete version of kardex 9991 as of 19-Jul-2026. (Contributed by NM, 14-Dec-2003.) (Proof modification is discouraged.) (New usage is discouraged.)
Assertion
Ref Expression
kardexOLD {𝑥 ∣ (𝑥 ≈ 𝐴 ∧ ∀𝑦(𝑦 ≈ 𝐴 → (rank‘𝑥) ⊆ (rank‘𝑦)))} ∈ V
Distinct variable group:   𝑥,𝑦,𝐴

Proof of Theorem kardexOLD
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 df-rab 3414 . . 3 {𝑥 ∈ {𝑧 ∣ 𝑧 ≈ 𝐴} ∣ ∀𝑦 ∈ {𝑧 ∣ 𝑧 ≈ 𝐴} (rank‘𝑥) ⊆ (rank‘𝑦)} = {𝑥 ∣ (𝑥 ∈ {𝑧 ∣ 𝑧 ≈ 𝐴} ∧ ∀𝑦 ∈ {𝑧 ∣ 𝑧 ≈ 𝐴} (rank‘𝑥) ⊆ (rank‘𝑦))}
2 vex 3455 . . . . . 6 𝑥 ∈ V
3 breq1 5108 . . . . . 6 (𝑧 = 𝑥 → (𝑧 ≈ 𝐴 ↔ 𝑥 ≈ 𝐴))
42, 3elab 3633 . . . . 5 (𝑥 ∈ {𝑧 ∣ 𝑧 ≈ 𝐴} ↔ 𝑥 ≈ 𝐴)
5 breq1 5108 . . . . . 6 (𝑧 = 𝑦 → (𝑧 ≈ 𝐴 ↔ 𝑦 ≈ 𝐴))
65ralab 3651 . . . . 5 (∀𝑦 ∈ {𝑧 ∣ 𝑧 ≈ 𝐴} (rank‘𝑥) ⊆ (rank‘𝑦) ↔ ∀𝑦(𝑦 ≈ 𝐴 → (rank‘𝑥) ⊆ (rank‘𝑦)))
74, 6anbi12i 640 . . . 4 ((𝑥 ∈ {𝑧 ∣ 𝑧 ≈ 𝐴} ∧ ∀𝑦 ∈ {𝑧 ∣ 𝑧 ≈ 𝐴} (rank‘𝑥) ⊆ (rank‘𝑦)) ↔ (𝑥 ≈ 𝐴 ∧ ∀𝑦(𝑦 ≈ 𝐴 → (rank‘𝑥) ⊆ (rank‘𝑦))))
87abbii 2831 . . 3 {𝑥 ∣ (𝑥 ∈ {𝑧 ∣ 𝑧 ≈ 𝐴} ∧ ∀𝑦 ∈ {𝑧 ∣ 𝑧 ≈ 𝐴} (rank‘𝑥) ⊆ (rank‘𝑦))} = {𝑥 ∣ (𝑥 ≈ 𝐴 ∧ ∀𝑦(𝑦 ≈ 𝐴 → (rank‘𝑥) ⊆ (rank‘𝑦)))}
91, 8eqtri 2787 . 2 {𝑥 ∈ {𝑧 ∣ 𝑧 ≈ 𝐴} ∣ ∀𝑦 ∈ {𝑧 ∣ 𝑧 ≈ 𝐴} (rank‘𝑥) ⊆ (rank‘𝑦)} = {𝑥 ∣ (𝑥 ≈ 𝐴 ∧ ∀𝑦(𝑦 ≈ 𝐴 → (rank‘𝑥) ⊆ (rank‘𝑦)))}
10 scottexOLD 9968 . 2 {𝑥 ∈ {𝑧 ∣ 𝑧 ≈ 𝐴} ∣ ∀𝑦 ∈ {𝑧 ∣ 𝑧 ≈ 𝐴} (rank‘𝑥) ⊆ (rank‘𝑦)} ∈ V
119, 10eqeltrri 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   ⊆ wss 3897   class class class wbr 5105  ‘cfv 6563   ≈ cen 9005  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: (None)
  Copyright terms: Public domain W3C validator