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

Theorem xpscf 13611
Description: Equivalent condition for the pair function to be a proper function on 𝐴. (Contributed by Mario Carneiro, 20-Aug-2015.)
Assertion
Ref Expression
xpscf ({⟨∅, 𝑋⟩, ⟨1o, 𝑌⟩}:2o𝐴 ↔ (𝑋𝐴𝑌𝐴))

Proof of Theorem xpscf
Dummy variable 𝑘 is distinct from all other variables.
StepHypRef Expression
1 2onn 6767 . . . . . . . . 9 2o ∈ ω
2 elnn 4733 . . . . . . . . 9 ((𝑘 ∈ 2o ∧ 2o ∈ ω) → 𝑘 ∈ ω)
31, 2mpan2 425 . . . . . . . 8 (𝑘 ∈ 2o𝑘 ∈ ω)
4 peano1 4721 . . . . . . . 8 ∅ ∈ ω
5 nndceq 6745 . . . . . . . 8 ((𝑘 ∈ ω ∧ ∅ ∈ ω) → DECID 𝑘 = ∅)
63, 4, 5sylancl 413 . . . . . . 7 (𝑘 ∈ 2oDECID 𝑘 = ∅)
7 ifiddc 3662 . . . . . . 7 (DECID 𝑘 = ∅ → if(𝑘 = ∅, 𝐴, 𝐴) = 𝐴)
86, 7syl 14 . . . . . 6 (𝑘 ∈ 2o → if(𝑘 = ∅, 𝐴, 𝐴) = 𝐴)
98eleq2d 2304 . . . . 5 (𝑘 ∈ 2o → (({⟨∅, 𝑋⟩, ⟨1o, 𝑌⟩}‘𝑘) ∈ if(𝑘 = ∅, 𝐴, 𝐴) ↔ ({⟨∅, 𝑋⟩, ⟨1o, 𝑌⟩}‘𝑘) ∈ 𝐴))
109ralbiia 2558 . . . 4 (∀𝑘 ∈ 2o ({⟨∅, 𝑋⟩, ⟨1o, 𝑌⟩}‘𝑘) ∈ if(𝑘 = ∅, 𝐴, 𝐴) ↔ ∀𝑘 ∈ 2o ({⟨∅, 𝑋⟩, ⟨1o, 𝑌⟩}‘𝑘) ∈ 𝐴)
1110anbi2i 457 . . 3 (({⟨∅, 𝑋⟩, ⟨1o, 𝑌⟩} Fn 2o ∧ ∀𝑘 ∈ 2o ({⟨∅, 𝑋⟩, ⟨1o, 𝑌⟩}‘𝑘) ∈ if(𝑘 = ∅, 𝐴, 𝐴)) ↔ ({⟨∅, 𝑋⟩, ⟨1o, 𝑌⟩} Fn 2o ∧ ∀𝑘 ∈ 2o ({⟨∅, 𝑋⟩, ⟨1o, 𝑌⟩}‘𝑘) ∈ 𝐴))
12 df-3an 1007 . . . 4 (({⟨∅, 𝑋⟩, ⟨1o, 𝑌⟩} ∈ V ∧ {⟨∅, 𝑋⟩, ⟨1o, 𝑌⟩} Fn 2o ∧ ∀𝑘 ∈ 2o ({⟨∅, 𝑋⟩, ⟨1o, 𝑌⟩}‘𝑘) ∈ if(𝑘 = ∅, 𝐴, 𝐴)) ↔ (({⟨∅, 𝑋⟩, ⟨1o, 𝑌⟩} ∈ V ∧ {⟨∅, 𝑋⟩, ⟨1o, 𝑌⟩} Fn 2o) ∧ ∀𝑘 ∈ 2o ({⟨∅, 𝑋⟩, ⟨1o, 𝑌⟩}‘𝑘) ∈ if(𝑘 = ∅, 𝐴, 𝐴)))
13 elixp2 6950 . . . 4 ({⟨∅, 𝑋⟩, ⟨1o, 𝑌⟩} ∈ X𝑘 ∈ 2o if(𝑘 = ∅, 𝐴, 𝐴) ↔ ({⟨∅, 𝑋⟩, ⟨1o, 𝑌⟩} ∈ V ∧ {⟨∅, 𝑋⟩, ⟨1o, 𝑌⟩} Fn 2o ∧ ∀𝑘 ∈ 2o ({⟨∅, 𝑋⟩, ⟨1o, 𝑌⟩}‘𝑘) ∈ if(𝑘 = ∅, 𝐴, 𝐴)))
14 fnex 5911 . . . . . . 7 (({⟨∅, 𝑋⟩, ⟨1o, 𝑌⟩} Fn 2o ∧ 2o ∈ ω) → {⟨∅, 𝑋⟩, ⟨1o, 𝑌⟩} ∈ V)
151, 14mpan2 425 . . . . . 6 ({⟨∅, 𝑋⟩, ⟨1o, 𝑌⟩} Fn 2o → {⟨∅, 𝑋⟩, ⟨1o, 𝑌⟩} ∈ V)
1615pm4.71ri 392 . . . . 5 ({⟨∅, 𝑋⟩, ⟨1o, 𝑌⟩} Fn 2o ↔ ({⟨∅, 𝑋⟩, ⟨1o, 𝑌⟩} ∈ V ∧ {⟨∅, 𝑋⟩, ⟨1o, 𝑌⟩} Fn 2o))
1716anbi1i 458 . . . 4 (({⟨∅, 𝑋⟩, ⟨1o, 𝑌⟩} Fn 2o ∧ ∀𝑘 ∈ 2o ({⟨∅, 𝑋⟩, ⟨1o, 𝑌⟩}‘𝑘) ∈ if(𝑘 = ∅, 𝐴, 𝐴)) ↔ (({⟨∅, 𝑋⟩, ⟨1o, 𝑌⟩} ∈ V ∧ {⟨∅, 𝑋⟩, ⟨1o, 𝑌⟩} Fn 2o) ∧ ∀𝑘 ∈ 2o ({⟨∅, 𝑋⟩, ⟨1o, 𝑌⟩}‘𝑘) ∈ if(𝑘 = ∅, 𝐴, 𝐴)))
1812, 13, 173bitr4i 212 . . 3 ({⟨∅, 𝑋⟩, ⟨1o, 𝑌⟩} ∈ X𝑘 ∈ 2o if(𝑘 = ∅, 𝐴, 𝐴) ↔ ({⟨∅, 𝑋⟩, ⟨1o, 𝑌⟩} Fn 2o ∧ ∀𝑘 ∈ 2o ({⟨∅, 𝑋⟩, ⟨1o, 𝑌⟩}‘𝑘) ∈ if(𝑘 = ∅, 𝐴, 𝐴)))
19 ffnfv 5840 . . 3 ({⟨∅, 𝑋⟩, ⟨1o, 𝑌⟩}:2o𝐴 ↔ ({⟨∅, 𝑋⟩, ⟨1o, 𝑌⟩} Fn 2o ∧ ∀𝑘 ∈ 2o ({⟨∅, 𝑋⟩, ⟨1o, 𝑌⟩}‘𝑘) ∈ 𝐴))
2011, 18, 193bitr4i 212 . 2 ({⟨∅, 𝑋⟩, ⟨1o, 𝑌⟩} ∈ X𝑘 ∈ 2o if(𝑘 = ∅, 𝐴, 𝐴) ↔ {⟨∅, 𝑋⟩, ⟨1o, 𝑌⟩}:2o𝐴)
21 xpsfrnel2 13610 . 2 ({⟨∅, 𝑋⟩, ⟨1o, 𝑌⟩} ∈ X𝑘 ∈ 2o if(𝑘 = ∅, 𝐴, 𝐴) ↔ (𝑋𝐴𝑌𝐴))
2220, 21bitr3i 186 1 ({⟨∅, 𝑋⟩, ⟨1o, 𝑌⟩}:2o𝐴 ↔ (𝑋𝐴𝑌𝐴))
Colors of variables: wff set class
Syntax hints:  wa 104  wb 105  DECID wdc 842  w3a 1005   = wceq 1398  wcel 2205  wral 2522  Vcvv 2815  c0 3512  ifcif 3624  {cpr 3695  cop 3697  ωcom 4717   Fn wfn 5352  wf 5353  cfv 5357  1oc1o 6653  2oc2o 6654  Xcixp 6946
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-coll 4230  ax-sep 4233  ax-nul 4241  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-setind 4664  ax-iinf 4715
This theorem depends on definitions:  df-bi 117  df-dc 843  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-ral 2527  df-rex 2528  df-reu 2529  df-rab 2531  df-v 2817  df-sbc 3046  df-csb 3142  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-nul 3513  df-if 3625  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-int 3955  df-iun 3998  df-br 4115  df-opab 4177  df-mpt 4178  df-tr 4214  df-id 4419  df-iord 4492  df-on 4494  df-suc 4497  df-iom 4718  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-f1 5362  df-fo 5363  df-f1o 5364  df-fv 5365  df-1o 6660  df-2o 6661  df-er 6780  df-ixp 6947  df-en 6989  df-fin 6991
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator