Theorem isoti 7009

Description: An isomorphism preserves tightness. (Contributed by Jim Kingdon, 26-Nov-2021.)

Assertion

Ref	Expression
isoti	⊢ (𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵) → (∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐴 (𝑢 = 𝑣 ↔ (¬ 𝑢𝑅𝑣 ∧ ¬ 𝑣𝑅𝑢)) ↔ ∀𝑢 ∈ 𝐵 ∀𝑣 ∈ 𝐵 (𝑢 = 𝑣 ↔ (¬ 𝑢𝑆𝑣 ∧ ¬ 𝑣𝑆𝑢))))

Distinct variable groups:   𝑢,𝐴,𝑣   𝑢,𝐵,𝑣   𝑢,𝐹,𝑣   𝑢,𝑅,𝑣   𝑢,𝑆,𝑣

Proof of Theorem isoti

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		isocnv 5815	. . . 4 ⊢ (𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵) → ◡𝐹 Isom 𝑆, 𝑅 (𝐵, 𝐴))
2		isotilem 7008	. . . 4 ⊢ (◡𝐹 Isom 𝑆, 𝑅 (𝐵, 𝐴) → (∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐴 (𝑢 = 𝑣 ↔ (¬ 𝑢𝑅𝑣 ∧ ¬ 𝑣𝑅𝑢)) → ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥 = 𝑦 ↔ (¬ 𝑥𝑆𝑦 ∧ ¬ 𝑦𝑆𝑥))))
3	1, 2	syl 14	. . 3 ⊢ (𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵) → (∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐴 (𝑢 = 𝑣 ↔ (¬ 𝑢𝑅𝑣 ∧ ¬ 𝑣𝑅𝑢)) → ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥 = 𝑦 ↔ (¬ 𝑥𝑆𝑦 ∧ ¬ 𝑦𝑆𝑥))))
4		isotilem 7008	. . 3 ⊢ (𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵) → (∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥 = 𝑦 ↔ (¬ 𝑥𝑆𝑦 ∧ ¬ 𝑦𝑆𝑥)) → ∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐴 (𝑢 = 𝑣 ↔ (¬ 𝑢𝑅𝑣 ∧ ¬ 𝑣𝑅𝑢))))
5	3, 4	impbid 129	. 2 ⊢ (𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵) → (∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐴 (𝑢 = 𝑣 ↔ (¬ 𝑢𝑅𝑣 ∧ ¬ 𝑣𝑅𝑢)) ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥 = 𝑦 ↔ (¬ 𝑥𝑆𝑦 ∧ ¬ 𝑦𝑆𝑥))))
6		equequ1 1712	. . . 4 ⊢ (𝑥 = 𝑢 → (𝑥 = 𝑦 ↔ 𝑢 = 𝑦))
7		breq1 4008	. . . . . 6 ⊢ (𝑥 = 𝑢 → (𝑥𝑆𝑦 ↔ 𝑢𝑆𝑦))
8	7	notbid 667	. . . . 5 ⊢ (𝑥 = 𝑢 → (¬ 𝑥𝑆𝑦 ↔ ¬ 𝑢𝑆𝑦))
9		breq2 4009	. . . . . 6 ⊢ (𝑥 = 𝑢 → (𝑦𝑆𝑥 ↔ 𝑦𝑆𝑢))
10	9	notbid 667	. . . . 5 ⊢ (𝑥 = 𝑢 → (¬ 𝑦𝑆𝑥 ↔ ¬ 𝑦𝑆𝑢))
11	8, 10	anbi12d 473	. . . 4 ⊢ (𝑥 = 𝑢 → ((¬ 𝑥𝑆𝑦 ∧ ¬ 𝑦𝑆𝑥) ↔ (¬ 𝑢𝑆𝑦 ∧ ¬ 𝑦𝑆𝑢)))
12	6, 11	bibi12d 235	. . 3 ⊢ (𝑥 = 𝑢 → ((𝑥 = 𝑦 ↔ (¬ 𝑥𝑆𝑦 ∧ ¬ 𝑦𝑆𝑥)) ↔ (𝑢 = 𝑦 ↔ (¬ 𝑢𝑆𝑦 ∧ ¬ 𝑦𝑆𝑢))))
13		equequ2 1713	. . . 4 ⊢ (𝑦 = 𝑣 → (𝑢 = 𝑦 ↔ 𝑢 = 𝑣))
14		breq2 4009	. . . . . 6 ⊢ (𝑦 = 𝑣 → (𝑢𝑆𝑦 ↔ 𝑢𝑆𝑣))
15	14	notbid 667	. . . . 5 ⊢ (𝑦 = 𝑣 → (¬ 𝑢𝑆𝑦 ↔ ¬ 𝑢𝑆𝑣))
16		breq1 4008	. . . . . 6 ⊢ (𝑦 = 𝑣 → (𝑦𝑆𝑢 ↔ 𝑣𝑆𝑢))
17	16	notbid 667	. . . . 5 ⊢ (𝑦 = 𝑣 → (¬ 𝑦𝑆𝑢 ↔ ¬ 𝑣𝑆𝑢))
18	15, 17	anbi12d 473	. . . 4 ⊢ (𝑦 = 𝑣 → ((¬ 𝑢𝑆𝑦 ∧ ¬ 𝑦𝑆𝑢) ↔ (¬ 𝑢𝑆𝑣 ∧ ¬ 𝑣𝑆𝑢)))
19	13, 18	bibi12d 235	. . 3 ⊢ (𝑦 = 𝑣 → ((𝑢 = 𝑦 ↔ (¬ 𝑢𝑆𝑦 ∧ ¬ 𝑦𝑆𝑢)) ↔ (𝑢 = 𝑣 ↔ (¬ 𝑢𝑆𝑣 ∧ ¬ 𝑣𝑆𝑢))))
20	12, 19	cbvral2v 2718	. 2 ⊢ (∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥 = 𝑦 ↔ (¬ 𝑥𝑆𝑦 ∧ ¬ 𝑦𝑆𝑥)) ↔ ∀𝑢 ∈ 𝐵 ∀𝑣 ∈ 𝐵 (𝑢 = 𝑣 ↔ (¬ 𝑢𝑆𝑣 ∧ ¬ 𝑣𝑆𝑢)))
21	5, 20	bitrdi 196	1 ⊢ (𝐹 Isom 𝑅, 𝑆 (𝐴, 𝐵) → (∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐴 (𝑢 = 𝑣 ↔ (¬ 𝑢𝑅𝑣 ∧ ¬ 𝑣𝑅𝑢)) ↔ ∀𝑢 ∈ 𝐵 ∀𝑣 ∈ 𝐵 (𝑢 = 𝑣 ↔ (¬ 𝑢𝑆𝑣 ∧ ¬ 𝑣𝑆𝑢))))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 104   ↔ wb 105  ∀wral 2455   class class class wbr 4005  ^◡ccnv 4627   Isom wiso 5219

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 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-14 2151  ax-ext 2159  ax-sep 4123  ax-pow 4176  ax-pr 4211

This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ral 2460  df-rex 2461  df-v 2741  df-sbc 2965  df-un 3135  df-in 3137  df-ss 3144  df-pw 3579  df-sn 3600  df-pr 3601  df-op 3603  df-uni 3812  df-br 4006  df-opab 4067  df-id 4295  df-xp 4634  df-rel 4635  df-cnv 4636  df-co 4637  df-dm 4638  df-rn 4639  df-res 4640  df-ima 4641  df-iota 5180  df-fun 5220  df-fn 5221  df-f 5222  df-f1 5223  df-fo 5224  df-f1o 5225  df-fv 5226  df-isom 5227

This theorem is referenced by:  supisoti  7012