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

Theorem cardprclem 10096
Description: Lemma for cardprc 10097. (Contributed by Mario Carneiro, 22-Jan-2013.) (Revised by Mario Carneiro, 15-May-2015.)
Hypothesis
Ref Expression
cardprclem.1 𝐴 = {𝑥 ∣ (card‘𝑥) = 𝑥}
Assertion
Ref Expression
cardprclem ¬ 𝐴 ∈ V
Distinct variable group:   𝑥,𝐴

Proof of Theorem cardprclem
Dummy variables 𝑤 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 cardprclem.1 . . . . . . . . 9 𝐴 = {𝑥 ∣ (card‘𝑥) = 𝑥}
21eleq2i 2859 . . . . . . . 8 (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ {𝑥 ∣ (card‘𝑥) = 𝑥})
3 abid 2748 . . . . . . . 8 (𝑥 ∈ {𝑥 ∣ (card‘𝑥) = 𝑥} ↔ (card‘𝑥) = 𝑥)
4 iscard 10092 . . . . . . . 8 ((card‘𝑥) = 𝑥 ↔ (𝑥 ∈ On ∧ ∀𝑦 ∈ 𝑥 𝑦 ≺ 𝑥))
52, 3, 43bitri 300 . . . . . . 7 (𝑥 ∈ 𝐴 ↔ (𝑥 ∈ On ∧ ∀𝑦 ∈ 𝑥 𝑦 ≺ 𝑥))
65simplbi 502 . . . . . 6 (𝑥 ∈ 𝐴 → 𝑥 ∈ On)
76ssriv 3916 . . . . 5 𝐴 ⊆ On
8 ssonuni 7827 . . . . 5 (𝐴 ∈ V → (𝐴 ⊆ On → ∪ 𝐴 ∈ On))
97, 8mpi 21 . . . 4 (𝐴 ∈ V → ∪ 𝐴 ∈ On)
10 domrefg 9051 . . . . 5 (∪ 𝐴 ∈ On → ∪ 𝐴 ≼ ∪ 𝐴)
119, 10syl 18 . . . 4 (𝐴 ∈ V → ∪ 𝐴 ≼ ∪ 𝐴)
12 elharval 9591 . . . 4 (∪ 𝐴 ∈ (har‘∪ 𝐴) ↔ (∪ 𝐴 ∈ On ∧ ∪ 𝐴 ≼ ∪ 𝐴))
139, 11, 12sylanbrc 595 . . 3 (𝐴 ∈ V → ∪ 𝐴 ∈ (har‘∪ 𝐴))
147sseli 3908 . . . . . . . 8 (𝑧 ∈ 𝐴 → 𝑧 ∈ On)
15 domrefg 9051 . . . . . . . . . 10 (𝑧 ∈ On → 𝑧 ≼ 𝑧)
1615ancli 558 . . . . . . . . 9 (𝑧 ∈ On → (𝑧 ∈ On ∧ 𝑧 ≼ 𝑧))
17 elharval 9591 . . . . . . . . 9 (𝑧 ∈ (har‘𝑧) ↔ (𝑧 ∈ On ∧ 𝑧 ≼ 𝑧))
1816, 17sylibr 237 . . . . . . . 8 (𝑧 ∈ On → 𝑧 ∈ (har‘𝑧))
1914, 18syl 18 . . . . . . 7 (𝑧 ∈ 𝐴 → 𝑧 ∈ (har‘𝑧))
20 harcard 10095 . . . . . . . 8 (card‘(har‘𝑧)) = (har‘𝑧)
21 fvex 6928 . . . . . . . . 9 (har‘𝑧) ∈ V
22 fveq2 6915 . . . . . . . . . 10 (𝑥 = (har‘𝑧) → (card‘𝑥) = (card‘(har‘𝑧)))
23 id 23 . . . . . . . . . 10 (𝑥 = (har‘𝑧) → 𝑥 = (har‘𝑧))
2422, 23eqeq12d 2782 . . . . . . . . 9 (𝑥 = (har‘𝑧) → ((card‘𝑥) = 𝑥 ↔ (card‘(har‘𝑧)) = (har‘𝑧)))
2521, 24, 1elab2 3638 . . . . . . . 8 ((har‘𝑧) ∈ 𝐴 ↔ (card‘(har‘𝑧)) = (har‘𝑧))
2620, 25mpbir 234 . . . . . . 7 (har‘𝑧) ∈ 𝐴
27 eleq2 2856 . . . . . . . . 9 (𝑤 = (har‘𝑧) → (𝑧 ∈ 𝑤 ↔ 𝑧 ∈ (har‘𝑧)))
28 eleq1 2855 . . . . . . . . 9 (𝑤 = (har‘𝑧) → (𝑤 ∈ 𝐴 ↔ (har‘𝑧) ∈ 𝐴))
2927, 28anbi12d 644 . . . . . . . 8 (𝑤 = (har‘𝑧) → ((𝑧 ∈ 𝑤 ∧ 𝑤 ∈ 𝐴) ↔ (𝑧 ∈ (har‘𝑧) ∧ (har‘𝑧) ∈ 𝐴)))
3021, 29spcev 3563 . . . . . . 7 ((𝑧 ∈ (har‘𝑧) ∧ (har‘𝑧) ∈ 𝐴) → ∃𝑤(𝑧 ∈ 𝑤 ∧ 𝑤 ∈ 𝐴))
3119, 26, 30sylancl 598 . . . . . 6 (𝑧 ∈ 𝐴 → ∃𝑤(𝑧 ∈ 𝑤 ∧ 𝑤 ∈ 𝐴))
32 eluni 4874 . . . . . 6 (𝑧 ∈ ∪ 𝐴 ↔ ∃𝑤(𝑧 ∈ 𝑤 ∧ 𝑤 ∈ 𝐴))
3331, 32sylibr 237 . . . . 5 (𝑧 ∈ 𝐴 → 𝑧 ∈ ∪ 𝐴)
3433ssriv 3916 . . . 4 𝐴 ⊆ ∪ 𝐴
35 harcard 10095 . . . . 5 (card‘(har‘∪ 𝐴)) = (har‘∪ 𝐴)
36 fvex 6928 . . . . . 6 (har‘∪ 𝐴) ∈ V
37 fveq2 6915 . . . . . . 7 (𝑥 = (har‘∪ 𝐴) → (card‘𝑥) = (card‘(har‘∪ 𝐴)))
38 id 23 . . . . . . 7 (𝑥 = (har‘∪ 𝐴) → 𝑥 = (har‘∪ 𝐴))
3937, 38eqeq12d 2782 . . . . . 6 (𝑥 = (har‘∪ 𝐴) → ((card‘𝑥) = 𝑥 ↔ (card‘(har‘∪ 𝐴)) = (har‘∪ 𝐴)))
4036, 39, 1elab2 3638 . . . . 5 ((har‘∪ 𝐴) ∈ 𝐴 ↔ (card‘(har‘∪ 𝐴)) = (har‘∪ 𝐴))
4135, 40mpbir 234 . . . 4 (har‘∪ 𝐴) ∈ 𝐴
4234, 41sselii 3909 . . 3 (har‘∪ 𝐴) ∈ ∪ 𝐴
4313, 42jctir 530 . 2 (𝐴 ∈ V → (∪ 𝐴 ∈ (har‘∪ 𝐴) ∧ (har‘∪ 𝐴) ∈ ∪ 𝐴))
44 eloni 6397 . . 3 (∪ 𝐴 ∈ On → Ord ∪ 𝐴)
45 ordn2lp 6407 . . 3 (Ord ∪ 𝐴 → ¬ (∪ 𝐴 ∈ (har‘∪ 𝐴) ∧ (har‘∪ 𝐴) ∈ ∪ 𝐴))
469, 44, 453syl 19 . 2 (𝐴 ∈ V → ¬ (∪ 𝐴 ∈ (har‘∪ 𝐴) ∧ (har‘∪ 𝐴) ∈ ∪ 𝐴))
4743, 46pm2.65i 196 1 ¬ 𝐴 ∈ V
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   ∧ wa 401   = wceq 1572  ∃wex 1814   ∈ wcel 2150  {cab 2744  ∀wral 3083  Vcvv 3453   ⊆ wss 3899  ∪ cuni 4871   class class class wbr 5107  Ord word 6386  Oncon0 6387  ‘cfv 6565   ≼ cdom 9008   ≺ csdm 9009  harchar 9586  cardccrd 10052
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-10 2183  ax-11 2200  ax-12 2219  ax-ext 2738  ax-rep 5237  ax-sep 5254  ax-nul 5265  ax-pow 5333  ax-pr 5397  ax-un 7782
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1105  df-3an 1106  df-tru 1575  df-fal 1585  df-ex 1815  df-nf 1819  df-sb 2104  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2842  df-nfc 2916  df-ne 2963  df-ral 3084  df-rex 3094  df-rmo 3368  df-reu 3369  df-rab 3416  df-v 3455  df-sbc 3742  df-csb 3851  df-ss 3900  df-pss 4016  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-op 4840  df-uni 4872  df-int 4912  df-iun 4957  df-br 5108  df-opab 5173  df-mpt 5192  df-tr 5218  df-id 5552  df-eprel 5557  df-po 5565  df-so 5566  df-fr 5610  df-se 5611  df-we 5612  df-xp 5663  df-rel 5664  df-cnv 5665  df-co 5666  df-dm 5667  df-rn 5668  df-res 5669  df-ima 5670  df-pred 6329  df-ord 6390  df-on 6391  df-lim 6392  df-suc 6393  df-iota 6519  df-fun 6567  df-fn 6568  df-f 6569  df-f1 6570  df-fo 6571  df-f1o 6572  df-fv 6573  df-isom 6574  df-riota 7407  df-ov 7453  df-2nd 8035  df-frecs 8336  df-wrecs 8367  df-recs 8416  df-er 8754  df-en 9011  df-dom 9012  df-sdom 9013  df-oi 9540  df-har 9587  df-card 10056
This theorem is used by:  cardprc  10097
  Copyright terms: Public domain W3C validator