Mathbox for Alan Sare |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > zfregs2VD | Structured version Visualization version GIF version |
Description: Virtual deduction proof of zfregs2 9376. (Contributed by Alan Sare, 24-Oct-2011.) (Proof modification is discouraged.) (New usage is discouraged.) |
Ref | Expression |
---|---|
zfregs2VD | ⊢ (𝐴 ≠ ∅ → ¬ ∀𝑥 ∈ 𝐴 ∃𝑦(𝑦 ∈ 𝐴 ∧ 𝑦 ∈ 𝑥)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | idn1 41902 | . . . . . . . 8 ⊢ ( 𝐴 ≠ ∅ ▶ 𝐴 ≠ ∅ ) | |
2 | zfregs 9375 | . . . . . . . 8 ⊢ (𝐴 ≠ ∅ → ∃𝑥 ∈ 𝐴 (𝑥 ∩ 𝐴) = ∅) | |
3 | 1, 2 | e1a 41955 | . . . . . . 7 ⊢ ( 𝐴 ≠ ∅ ▶ ∃𝑥 ∈ 𝐴 (𝑥 ∩ 𝐴) = ∅ ) |
4 | incom 4131 | . . . . . . . . 9 ⊢ (𝑥 ∩ 𝐴) = (𝐴 ∩ 𝑥) | |
5 | 4 | eqeq1i 2744 | . . . . . . . 8 ⊢ ((𝑥 ∩ 𝐴) = ∅ ↔ (𝐴 ∩ 𝑥) = ∅) |
6 | 5 | rexbii 3177 | . . . . . . 7 ⊢ (∃𝑥 ∈ 𝐴 (𝑥 ∩ 𝐴) = ∅ ↔ ∃𝑥 ∈ 𝐴 (𝐴 ∩ 𝑥) = ∅) |
7 | 3, 6 | e1bi 41957 | . . . . . 6 ⊢ ( 𝐴 ≠ ∅ ▶ ∃𝑥 ∈ 𝐴 (𝐴 ∩ 𝑥) = ∅ ) |
8 | disj1 4381 | . . . . . . 7 ⊢ ((𝐴 ∩ 𝑥) = ∅ ↔ ∀𝑦(𝑦 ∈ 𝐴 → ¬ 𝑦 ∈ 𝑥)) | |
9 | 8 | rexbii 3177 | . . . . . 6 ⊢ (∃𝑥 ∈ 𝐴 (𝐴 ∩ 𝑥) = ∅ ↔ ∃𝑥 ∈ 𝐴 ∀𝑦(𝑦 ∈ 𝐴 → ¬ 𝑦 ∈ 𝑥)) |
10 | 7, 9 | e1bi 41957 | . . . . 5 ⊢ ( 𝐴 ≠ ∅ ▶ ∃𝑥 ∈ 𝐴 ∀𝑦(𝑦 ∈ 𝐴 → ¬ 𝑦 ∈ 𝑥) ) |
11 | alinexa 1850 | . . . . . 6 ⊢ (∀𝑦(𝑦 ∈ 𝐴 → ¬ 𝑦 ∈ 𝑥) ↔ ¬ ∃𝑦(𝑦 ∈ 𝐴 ∧ 𝑦 ∈ 𝑥)) | |
12 | 11 | rexbii 3177 | . . . . 5 ⊢ (∃𝑥 ∈ 𝐴 ∀𝑦(𝑦 ∈ 𝐴 → ¬ 𝑦 ∈ 𝑥) ↔ ∃𝑥 ∈ 𝐴 ¬ ∃𝑦(𝑦 ∈ 𝐴 ∧ 𝑦 ∈ 𝑥)) |
13 | 10, 12 | e1bi 41957 | . . . 4 ⊢ ( 𝐴 ≠ ∅ ▶ ∃𝑥 ∈ 𝐴 ¬ ∃𝑦(𝑦 ∈ 𝐴 ∧ 𝑦 ∈ 𝑥) ) |
14 | dfrex2 3166 | . . . 4 ⊢ (∃𝑥 ∈ 𝐴 ¬ ∃𝑦(𝑦 ∈ 𝐴 ∧ 𝑦 ∈ 𝑥) ↔ ¬ ∀𝑥 ∈ 𝐴 ¬ ¬ ∃𝑦(𝑦 ∈ 𝐴 ∧ 𝑦 ∈ 𝑥)) | |
15 | 13, 14 | e1bi 41957 | . . 3 ⊢ ( 𝐴 ≠ ∅ ▶ ¬ ∀𝑥 ∈ 𝐴 ¬ ¬ ∃𝑦(𝑦 ∈ 𝐴 ∧ 𝑦 ∈ 𝑥) ) |
16 | notnotr 132 | . . . . . 6 ⊢ (¬ ¬ ∃𝑦(𝑦 ∈ 𝐴 ∧ 𝑦 ∈ 𝑥) → ∃𝑦(𝑦 ∈ 𝐴 ∧ 𝑦 ∈ 𝑥)) | |
17 | notnot 144 | . . . . . 6 ⊢ (∃𝑦(𝑦 ∈ 𝐴 ∧ 𝑦 ∈ 𝑥) → ¬ ¬ ∃𝑦(𝑦 ∈ 𝐴 ∧ 𝑦 ∈ 𝑥)) | |
18 | 16, 17 | impbii 212 | . . . . 5 ⊢ (¬ ¬ ∃𝑦(𝑦 ∈ 𝐴 ∧ 𝑦 ∈ 𝑥) ↔ ∃𝑦(𝑦 ∈ 𝐴 ∧ 𝑦 ∈ 𝑥)) |
19 | 18 | ralbii 3090 | . . . 4 ⊢ (∀𝑥 ∈ 𝐴 ¬ ¬ ∃𝑦(𝑦 ∈ 𝐴 ∧ 𝑦 ∈ 𝑥) ↔ ∀𝑥 ∈ 𝐴 ∃𝑦(𝑦 ∈ 𝐴 ∧ 𝑦 ∈ 𝑥)) |
20 | 19 | notbii 323 | . . 3 ⊢ (¬ ∀𝑥 ∈ 𝐴 ¬ ¬ ∃𝑦(𝑦 ∈ 𝐴 ∧ 𝑦 ∈ 𝑥) ↔ ¬ ∀𝑥 ∈ 𝐴 ∃𝑦(𝑦 ∈ 𝐴 ∧ 𝑦 ∈ 𝑥)) |
21 | 15, 20 | e1bi 41957 | . 2 ⊢ ( 𝐴 ≠ ∅ ▶ ¬ ∀𝑥 ∈ 𝐴 ∃𝑦(𝑦 ∈ 𝐴 ∧ 𝑦 ∈ 𝑥) ) |
22 | 21 | in1 41899 | 1 ⊢ (𝐴 ≠ ∅ → ¬ ∀𝑥 ∈ 𝐴 ∃𝑦(𝑦 ∈ 𝐴 ∧ 𝑦 ∈ 𝑥)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 399 ∀wal 1541 = wceq 1543 ∃wex 1787 ∈ wcel 2112 ≠ wne 2942 ∀wral 3063 ∃wrex 3064 ∩ cin 3881 ∅c0 4253 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1976 ax-7 2016 ax-8 2114 ax-9 2122 ax-10 2143 ax-11 2160 ax-12 2177 ax-ext 2710 ax-rep 5195 ax-sep 5208 ax-nul 5215 ax-pr 5338 ax-un 7544 ax-reg 9235 ax-inf2 9283 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 848 df-3or 1090 df-3an 1091 df-tru 1546 df-fal 1556 df-ex 1788 df-nf 1792 df-sb 2073 df-mo 2541 df-eu 2570 df-clab 2717 df-cleq 2731 df-clel 2818 df-nfc 2888 df-ne 2943 df-ral 3068 df-rex 3069 df-reu 3070 df-rab 3072 df-v 3424 df-sbc 3711 df-csb 3828 df-dif 3885 df-un 3887 df-in 3889 df-ss 3899 df-pss 3901 df-nul 4254 df-if 4456 df-pw 4531 df-sn 4558 df-pr 4560 df-tp 4562 df-op 4564 df-uni 4836 df-iun 4922 df-br 5070 df-opab 5132 df-mpt 5152 df-tr 5178 df-id 5471 df-eprel 5477 df-po 5485 df-so 5486 df-fr 5526 df-we 5528 df-xp 5574 df-rel 5575 df-cnv 5576 df-co 5577 df-dm 5578 df-rn 5579 df-res 5580 df-ima 5581 df-pred 6178 df-ord 6236 df-on 6237 df-lim 6238 df-suc 6239 df-iota 6358 df-fun 6402 df-fn 6403 df-f 6404 df-f1 6405 df-fo 6406 df-f1o 6407 df-fv 6408 df-om 7666 df-wrecs 8070 df-recs 8131 df-rdg 8169 df-vd1 41898 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |