Theorem exmidmotap 7479

Description: The proposition that every class has at most one tight apartness is equivalent to excluded middle. (Contributed by Jim Kingdon, 14-Feb-2025.)

Assertion

Ref	Expression
exmidmotap	|- (EXMID <-> A. x E* r r TAp x )

Distinct variable group:   x, r

Proof of Theorem exmidmotap

Dummy variables s u v are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		simprl 531	. . . . . . . 8 |- ( (EXMID /\ ( r TAp x /\ s TAp x ) ) -> r TAp x )
2		exmidapne 7478	. . . . . . . . 9 |- (EXMID -> ( r TAp x <-> r = { <. u , v >. | ( ( u e. x /\ v e. x ) /\ u =/= v ) } ) )
3	2	adantr 276	. . . . . . . 8 |- ( (EXMID /\ ( r TAp x /\ s TAp x ) ) -> ( r TAp x <-> r = { <. u , v >. | ( ( u e. x /\ v e. x ) /\ u =/= v ) } ) )
4	1, 3	mpbid 147	. . . . . . 7 |- ( (EXMID /\ ( r TAp x /\ s TAp x ) ) -> r = { <. u , v >. | ( ( u e. x /\ v e. x ) /\ u =/= v ) } )
5		simprr 533	. . . . . . . 8 |- ( (EXMID /\ ( r TAp x /\ s TAp x ) ) -> s TAp x )
6		exmidapne 7478	. . . . . . . . 9 |- (EXMID -> ( s TAp x <-> s = { <. u , v >. | ( ( u e. x /\ v e. x ) /\ u =/= v ) } ) )
7	6	adantr 276	. . . . . . . 8 |- ( (EXMID /\ ( r TAp x /\ s TAp x ) ) -> ( s TAp x <-> s = { <. u , v >. | ( ( u e. x /\ v e. x ) /\ u =/= v ) } ) )
8	5, 7	mpbid 147	. . . . . . 7 |- ( (EXMID /\ ( r TAp x /\ s TAp x ) ) -> s = { <. u , v >. | ( ( u e. x /\ v e. x ) /\ u =/= v ) } )
9	4, 8	eqtr4d 2267	. . . . . 6 |- ( (EXMID /\ ( r TAp x /\ s TAp x ) ) -> r = s )
10	9	ex 115	. . . . 5 |- (EXMID -> ( ( r TAp x /\ s TAp x ) -> r = s ) )
11	10	alrimivv 1923	. . . 4 |- (EXMID -> A. r A. s ( ( r TAp x /\ s TAp x ) -> r = s ) )
12		tapeq1 7470	. . . . 5 |- ( r = s -> ( r TAp x <-> s TAp x ) )
13	12	mo4 2141	. . . 4 |- ( E* r r TAp x <-> A. r A. s ( ( r TAp x /\ s TAp x ) -> r = s ) )
14	11, 13	sylibr 134	. . 3 |- (EXMID -> E* r r TAp x )
15	14	alrimiv 1922	. 2 |- (EXMID -> A. x E* r r TAp x )
16		2onn 6688	. . . 4 |- 2o e. om
17		tapeq2 7471	. . . . . 6 |- ( x = 2o -> ( r TAp x <-> r TAp 2o ) )
18	17	mobidv 2115	. . . . 5 |- ( x = 2o -> ( E* r r TAp x <-> E* r r TAp 2o ) )
19	18	spcgv 2893	. . . 4 |- ( 2o e. om -> ( A. x E* r r TAp x -> E* r r TAp 2o ) )
20	16, 19	ax-mp 5	. . 3 |- ( A. x E* r r TAp x -> E* r r TAp 2o )
21		2omotap 7477	. . 3 |- ( E* r r TAp 2o -> EXMID )
22	20, 21	syl 14	. 2 |- ( A. x E* r r TAp x -> EXMID )
23	15, 22	impbii 126	1 |- (EXMID <-> A. x E* r r TAp x )

Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105   A.wal 1395   = wceq 1397   E*wmo 2080   e. wcel 2202   =/= wne 2402   {copab 4149  EXMIDwem 4284   omcom 4688   2oc2o 6575   TAp wtap 7467

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-nul 4215  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-iinf 4686

This theorem depends on definitions:  df-bi 117  df-stab 838  df-dc 842  df-3or 1005  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-ral 2515  df-rex 2516  df-rab 2519  df-v 2804  df-sbc 3032  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-br 4089  df-opab 4151  df-mpt 4152  df-tr 4188  df-exmid 4285  df-id 4390  df-iord 4463  df-on 4465  df-suc 4468  df-iom 4689  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-fo 5332  df-fv 5334  df-1st 6302  df-2nd 6303  df-1o 6581  df-2o 6582  df-pap 7466  df-tap 7468

This theorem is referenced by: (None)