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

Theorem fpwwe 9412
 Description: Given any function 𝐹 from the powerset of 𝐴 to 𝐴, canth2 8057 gives that the function is not injective, but we can say rather more than that. There is a unique well-ordered subset ⟨𝑋, (𝑊‘𝑋)⟩ which "agrees" with 𝐹 in the sense that each initial segment maps to its upper bound, and such that the entire set maps to an element of the set (so that it cannot be extended without losing the well-ordering). This theorem can be used to prove dfac8a 8797. Theorem 1.1 of [KanamoriPincus] p. 415. (Contributed by Mario Carneiro, 18-May-2015.)
Hypotheses
Ref Expression
fpwwe.1 𝑊 = {⟨𝑥, 𝑟⟩ ∣ ((𝑥𝐴𝑟 ⊆ (𝑥 × 𝑥)) ∧ (𝑟 We 𝑥 ∧ ∀𝑦𝑥 (𝐹‘(𝑟 “ {𝑦})) = 𝑦))}
fpwwe.2 (𝜑𝐴 ∈ V)
fpwwe.3 ((𝜑𝑥 ∈ (𝒫 𝐴 ∩ dom card)) → (𝐹𝑥) ∈ 𝐴)
fpwwe.4 𝑋 = dom 𝑊
Assertion
Ref Expression
fpwwe (𝜑 → ((𝑌𝑊𝑅 ∧ (𝐹𝑌) ∈ 𝑌) ↔ (𝑌 = 𝑋𝑅 = (𝑊𝑋))))
Distinct variable groups:   𝑥,𝑟,𝐴   𝑦,𝑟,𝐹,𝑥   𝜑,𝑟,𝑥,𝑦   𝑅,𝑟,𝑥,𝑦   𝑋,𝑟,𝑥,𝑦   𝑌,𝑟,𝑥,𝑦   𝑊,𝑟,𝑥,𝑦
Allowed substitution hint:   𝐴(𝑦)

Proof of Theorem fpwwe
Dummy variable 𝑢 is distinct from all other variables.
StepHypRef Expression
1 df-ov 6607 . . . . . 6 (𝑌(𝐹 ∘ 1st )𝑅) = ((𝐹 ∘ 1st )‘⟨𝑌, 𝑅⟩)
2 fo1st 7133 . . . . . . . 8 1st :V–onto→V
3 fofn 6074 . . . . . . . 8 (1st :V–onto→V → 1st Fn V)
42, 3ax-mp 5 . . . . . . 7 1st Fn V
5 opex 4893 . . . . . . 7 𝑌, 𝑅⟩ ∈ V
6 fvco2 6230 . . . . . . 7 ((1st Fn V ∧ ⟨𝑌, 𝑅⟩ ∈ V) → ((𝐹 ∘ 1st )‘⟨𝑌, 𝑅⟩) = (𝐹‘(1st ‘⟨𝑌, 𝑅⟩)))
74, 5, 6mp2an 707 . . . . . 6 ((𝐹 ∘ 1st )‘⟨𝑌, 𝑅⟩) = (𝐹‘(1st ‘⟨𝑌, 𝑅⟩))
81, 7eqtri 2643 . . . . 5 (𝑌(𝐹 ∘ 1st )𝑅) = (𝐹‘(1st ‘⟨𝑌, 𝑅⟩))
9 fpwwe.1 . . . . . . . 8 𝑊 = {⟨𝑥, 𝑟⟩ ∣ ((𝑥𝐴𝑟 ⊆ (𝑥 × 𝑥)) ∧ (𝑟 We 𝑥 ∧ ∀𝑦𝑥 (𝐹‘(𝑟 “ {𝑦})) = 𝑦))}
109bropaex12 5153 . . . . . . 7 (𝑌𝑊𝑅 → (𝑌 ∈ V ∧ 𝑅 ∈ V))
11 op1stg 7125 . . . . . . 7 ((𝑌 ∈ V ∧ 𝑅 ∈ V) → (1st ‘⟨𝑌, 𝑅⟩) = 𝑌)
1210, 11syl 17 . . . . . 6 (𝑌𝑊𝑅 → (1st ‘⟨𝑌, 𝑅⟩) = 𝑌)
1312fveq2d 6152 . . . . 5 (𝑌𝑊𝑅 → (𝐹‘(1st ‘⟨𝑌, 𝑅⟩)) = (𝐹𝑌))
148, 13syl5eq 2667 . . . 4 (𝑌𝑊𝑅 → (𝑌(𝐹 ∘ 1st )𝑅) = (𝐹𝑌))
1514eleq1d 2683 . . 3 (𝑌𝑊𝑅 → ((𝑌(𝐹 ∘ 1st )𝑅) ∈ 𝑌 ↔ (𝐹𝑌) ∈ 𝑌))
1615pm5.32i 668 . 2 ((𝑌𝑊𝑅 ∧ (𝑌(𝐹 ∘ 1st )𝑅) ∈ 𝑌) ↔ (𝑌𝑊𝑅 ∧ (𝐹𝑌) ∈ 𝑌))
17 vex 3189 . . . . . . . . . . 11 𝑟 ∈ V
1817cnvex 7060 . . . . . . . . . 10 𝑟 ∈ V
1918imaex 7051 . . . . . . . . 9 (𝑟 “ {𝑦}) ∈ V
20 vex 3189 . . . . . . . . . . . 12 𝑢 ∈ V
2117inex1 4759 . . . . . . . . . . . 12 (𝑟 ∩ (𝑢 × 𝑢)) ∈ V
2220, 21algrflem 7231 . . . . . . . . . . 11 (𝑢(𝐹 ∘ 1st )(𝑟 ∩ (𝑢 × 𝑢))) = (𝐹𝑢)
23 fveq2 6148 . . . . . . . . . . 11 (𝑢 = (𝑟 “ {𝑦}) → (𝐹𝑢) = (𝐹‘(𝑟 “ {𝑦})))
2422, 23syl5eq 2667 . . . . . . . . . 10 (𝑢 = (𝑟 “ {𝑦}) → (𝑢(𝐹 ∘ 1st )(𝑟 ∩ (𝑢 × 𝑢))) = (𝐹‘(𝑟 “ {𝑦})))
2524eqeq1d 2623 . . . . . . . . 9 (𝑢 = (𝑟 “ {𝑦}) → ((𝑢(𝐹 ∘ 1st )(𝑟 ∩ (𝑢 × 𝑢))) = 𝑦 ↔ (𝐹‘(𝑟 “ {𝑦})) = 𝑦))
2619, 25sbcie 3452 . . . . . . . 8 ([(𝑟 “ {𝑦}) / 𝑢](𝑢(𝐹 ∘ 1st )(𝑟 ∩ (𝑢 × 𝑢))) = 𝑦 ↔ (𝐹‘(𝑟 “ {𝑦})) = 𝑦)
2726ralbii 2974 . . . . . . 7 (∀𝑦𝑥 [(𝑟 “ {𝑦}) / 𝑢](𝑢(𝐹 ∘ 1st )(𝑟 ∩ (𝑢 × 𝑢))) = 𝑦 ↔ ∀𝑦𝑥 (𝐹‘(𝑟 “ {𝑦})) = 𝑦)
2827anbi2i 729 . . . . . 6 ((𝑟 We 𝑥 ∧ ∀𝑦𝑥 [(𝑟 “ {𝑦}) / 𝑢](𝑢(𝐹 ∘ 1st )(𝑟 ∩ (𝑢 × 𝑢))) = 𝑦) ↔ (𝑟 We 𝑥 ∧ ∀𝑦𝑥 (𝐹‘(𝑟 “ {𝑦})) = 𝑦))
2928anbi2i 729 . . . . 5 (((𝑥𝐴𝑟 ⊆ (𝑥 × 𝑥)) ∧ (𝑟 We 𝑥 ∧ ∀𝑦𝑥 [(𝑟 “ {𝑦}) / 𝑢](𝑢(𝐹 ∘ 1st )(𝑟 ∩ (𝑢 × 𝑢))) = 𝑦)) ↔ ((𝑥𝐴𝑟 ⊆ (𝑥 × 𝑥)) ∧ (𝑟 We 𝑥 ∧ ∀𝑦𝑥 (𝐹‘(𝑟 “ {𝑦})) = 𝑦)))
3029opabbii 4679 . . . 4 {⟨𝑥, 𝑟⟩ ∣ ((𝑥𝐴𝑟 ⊆ (𝑥 × 𝑥)) ∧ (𝑟 We 𝑥 ∧ ∀𝑦𝑥 [(𝑟 “ {𝑦}) / 𝑢](𝑢(𝐹 ∘ 1st )(𝑟 ∩ (𝑢 × 𝑢))) = 𝑦))} = {⟨𝑥, 𝑟⟩ ∣ ((𝑥𝐴𝑟 ⊆ (𝑥 × 𝑥)) ∧ (𝑟 We 𝑥 ∧ ∀𝑦𝑥 (𝐹‘(𝑟 “ {𝑦})) = 𝑦))}
319, 30eqtr4i 2646 . . 3 𝑊 = {⟨𝑥, 𝑟⟩ ∣ ((𝑥𝐴𝑟 ⊆ (𝑥 × 𝑥)) ∧ (𝑟 We 𝑥 ∧ ∀𝑦𝑥 [(𝑟 “ {𝑦}) / 𝑢](𝑢(𝐹 ∘ 1st )(𝑟 ∩ (𝑢 × 𝑢))) = 𝑦))}
32 fpwwe.2 . . 3 (𝜑𝐴 ∈ V)
33 vex 3189 . . . . 5 𝑥 ∈ V
3433, 17algrflem 7231 . . . 4 (𝑥(𝐹 ∘ 1st )𝑟) = (𝐹𝑥)
35 simp1 1059 . . . . . . 7 ((𝑥𝐴𝑟 ⊆ (𝑥 × 𝑥) ∧ 𝑟 We 𝑥) → 𝑥𝐴)
36 selpw 4137 . . . . . . 7 (𝑥 ∈ 𝒫 𝐴𝑥𝐴)
3735, 36sylibr 224 . . . . . 6 ((𝑥𝐴𝑟 ⊆ (𝑥 × 𝑥) ∧ 𝑟 We 𝑥) → 𝑥 ∈ 𝒫 𝐴)
38 19.8a 2049 . . . . . . . 8 (𝑟 We 𝑥 → ∃𝑟 𝑟 We 𝑥)
39383ad2ant3 1082 . . . . . . 7 ((𝑥𝐴𝑟 ⊆ (𝑥 × 𝑥) ∧ 𝑟 We 𝑥) → ∃𝑟 𝑟 We 𝑥)
40 ween 8802 . . . . . . 7 (𝑥 ∈ dom card ↔ ∃𝑟 𝑟 We 𝑥)
4139, 40sylibr 224 . . . . . 6 ((𝑥𝐴𝑟 ⊆ (𝑥 × 𝑥) ∧ 𝑟 We 𝑥) → 𝑥 ∈ dom card)
4237, 41elind 3776 . . . . 5 ((𝑥𝐴𝑟 ⊆ (𝑥 × 𝑥) ∧ 𝑟 We 𝑥) → 𝑥 ∈ (𝒫 𝐴 ∩ dom card))
43 fpwwe.3 . . . . 5 ((𝜑𝑥 ∈ (𝒫 𝐴 ∩ dom card)) → (𝐹𝑥) ∈ 𝐴)
4442, 43sylan2 491 . . . 4 ((𝜑 ∧ (𝑥𝐴𝑟 ⊆ (𝑥 × 𝑥) ∧ 𝑟 We 𝑥)) → (𝐹𝑥) ∈ 𝐴)
4534, 44syl5eqel 2702 . . 3 ((𝜑 ∧ (𝑥𝐴𝑟 ⊆ (𝑥 × 𝑥) ∧ 𝑟 We 𝑥)) → (𝑥(𝐹 ∘ 1st )𝑟) ∈ 𝐴)
46 fpwwe.4 . . 3 𝑋 = dom 𝑊
4731, 32, 45, 46fpwwe2 9409 . 2 (𝜑 → ((𝑌𝑊𝑅 ∧ (𝑌(𝐹 ∘ 1st )𝑅) ∈ 𝑌) ↔ (𝑌 = 𝑋𝑅 = (𝑊𝑋))))
4816, 47syl5bbr 274 1 (𝜑 → ((𝑌𝑊𝑅 ∧ (𝐹𝑌) ∈ 𝑌) ↔ (𝑌 = 𝑋𝑅 = (𝑊𝑋))))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 196   ∧ wa 384   ∧ w3a 1036   = wceq 1480  ∃wex 1701   ∈ wcel 1987  ∀wral 2907  Vcvv 3186  [wsbc 3417   ∩ cin 3554   ⊆ wss 3555  𝒫 cpw 4130  {csn 4148  ⟨cop 4154  ∪ cuni 4402   class class class wbr 4613  {copab 4672   We wwe 5032   × cxp 5072  ◡ccnv 5073  dom cdm 5074   “ cima 5077   ∘ ccom 5078   Fn wfn 5842  –onto→wfo 5845  ‘cfv 5847  (class class class)co 6604  1st c1st 7111  cardccrd 8705 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1719  ax-4 1734  ax-5 1836  ax-6 1885  ax-7 1932  ax-8 1989  ax-9 1996  ax-10 2016  ax-11 2031  ax-12 2044  ax-13 2245  ax-ext 2601  ax-rep 4731  ax-sep 4741  ax-nul 4749  ax-pow 4803  ax-pr 4867  ax-un 6902 This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1037  df-3an 1038  df-tru 1483  df-ex 1702  df-nf 1707  df-sb 1878  df-eu 2473  df-mo 2474  df-clab 2608  df-cleq 2614  df-clel 2617  df-nfc 2750  df-ne 2791  df-ral 2912  df-rex 2913  df-reu 2914  df-rmo 2915  df-rab 2916  df-v 3188  df-sbc 3418  df-csb 3515  df-dif 3558  df-un 3560  df-in 3562  df-ss 3569  df-pss 3571  df-nul 3892  df-if 4059  df-pw 4132  df-sn 4149  df-pr 4151  df-tp 4153  df-op 4155  df-uni 4403  df-int 4441  df-iun 4487  df-br 4614  df-opab 4674  df-mpt 4675  df-tr 4713  df-eprel 4985  df-id 4989  df-po 4995  df-so 4996  df-fr 5033  df-se 5034  df-we 5035  df-xp 5080  df-rel 5081  df-cnv 5082  df-co 5083  df-dm 5084  df-rn 5085  df-res 5086  df-ima 5087  df-pred 5639  df-ord 5685  df-on 5686  df-lim 5687  df-suc 5688  df-iota 5810  df-fun 5849  df-fn 5850  df-f 5851  df-f1 5852  df-fo 5853  df-f1o 5854  df-fv 5855  df-isom 5856  df-riota 6565  df-ov 6607  df-1st 7113  df-wrecs 7352  df-recs 7413  df-en 7900  df-oi 8359  df-card 8709 This theorem is referenced by:  canth4  9413  canthnumlem  9414  canthp1lem2  9419
 Copyright terms: Public domain W3C validator