| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ac6s2 | Structured version Visualization version GIF version | ||
| Description: Generalization of the Axiom of Choice to classes. Slightly strengthened version of ac6s3 10375. (Contributed by NM, 29-Sep-2006.) |
| Ref | Expression |
|---|---|
| ac6s.1 | ⊢ 𝐴 ∈ V |
| ac6s.2 | ⊢ (𝑦 = (𝑓‘𝑥) → (𝜑 ↔ 𝜓)) |
| Ref | Expression |
|---|---|
| ac6s2 | ⊢ (∀𝑥 ∈ 𝐴 ∃𝑦𝜑 → ∃𝑓(𝑓 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 𝜓)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | rexv 3464 | . . 3 ⊢ (∃𝑦 ∈ V 𝜑 ↔ ∃𝑦𝜑) | |
| 2 | 1 | ralbii 3078 | . 2 ⊢ (∀𝑥 ∈ 𝐴 ∃𝑦 ∈ V 𝜑 ↔ ∀𝑥 ∈ 𝐴 ∃𝑦𝜑) |
| 3 | ac6s.1 | . . . 4 ⊢ 𝐴 ∈ V | |
| 4 | ac6s.2 | . . . 4 ⊢ (𝑦 = (𝑓‘𝑥) → (𝜑 ↔ 𝜓)) | |
| 5 | 3, 4 | ac6s 10372 | . . 3 ⊢ (∀𝑥 ∈ 𝐴 ∃𝑦 ∈ V 𝜑 → ∃𝑓(𝑓:𝐴⟶V ∧ ∀𝑥 ∈ 𝐴 𝜓)) |
| 6 | ffn 6651 | . . . . 5 ⊢ (𝑓:𝐴⟶V → 𝑓 Fn 𝐴) | |
| 7 | 6 | anim1i 615 | . . . 4 ⊢ ((𝑓:𝐴⟶V ∧ ∀𝑥 ∈ 𝐴 𝜓) → (𝑓 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 𝜓)) |
| 8 | 7 | eximi 1836 | . . 3 ⊢ (∃𝑓(𝑓:𝐴⟶V ∧ ∀𝑥 ∈ 𝐴 𝜓) → ∃𝑓(𝑓 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 𝜓)) |
| 9 | 5, 8 | syl 17 | . 2 ⊢ (∀𝑥 ∈ 𝐴 ∃𝑦 ∈ V 𝜑 → ∃𝑓(𝑓 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 𝜓)) |
| 10 | 2, 9 | sylbir 235 | 1 ⊢ (∀𝑥 ∈ 𝐴 ∃𝑦𝜑 → ∃𝑓(𝑓 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 𝜓)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1541 ∃wex 1780 ∈ wcel 2111 ∀wral 3047 ∃wrex 3056 Vcvv 3436 Fn wfn 6476 ⟶wf 6477 ‘cfv 6481 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2113 ax-9 2121 ax-10 2144 ax-11 2160 ax-12 2180 ax-ext 2703 ax-rep 5217 ax-sep 5234 ax-nul 5244 ax-pow 5303 ax-pr 5370 ax-un 7668 ax-reg 9478 ax-inf2 9531 ax-ac2 10351 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2535 df-eu 2564 df-clab 2710 df-cleq 2723 df-clel 2806 df-nfc 2881 df-ne 2929 df-ral 3048 df-rex 3057 df-rmo 3346 df-reu 3347 df-rab 3396 df-v 3438 df-sbc 3742 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4284 df-if 4476 df-pw 4552 df-sn 4577 df-pr 4579 df-op 4583 df-uni 4860 df-int 4898 df-iun 4943 df-iin 4944 df-br 5092 df-opab 5154 df-mpt 5173 df-tr 5199 df-id 5511 df-eprel 5516 df-po 5524 df-so 5525 df-fr 5569 df-se 5570 df-we 5571 df-xp 5622 df-rel 5623 df-cnv 5624 df-co 5625 df-dm 5626 df-rn 5627 df-res 5628 df-ima 5629 df-pred 6248 df-ord 6309 df-on 6310 df-lim 6311 df-suc 6312 df-iota 6437 df-fun 6483 df-fn 6484 df-f 6485 df-f1 6486 df-fo 6487 df-f1o 6488 df-fv 6489 df-isom 6490 df-riota 7303 df-ov 7349 df-om 7797 df-2nd 7922 df-frecs 8211 df-wrecs 8242 df-recs 8291 df-rdg 8329 df-en 8870 df-r1 9654 df-rank 9655 df-card 9829 df-ac 10004 |
| This theorem is referenced by: ac6s3 10375 ac6s4 10378 ptpconn 35265 ctbssinf 37439 |
| Copyright terms: Public domain | W3C validator |