![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > apirr | GIF version |
Description: Apartness is irreflexive. (Contributed by Jim Kingdon, 16-Feb-2020.) |
Ref | Expression |
---|---|
apirr | ⊢ (A ∈ ℂ → ¬ A # A) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | cnre 6821 | . 2 ⊢ (A ∈ ℂ → ∃x ∈ ℝ ∃y ∈ ℝ A = (x + (i · y))) | |
2 | reapirr 7361 | . . . . . . . . . 10 ⊢ (x ∈ ℝ → ¬ x #ℝ x) | |
3 | apreap 7371 | . . . . . . . . . . 11 ⊢ ((x ∈ ℝ ∧ x ∈ ℝ) → (x # x ↔ x #ℝ x)) | |
4 | 3 | anidms 377 | . . . . . . . . . 10 ⊢ (x ∈ ℝ → (x # x ↔ x #ℝ x)) |
5 | 2, 4 | mtbird 597 | . . . . . . . . 9 ⊢ (x ∈ ℝ → ¬ x # x) |
6 | reapirr 7361 | . . . . . . . . . 10 ⊢ (y ∈ ℝ → ¬ y #ℝ y) | |
7 | apreap 7371 | . . . . . . . . . . 11 ⊢ ((y ∈ ℝ ∧ y ∈ ℝ) → (y # y ↔ y #ℝ y)) | |
8 | 7 | anidms 377 | . . . . . . . . . 10 ⊢ (y ∈ ℝ → (y # y ↔ y #ℝ y)) |
9 | 6, 8 | mtbird 597 | . . . . . . . . 9 ⊢ (y ∈ ℝ → ¬ y # y) |
10 | 5, 9 | anim12i 321 | . . . . . . . 8 ⊢ ((x ∈ ℝ ∧ y ∈ ℝ) → (¬ x # x ∧ ¬ y # y)) |
11 | ioran 668 | . . . . . . . 8 ⊢ (¬ (x # x ∨ y # y) ↔ (¬ x # x ∧ ¬ y # y)) | |
12 | 10, 11 | sylibr 137 | . . . . . . 7 ⊢ ((x ∈ ℝ ∧ y ∈ ℝ) → ¬ (x # x ∨ y # y)) |
13 | apreim 7387 | . . . . . . . 8 ⊢ (((x ∈ ℝ ∧ y ∈ ℝ) ∧ (x ∈ ℝ ∧ y ∈ ℝ)) → ((x + (i · y)) # (x + (i · y)) ↔ (x # x ∨ y # y))) | |
14 | 13 | anidms 377 | . . . . . . 7 ⊢ ((x ∈ ℝ ∧ y ∈ ℝ) → ((x + (i · y)) # (x + (i · y)) ↔ (x # x ∨ y # y))) |
15 | 12, 14 | mtbird 597 | . . . . . 6 ⊢ ((x ∈ ℝ ∧ y ∈ ℝ) → ¬ (x + (i · y)) # (x + (i · y))) |
16 | 15 | ad2antlr 458 | . . . . 5 ⊢ (((A ∈ ℂ ∧ (x ∈ ℝ ∧ y ∈ ℝ)) ∧ A = (x + (i · y))) → ¬ (x + (i · y)) # (x + (i · y))) |
17 | id 19 | . . . . . . . 8 ⊢ (A = (x + (i · y)) → A = (x + (i · y))) | |
18 | 17, 17 | breq12d 3768 | . . . . . . 7 ⊢ (A = (x + (i · y)) → (A # A ↔ (x + (i · y)) # (x + (i · y)))) |
19 | 18 | notbid 591 | . . . . . 6 ⊢ (A = (x + (i · y)) → (¬ A # A ↔ ¬ (x + (i · y)) # (x + (i · y)))) |
20 | 19 | adantl 262 | . . . . 5 ⊢ (((A ∈ ℂ ∧ (x ∈ ℝ ∧ y ∈ ℝ)) ∧ A = (x + (i · y))) → (¬ A # A ↔ ¬ (x + (i · y)) # (x + (i · y)))) |
21 | 16, 20 | mpbird 156 | . . . 4 ⊢ (((A ∈ ℂ ∧ (x ∈ ℝ ∧ y ∈ ℝ)) ∧ A = (x + (i · y))) → ¬ A # A) |
22 | 21 | ex 108 | . . 3 ⊢ ((A ∈ ℂ ∧ (x ∈ ℝ ∧ y ∈ ℝ)) → (A = (x + (i · y)) → ¬ A # A)) |
23 | 22 | rexlimdvva 2434 | . 2 ⊢ (A ∈ ℂ → (∃x ∈ ℝ ∃y ∈ ℝ A = (x + (i · y)) → ¬ A # A)) |
24 | 1, 23 | mpd 13 | 1 ⊢ (A ∈ ℂ → ¬ A # A) |
Colors of variables: wff set class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 97 ↔ wb 98 ∨ wo 628 = wceq 1242 ∈ wcel 1390 ∃wrex 2301 class class class wbr 3755 (class class class)co 5455 ℂcc 6709 ℝcr 6710 ici 6713 + caddc 6714 · cmul 6716 #ℝ creap 7358 # cap 7365 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 99 ax-ia2 100 ax-ia3 101 ax-in1 544 ax-in2 545 ax-io 629 ax-5 1333 ax-7 1334 ax-gen 1335 ax-ie1 1379 ax-ie2 1380 ax-8 1392 ax-10 1393 ax-11 1394 ax-i12 1395 ax-bndl 1396 ax-4 1397 ax-13 1401 ax-14 1402 ax-17 1416 ax-i9 1420 ax-ial 1424 ax-i5r 1425 ax-ext 2019 ax-coll 3863 ax-sep 3866 ax-nul 3874 ax-pow 3918 ax-pr 3935 ax-un 4136 ax-setind 4220 ax-iinf 4254 ax-cnex 6774 ax-resscn 6775 ax-1cn 6776 ax-1re 6777 ax-icn 6778 ax-addcl 6779 ax-addrcl 6780 ax-mulcl 6781 ax-mulrcl 6782 ax-addcom 6783 ax-mulcom 6784 ax-addass 6785 ax-mulass 6786 ax-distr 6787 ax-i2m1 6788 ax-1rid 6790 ax-0id 6791 ax-rnegex 6792 ax-precex 6793 ax-cnre 6794 ax-pre-ltirr 6795 ax-pre-lttrn 6797 ax-pre-apti 6798 ax-pre-ltadd 6799 ax-pre-mulgt0 6800 |
This theorem depends on definitions: df-bi 110 df-dc 742 df-3or 885 df-3an 886 df-tru 1245 df-fal 1248 df-nf 1347 df-sb 1643 df-eu 1900 df-mo 1901 df-clab 2024 df-cleq 2030 df-clel 2033 df-nfc 2164 df-ne 2203 df-nel 2204 df-ral 2305 df-rex 2306 df-reu 2307 df-rab 2309 df-v 2553 df-sbc 2759 df-csb 2847 df-dif 2914 df-un 2916 df-in 2918 df-ss 2925 df-nul 3219 df-pw 3353 df-sn 3373 df-pr 3374 df-op 3376 df-uni 3572 df-int 3607 df-iun 3650 df-br 3756 df-opab 3810 df-mpt 3811 df-tr 3846 df-eprel 4017 df-id 4021 df-po 4024 df-iso 4025 df-iord 4069 df-on 4071 df-suc 4074 df-iom 4257 df-xp 4294 df-rel 4295 df-cnv 4296 df-co 4297 df-dm 4298 df-rn 4299 df-res 4300 df-ima 4301 df-iota 4810 df-fun 4847 df-fn 4848 df-f 4849 df-f1 4850 df-fo 4851 df-f1o 4852 df-fv 4853 df-riota 5411 df-ov 5458 df-oprab 5459 df-mpt2 5460 df-1st 5709 df-2nd 5710 df-recs 5861 df-irdg 5897 df-1o 5940 df-2o 5941 df-oadd 5944 df-omul 5945 df-er 6042 df-ec 6044 df-qs 6048 df-ni 6288 df-pli 6289 df-mi 6290 df-lti 6291 df-plpq 6328 df-mpq 6329 df-enq 6331 df-nqqs 6332 df-plqqs 6333 df-mqqs 6334 df-1nqqs 6335 df-rq 6336 df-ltnqqs 6337 df-enq0 6407 df-nq0 6408 df-0nq0 6409 df-plq0 6410 df-mq0 6411 df-inp 6449 df-i1p 6450 df-iplp 6451 df-iltp 6453 df-enr 6654 df-nr 6655 df-ltr 6658 df-0r 6659 df-1r 6660 df-0 6718 df-1 6719 df-r 6721 df-lt 6724 df-pnf 6859 df-mnf 6860 df-ltxr 6862 df-sub 6981 df-neg 6982 df-reap 7359 df-ap 7366 |
This theorem is referenced by: mulap0r 7399 |
Copyright terms: Public domain | W3C validator |