New Foundations Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > NFE Home > Th. List > elce | GIF version |
Description: Membership in cardinal exponentiation. Theorem XI.2.38 of [Rosser] p. 382. (Contributed by SF, 6-Mar-2015.) |
Ref | Expression |
---|---|
elce | ⊢ ((N ∈ NC ∧ M ∈ NC ) → (A ∈ (N ↑c M) ↔ ∃x∃y(℘1x ∈ N ∧ ℘1y ∈ M ∧ A ≈ (x ↑m y)))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elex 2868 | . . 3 ⊢ (A ∈ (N ↑c M) → A ∈ V) | |
2 | 1 | a1i 10 | . 2 ⊢ ((N ∈ NC ∧ M ∈ NC ) → (A ∈ (N ↑c M) → A ∈ V)) |
3 | brex 4690 | . . . . . 6 ⊢ (A ≈ (x ↑m y) → (A ∈ V ∧ (x ↑m y) ∈ V)) | |
4 | 3 | simpld 445 | . . . . 5 ⊢ (A ≈ (x ↑m y) → A ∈ V) |
5 | 4 | 3ad2ant3 978 | . . . 4 ⊢ ((℘1x ∈ N ∧ ℘1y ∈ M ∧ A ≈ (x ↑m y)) → A ∈ V) |
6 | 5 | exlimivv 1635 | . . 3 ⊢ (∃x∃y(℘1x ∈ N ∧ ℘1y ∈ M ∧ A ≈ (x ↑m y)) → A ∈ V) |
7 | 6 | a1i 10 | . 2 ⊢ ((N ∈ NC ∧ M ∈ NC ) → (∃x∃y(℘1x ∈ N ∧ ℘1y ∈ M ∧ A ≈ (x ↑m y)) → A ∈ V)) |
8 | ovce 6173 | . . . . 5 ⊢ ((N ∈ NC ∧ M ∈ NC ) → (N ↑c M) = {g ∣ ∃x∃y(℘1x ∈ N ∧ ℘1y ∈ M ∧ g ≈ (x ↑m y))}) | |
9 | 8 | eleq2d 2420 | . . . 4 ⊢ ((N ∈ NC ∧ M ∈ NC ) → (A ∈ (N ↑c M) ↔ A ∈ {g ∣ ∃x∃y(℘1x ∈ N ∧ ℘1y ∈ M ∧ g ≈ (x ↑m y))})) |
10 | breq1 4643 | . . . . . . 7 ⊢ (g = A → (g ≈ (x ↑m y) ↔ A ≈ (x ↑m y))) | |
11 | 10 | 3anbi3d 1258 | . . . . . 6 ⊢ (g = A → ((℘1x ∈ N ∧ ℘1y ∈ M ∧ g ≈ (x ↑m y)) ↔ (℘1x ∈ N ∧ ℘1y ∈ M ∧ A ≈ (x ↑m y)))) |
12 | 11 | 2exbidv 1628 | . . . . 5 ⊢ (g = A → (∃x∃y(℘1x ∈ N ∧ ℘1y ∈ M ∧ g ≈ (x ↑m y)) ↔ ∃x∃y(℘1x ∈ N ∧ ℘1y ∈ M ∧ A ≈ (x ↑m y)))) |
13 | 12 | elabg 2987 | . . . 4 ⊢ (A ∈ V → (A ∈ {g ∣ ∃x∃y(℘1x ∈ N ∧ ℘1y ∈ M ∧ g ≈ (x ↑m y))} ↔ ∃x∃y(℘1x ∈ N ∧ ℘1y ∈ M ∧ A ≈ (x ↑m y)))) |
14 | 9, 13 | sylan9bb 680 | . . 3 ⊢ (((N ∈ NC ∧ M ∈ NC ) ∧ A ∈ V) → (A ∈ (N ↑c M) ↔ ∃x∃y(℘1x ∈ N ∧ ℘1y ∈ M ∧ A ≈ (x ↑m y)))) |
15 | 14 | ex 423 | . 2 ⊢ ((N ∈ NC ∧ M ∈ NC ) → (A ∈ V → (A ∈ (N ↑c M) ↔ ∃x∃y(℘1x ∈ N ∧ ℘1y ∈ M ∧ A ≈ (x ↑m y))))) |
16 | 2, 7, 15 | pm5.21ndd 343 | 1 ⊢ ((N ∈ NC ∧ M ∈ NC ) → (A ∈ (N ↑c M) ↔ ∃x∃y(℘1x ∈ N ∧ ℘1y ∈ M ∧ A ≈ (x ↑m y)))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 176 ∧ wa 358 ∧ w3a 934 ∃wex 1541 = wceq 1642 ∈ wcel 1710 {cab 2339 Vcvv 2860 ℘1cpw1 4136 class class class wbr 4640 (class class class)co 5526 ↑m cmap 6000 ≈ cen 6029 NC cncs 6089 ↑c cce 6097 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1546 ax-5 1557 ax-17 1616 ax-9 1654 ax-8 1675 ax-13 1712 ax-14 1714 ax-6 1729 ax-7 1734 ax-11 1746 ax-12 1925 ax-ext 2334 ax-nin 4079 ax-xp 4080 ax-cnv 4081 ax-1c 4082 ax-sset 4083 ax-si 4084 ax-ins2 4085 ax-ins3 4086 ax-typlower 4087 ax-sn 4088 |
This theorem depends on definitions: df-bi 177 df-or 359 df-an 360 df-3or 935 df-3an 936 df-nan 1288 df-tru 1319 df-ex 1542 df-nf 1545 df-sb 1649 df-eu 2208 df-mo 2209 df-clab 2340 df-cleq 2346 df-clel 2349 df-nfc 2479 df-ne 2519 df-ral 2620 df-rex 2621 df-reu 2622 df-rmo 2623 df-rab 2624 df-v 2862 df-sbc 3048 df-nin 3212 df-compl 3213 df-in 3214 df-un 3215 df-dif 3216 df-symdif 3217 df-ss 3260 df-pss 3262 df-nul 3552 df-if 3664 df-pw 3725 df-sn 3742 df-pr 3743 df-uni 3893 df-int 3928 df-opk 4059 df-1c 4137 df-pw1 4138 df-uni1 4139 df-xpk 4186 df-cnvk 4187 df-ins2k 4188 df-ins3k 4189 df-imak 4190 df-cok 4191 df-p6 4192 df-sik 4193 df-ssetk 4194 df-imagek 4195 df-idk 4196 df-iota 4340 df-0c 4378 df-addc 4379 df-nnc 4380 df-fin 4381 df-lefin 4441 df-ltfin 4442 df-ncfin 4443 df-tfin 4444 df-evenfin 4445 df-oddfin 4446 df-sfin 4447 df-spfin 4448 df-phi 4566 df-op 4567 df-proj1 4568 df-proj2 4569 df-opab 4624 df-br 4641 df-1st 4724 df-swap 4725 df-sset 4726 df-co 4727 df-ima 4728 df-si 4729 df-id 4768 df-xp 4785 df-cnv 4786 df-rn 4787 df-dm 4788 df-res 4789 df-fun 4790 df-fn 4791 df-f 4792 df-f1 4793 df-fo 4794 df-f1o 4795 df-fv 4796 df-2nd 4798 df-ov 5527 df-oprab 5529 df-mpt 5653 df-mpt2 5655 df-txp 5737 df-ins2 5751 df-ins3 5753 df-image 5755 df-ins4 5757 df-si3 5759 df-funs 5761 df-fns 5763 df-pw1fn 5767 df-map 6002 df-en 6030 df-ce 6107 |
This theorem is referenced by: ce0nnul 6178 cenc 6182 ce0nnulb 6183 fce 6189 |
Copyright terms: Public domain | W3C validator |