ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  fiprc GIF version

Theorem fiprc 6869
Description: The class of finite sets is a proper class. (Contributed by Jeff Hankins, 3-Oct-2008.)
Assertion
Ref Expression
fiprc Fin ∉ V

Proof of Theorem fiprc
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 snnex 4479 . 2 {𝑥 ∣ ∃𝑦 𝑥 = {𝑦}} ∉ V
2 vex 2763 . . . . . . . . 9 𝑦 ∈ V
3 snfig 6868 . . . . . . . . 9 (𝑦 ∈ V → {𝑦} ∈ Fin)
42, 3ax-mp 5 . . . . . . . 8 {𝑦} ∈ Fin
5 eleq1 2256 . . . . . . . 8 (𝑥 = {𝑦} → (𝑥 ∈ Fin ↔ {𝑦} ∈ Fin))
64, 5mpbiri 168 . . . . . . 7 (𝑥 = {𝑦} → 𝑥 ∈ Fin)
76exlimiv 1609 . . . . . 6 (∃𝑦 𝑥 = {𝑦} → 𝑥 ∈ Fin)
87abssi 3254 . . . . 5 {𝑥 ∣ ∃𝑦 𝑥 = {𝑦}} ⊆ Fin
9 ssexg 4168 . . . . 5 (({𝑥 ∣ ∃𝑦 𝑥 = {𝑦}} ⊆ Fin ∧ Fin ∈ V) → {𝑥 ∣ ∃𝑦 𝑥 = {𝑦}} ∈ V)
108, 9mpan 424 . . . 4 (Fin ∈ V → {𝑥 ∣ ∃𝑦 𝑥 = {𝑦}} ∈ V)
1110con3i 633 . . 3 (¬ {𝑥 ∣ ∃𝑦 𝑥 = {𝑦}} ∈ V → ¬ Fin ∈ V)
12 df-nel 2460 . . 3 ({𝑥 ∣ ∃𝑦 𝑥 = {𝑦}} ∉ V ↔ ¬ {𝑥 ∣ ∃𝑦 𝑥 = {𝑦}} ∈ V)
13 df-nel 2460 . . 3 (Fin ∉ V ↔ ¬ Fin ∈ V)
1411, 12, 133imtr4i 201 . 2 ({𝑥 ∣ ∃𝑦 𝑥 = {𝑦}} ∉ V → Fin ∉ V)
151, 14ax-mp 5 1 Fin ∉ V
Colors of variables: wff set class
Syntax hints:  ¬ wn 3   = wceq 1364  wex 1503  wcel 2164  {cab 2179  wnel 2459  Vcvv 2760  wss 3153  {csn 3618  Fincfn 6794
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-sep 4147  ax-nul 4155  ax-pow 4203  ax-pr 4238  ax-un 4464
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-nel 2460  df-ral 2477  df-rex 2478  df-v 2762  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-nul 3447  df-pw 3603  df-sn 3624  df-pr 3625  df-op 3627  df-uni 3836  df-int 3871  df-br 4030  df-opab 4091  df-id 4324  df-suc 4402  df-iom 4623  df-xp 4665  df-rel 4666  df-cnv 4667  df-co 4668  df-dm 4669  df-rn 4670  df-fun 5256  df-fn 5257  df-f 5258  df-f1 5259  df-fo 5260  df-f1o 5261  df-1o 6469  df-en 6795  df-fin 6797
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator